How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
All-or-nothing disclosure of secrets
Proceedings on Advances in cryptology---CRYPTO '86
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Efficient identification and signatures for smart cards
CRYPTO '89 Proceedings on Advances in cryptology
Protecting data privacy in private information retrieval schemes
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Communications of the ACM
Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy
Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Targeted Advertising ... And Privacy Too
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Batch Verification with Applications to Cryptography and Checking
LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Priced Oblivious Transfer: How to Sell Digital Goods
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Replication is not needed: single database, computationally-private information retrieval
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Batch codes and their applications
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Querying Databases Privately: A New Approach To Private Information Retrieval.
Querying Databases Privately: A New Approach To Private Information Retrieval.
Short Signatures from the Weil Pairing
Journal of Cryptology
Improving the Robustness of Private Information Retrieval
SP '07 Proceedings of the 2007 IEEE Symposium on Security and Privacy
A practical scheme for non-interactive verifiable secret sharing
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Constant-Round Multiparty Computation for Interval Test, Equality Test, and Comparison
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Controlling Access to an Oblivious Database Using Stateful Anonymous Credentials
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Oblivious transfer with access control
Proceedings of the 16th ACM conference on Computer and communications security
Restrictive binding of secret-key certificates
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Proving in zero-knowledge that a number is the product of two safe primes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Efficient proofs that a committed number lies in an interval
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
A survey of single-database private information retrieval: techniques and applications
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Privacy-preserving queries over relational databases
PETS'10 Proceedings of the 10th international conference on Privacy enhancing technologies
SEPIA: privacy-preserving aggregation of multi-domain network events and statistics
USENIX Security'10 Proceedings of the 19th USENIX conference on Security
Oblivious transfer with access control: realizing disjunction without duplication
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Oblivious transfer with hidden access control policies
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Privad: practical privacy in online advertising
Proceedings of the 8th USENIX conference on Networked systems design and implementation
Unlinkable priced oblivious transfer with rechargeable wallets
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Batch proofs of partial knowledge
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
| Hi-index | 0.00 |
We extend Goldberg's multi-server information-theoretic private information retrieval (PIR) with a suite of protocols for privacy-preserving e-commerce. Our first protocol adds support for single-payee tiered pricing, wherein users purchase database records without revealing the indices or prices of those records. Tiered pricing lets the seller set prices based on each user's status within the system; e.g., non-members may pay full price while members may receive a discounted rate. We then extend tiered pricing to support group-based access control lists with record-level granularity; this allows the servers to set access rights based on users' price tiers. Next, we show how to do some basic bookkeeping to implement a novel top-K replication strategy that enables the servers to construct bestsellers lists, which facilitate faster retrieval for these most popular records. Finally, we build on our bookkeeping functionality to support multiple payees, thus enabling several sellers to offer their digital goods through a common database while enabling the database servers to determine to what portion of revenues each seller is entitled. Our protocols maintain user anonymity in addition to query privacy; that is, queries do not leak information about the index or price of the record a user purchases, the price tier according to which the user pays, the user's remaining balance, or even whether the user has ever queried the database before. No other priced PIR or oblivious transfer protocol supports tiered pricing, access control lists, multiple payees, or top-K replication, whereas ours supports all of these features while preserving PIR's sublinear communication complexity. We have implemented our protocols as an add-on to Percy++, an open source implementation of Goldberg's PIR scheme. Measurements indicate that our protocols are practical for deployment in real-world e-commerce applications.