Priced Oblivious Transfer: How to Sell Digital Goods

By William Aiello, Yuval Ishai, Omer Reingold. International Conference on the Theory and Application of Cryptographic Techniques, 2001

432 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/22a0fdd14ec069733d15ef7caf7145150e7c32b5

How researchers see this paper

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

In Artificial Intelligence

1. Dan Boneh
2. Thomas Schneider
3. Benny Pinkas
4. Jonathan Katz
5. Yehuda Lindell
6. David E. Evans
7. Craig Gentry
8. Shai Halevi

In Computational Theory and Mathematics

1. Thomas Schneider
2. Yehuda Lindell
3. Benny Pinkas
4. Jonathan Katz
5. Dan Boneh
6. Craig Gentry
7. Amit Sahai
8. David E. Evans

Citations in the corpus

• Optimal Rate Private Information Retrieval from Homomorphic Encryption (2015, background): “Laur and Lipmaa [23] modified the Aiello-Ishai-Reingold transformation to work with the Damgård-Jurik cryptosystem.”
• Evaluating Branching Programs on Encrypted Data (2007, methodology): “The solution of [1] is to let ˜ c be a random encryption of s + ρm , where ρ is a random integer between 1 and the order of the plaintext group.”
• Privacy-Preserving Machine Learning for Speech Processing (2012, background): “1-2 Oblivious Transfer (OT) can also be generalized to 1-n OT [Naor and Pinkas, 1999a; Aiello et al., 2001; Laur and Lipmaa, 2007], where Alice has n inputs {b0, . . . ,bn−1, and Bob has a selector integer s = {0, . . . ,n− 1}.”
• Improved Garbled Circuit: Free XOR Gates and Applications (2008, methodology): “One-round OT is a widely studied primitive in the standard model [2,1], with improved implementations in the RO model [20,3].”
• Efficient Private Matching and Set Intersection (2004, neutral): “cols of [19, 1, 17].”
• Efficiency Tradeoffs for Malicious Two-Party Computation (2006, methodology): “We need a conditional disclosure protocol as described in [AIR01].”
• Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima (2009, methodology): “As underlying OTt′ protocol we use the protocol of [2] implemented over a suitably chosen elliptic curve and using point compression (see the full version of this paper [32] for details).”
• Secure Multiparty Computation for Privacy-Preserving Data Mining (2009, methodology): “Oblivious transfer protocols with similar overhead that provide privacy against malicious adversaries (as in Definition 4), were presented in (2; 36) (based on the Decisional Diffie-Hellman assumption), and later generalized in (25) to use smooth projective hashing with a special property (and as a ”
• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries (2007, background): “Highly efficient protocols under this assumption are known [1,17].”
• Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries (2008, background): “The OT’s need to be performed in a manner which has a simulation based proof of security against malicious adversaries, hence the simple protocols of [17, 1, 12] are not suitable for our purposes (the simulation based proof is needed in order to be able to use a composition of the OT protocol in our”
• A Marketplace for Data: An Algorithmic Solution (2018, background): “[2]).”
• Efficient Privacy-Preserving Face Recognition (2009, neutral): “It can be instantiated efficiently with different protocols [25,1,23,19].”
• Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries (2008, methodology): “This construction is based on the protocols of [1,23] and only requires 26 exponentiations per execution.”
• Scalable and Private Media Consumption with Popcorn (2016, background): “, prior works [13, 22, 53, 96] have addressed them in different contexts).”
• Keyword Search and Oblivious Pseudorandom Functions (2005, methodology): “1 In the case of malicious parties, we use a slightly relaxed notion of security, following one suggested in the context of OT [1, 23] (see Section 2).”
• Witness encryption and its applications (2013, background): “This distinguishes the goal of witness encryption from the interactive setting, where general secure two-party protocols [37, 16] may be used for this purpose [2].”
• An Oblivious Transfer Protocol with Log-Squared Communication (2005, methodology): “This can be compared with essentially constant-time Receiver’s computation and linear-time Sender’s computation in the linear-communication CPIRn ‘ protocols of [NP01, AIR01 ].”