Results 91 to 100 of about 2,689 (221)
Lower bounds for Quantum Oblivious Transfer [PDF]
, 2010 Oblivious transfer is a fundamental primitive in cryptography. While perfect information theoretic security is impossible, quantum oblivious transfer protocols can limit the dishonest players' cheating.
Chailloux, André +2 more
core +1 more source
Symmetric Blind Decryption with Perfect Secrecy
Journal of Computer Networks and Communications, 2017 A blind decryption scheme enables a user to query decryptions from a decryption server without revealing information about the plain-text message. Such schemes are useful, for example, for the implementation of privacy-preserving encrypted file storages ...
Juha Partala
doaj +1 more source
Oblivious Transfer with Adaptive Queries [PDF]
, 1999 We provide protocols for the following two-party problem: One party, the sender, has N values and the other party, the receiver, would like to learn k of them, deciding which ones in an adaptive manner (i.e. the ith value may depend on the first i-1 values). The sender does not want the receiver to obtain more than k values.
Moni Naor, Benny Pinkas
openaire +1 more source
National Relics: Secular Sacrality, Museums, and Heritage‐Making in Nineteenth‐Century Chile
Museum Anthropology, Volume 49, Issue 2, Fall 2026.ABSTRACT This article examines how objects and bodily remains are transformed and ritualized into national relics through collecting and exhibiting practices in museums. Focusing on nineteenth‐century Chile, it draws on archival sources, material culture theory, and the anthropology of religion to argue that objects associated with Chile's nation‐state
Hugo Rueda Ramírez
wiley +1 more source
Mobile agent security with efficient oblivious transfer [PDF]
, 2007 Cachin et al. and Algesheimer et al. proposed schemes using secure function evaluation for protecting mobile agents in untrusted environments. One of essential ingredients of their protocols is oblivious transfer (although not all of them require it ...
Hasegawa, Wataru +2 more
core
More Efficient Oblivious Transfer Extensions [PDF]
, 2017 Oblivious transfer (OT) is one of the most fundamental primitives in cryptography and is widely used in protocols for secure two-party and multi-party computation. As secure computation becomes more practical, the need for practical large scale oblivious
Lindell, Yehuda +7 more
core +1 more source
Row‐Aware Randomized SVD With Applications
Numerical Linear Algebra with Applications, Volume 33, Issue 3, June 2026.ABSTRACT The randomized singular value decomposition proposed in [28] has certainly become one of the most well‐established randomization‐based algorithms in numerical linear algebra. The key ingredient of the entire procedure is the computation of a subspace which is close to the column space of the target matrix A∈ℝm×n$$ \mathbf{A}\in {\mathbb{R}}^{m\
Davide Palitta, Sascha Portaro
wiley +1 more source
Efficient k-out-ofn oblivious transfer schemes,” [PDF]
, 2008 : Oblivious transfer is an important cryptographic protocol in various security applications. For example, in on-line transactions, a k-out-of-n oblivious transfer scheme allows a buyer to privately choose k out of n digital goods from a merchant without
Chu, Cheng-Kang +5 more
core +1 more source
Robuster Combiners for Oblivious Transfer [PDF]
, 2007 A (k; n)-robust combiner for a primitive F takes as input n candidate implementations of F and constructs an implementation of F, which is secure assuming that at least k of the input candidates are secure. Such constructions provide robustness against insecure implementations and wrong assumptions underlying the candidate schemes.
Remo Meier +2 more
openaire +1 more source
The RAND Journal of Economics, Volume 57, Issue 2, Page 334-348, Summer 2026.ABSTRACT We study a long‐horizon, oligopolistic market with random shocks to demand that can be arbitraged by two storage operators with finite capacity. This problem applies to any storable commodity—that is, most commodities. Because the arbitrage spread is so sensitive to market power, storage operators face strong incentives to restrain quantities ...
Sergei Balakin, Guillaume Roger
wiley +1 more source