Practical PIR for electronic commerce
Authors:
Open Access
- 17 October 2011
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 677-690
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Unlinkable Priced Oblivious Transfer with Rechargeable WalletsLecture Notes in Computer Science, 2010
- Constant-Size Commitments to Polynomials and Their Applications2010
- Controlling Access to an Oblivious Database Using Stateful Anonymous Credentials2009
- Constant-Round Multiparty Computation for Interval Test, Equality Test, and ComparisonIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2007
- Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation2006
- Constant-Size Dynamic k-TAA2006
- Short Signatures from the Weil PairingJournal of Cryptology, 2004
- Protecting data privacy in private information retrieval schemes1998
- Non-cryptographic fault-tolerant computing in constant number of rounds of interaction1989
- How to share a secretCommunications of the ACM, 1979