All-or-Nothing Disclosure of Secrets

By Gilles Brassard, C. Crépeau, J. Robert. 1986

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

XPIR : Private Information Retrieval for Everyone (2016, background): “Works considering only computational or communication costs In the Oblivious Transfer setting [27], the objective is to limit the computational cost for the user and the database without considering communication efﬁ-ciency.”
PRISM - Privacy-Preserving Search in MapReduce (2012, background): “However, PRISM offers higher privacy guarantees since in existing searchable encryption solutions [4, 6–8, 10, 16, 21, 31, 36], the result (“found” or “not found”) originating from a query is known to the adversary; therefore as opposed to PRISM, standard searchable encryption techniques do not ensu”
Secure Multiparty Computation (2011, unknown): “The version that will be used in the remainder of the chapter is chosen 1-out-of-k OT (also called all or nothing disclosure of secrets) and was introduced in [3].”
CrypTFlow2: Practical 2-Party Secure Inference (2020, background): “Let (k 1 ) -OTl denote the 1-out-of-k Oblivious Transfer (OT) functionality [16] (which generalizes 1-out-of-2 OT [27, 54]).”
Privacy-Preserving Machine Learning for Speech Processing (2012, background): “Another extension is the k-n OT problem [Brassard et al., 1986], where Alice has n inputs, and Bob has k selectors {s0, . . . , sn−1}.”
Privacy-preserving cooperative scientific computations (2001, background): “An 1-out-of-N Oblivious Transfer protocol [7, 4] refers to a protocol where at the beginning of the protocol one party, Bob has N inputs X1, .”
Computationally Secure Oblivious Transfer (2004, background): “[7] under the name ANDOS (all or nothing disclosure of secrets).”
Advances in Cryptology — ASIACRYPT 2000 (2000, methodology): “We describe the technique in the bivariate case, following a simplified approach due to HowgraveGraham [7].”
One (Block) Size Fits All: PIR and SPIR with Variable-Length Records via Multi-Block Queries (2013, methodology): “…from simpler PIR protocols using Kushilevitz and Ostrovsky’s heuristic: the creators of both schemes have augmented their respective protocols to support some additional, nonstandard features that make them suitable for deployment in scenarios outside of the standard SPIR and OT use cases.”
Secure multi-party computation problems and their applications: a review and open problems (2001, methodology): “With the help of 1-out-of-N Oblivious Transfer protocol [17, 9], Bob is able to learn the value of P (M1 + M2)Q and P (b1 + b2).”
Privacy-preserving cooperative statistical analysis (2001, background): “An 1-outof-N Oblivious Transfer protocol [6, 4] refers to a protocol where at the beginning of the protocol one party, Bob has N inputs X1, .”
Private Searching on Streaming Data (2005, background): “Our work is most closely related to the notion of Single-database Private Information Retrieval (PIR), that was introduced by Kushilevitz and Ostrovsky [16] and has received a lot of subsequent attention in the literature [16, 6, 9, 20, 17, 5, 23, 18, 12].”
Scalable and Private Media Consumption with Popcorn (2016, background): “Relatedly, 1-out-of-N oblivious transfer (OT) [20, 73] provides the same content protection property as SPIR but, unlike SPIR, can have network overhead linear in the size of the library.”
Extending Oblivious Transfers Efficiently (2003, methodology): “Oblivious transfer (OT) [32,10, 6 ,23] is a ubiquitous cryptographic primitive that may be used to implement a wide variety of other cryptographic protocols, including secret key exchange, contract signing [10], and secure function evaluation [36,19,20,23].”