Unlinkable Priced Oblivious Transfer with Rechargeable Wallets

Camenisch, Jan; Dubovitskaya, Maria; Neven, Gregory

doi:10.1007/978-3-642-14577-3_8

Cited by 30 publications

(46 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In Camenisch et al's OT construction [2,3], the entire encrypted database is published. The encryption key for the i th record is a unique signature on the message "i".…”

Section: Symmetric Pir and Oblivious Transfermentioning

confidence: 99%

“…Since the signature is blind, the signer does not learn the message to be signed, which is the index of the record. In order to enforce access control (AOT [2]) or pricing (POT [3]), access control or pricing information is encoded in the signature as well. The client proves that the blinded message is well formed, and that her credential satisfies the access control policy specified in that blinded message.…”

Section: Symmetric Pir and Oblivious Transfermentioning

confidence: 99%

“…In Camenisch et al's OT construction [2,3], the encryption key of a record is a unique signature on its index. In a nutshell, the client blinds a message Ei, which is a one-way function of the record index i (as well as of pricing or access control information, if needed), by raising it to a random power k. The server signs the blinded message Ei k using a secret key h by computing σ = e(Ei k , h) where e is a bilinear pairing.…”

Section: Threshold Signaturementioning

confidence: 99%

See 2 more Smart Citations

Outsourced private information retrieval

Huang

Goldberg

2013

Proceedings of the 12th ACM Workshop on Workshop on Privacy in the Electronic Society

View full text Add to dashboard Cite

We propose a scheme for outsourcing Private Information Retrieval (PIR) to untrusted servers while protecting the privacy of the database owner as well as that of the database clients. We observe that by layering PIR on top of an Oblivious RAM (ORAM) data layout, we provide the ability for the database owner to perform private writes, while database clients can perform private reads from the database even while the owner is offline. Our system is compatible with existing PIR access control and pricing schemes on a per-record basis for these reads. This extends the usual ORAM model by allowing multiple database readers without requiring trusted hardware; indeed, almost all of the computation in our scheme during reads is performed by untrusted cloud servers. We make a second observation that the database owner can always conduct a private read as an ordinary database client, and the private write protocol does not have to provide a "read" functionality as a standard ORAM protocol does. Based on the two observations, we construct an end-to-end system that privately updates a 1 MB record in a 1 TB database with an amortized end-toend response time as low as 300 ms when the database owner has a fast network connection to the database servers, and about 1 minute over a slow ADSL connection. Private read times by the database readers are on the order of seconds in either case.

show abstract

“…In Camenisch et al's OT construction [2,3], the entire encrypted database is published. The encryption key for the i th record is a unique signature on the message "i".…”

Section: Symmetric Pir and Oblivious Transfermentioning

confidence: 99%

Section: Symmetric Pir and Oblivious Transfermentioning

confidence: 99%

Section: Threshold Signaturementioning

confidence: 99%

See 1 more Smart Citation

Outsourced private information retrieval

Huang

Goldberg

2013

Proceedings of the 12th ACM Workshop on Workshop on Privacy in the Electronic Society

View full text Add to dashboard Cite

show abstract

“…By combining anonymous credentials with adaptive oblivious transfer protocols, solutions exist where the user can obtain the records she's entitled to, without revealing the applicable access control policy to the database, or which roles she has [CDN09]. By another combination of such techniques, the database can attach different prices for each record, and let users only download as many records as their prepaid balance allows, all while remaining completely anonymous [CDN10].…”

Section: Example Applicationsmentioning

confidence: 99%

Saving On-Line Privacy

Camenisch¹,

Neven²

2010

IFIP Advances in Information and Communication Technology

Self Cite

View full text Add to dashboard Cite

Abstract. With the increasing use of electronic media for our daily transactions, we widely distribute our personal information. Once released, controlling the dispersal of these information is virtually impossible. Privacy-enhancing technologies can help to minimize the amount of information that needs to be revealed in transactions, on the one hand, and to limit the dispersal, on the other hand. Unfortunately, these technologies are hardly used today. In this paper we aim to foster the adoption by providing a summary of what such technologies can achieve. We hope that by this, policy makers, system architects, and security practitioners will be able to employ privacy-enhancing technologies.

show abstract

“…As explained in [14], these protocols fail even under sequential composition and are shown to be vulnerable to practical attacks. Afterwards, a number of universally composable (UC)-secure priced oblivious transfer protocols have been proposed [19], [10], [20]. The UCsecurity paradigm [12] provides a framework for representing cryptographic protocols and analysing their security.…”

Section: Introductionmentioning

confidence: 99%

Universally Composable Efficient Priced Oblivious Transfer from a Flexible Membership Encryption

Datta

Dutta

Mukhopadhyay

2014

Information Security and Privacy

View full text Add to dashboard Cite

Abstract. Membership encryption is a newly developed cryptographic primitive that combines membership proof and encryption into an unified setting. This paper presents a new flexible membership encryption scheme which is provably secure and significantly more efficient than the previous scheme. Further we apply our proposed membership encryption to construct a round optimal 1-outof-n priced oblivious transfer (POT) protocol which, unlike the existing 1-out-of-n POT schemes, is proven secure under the universally composable (UC) security model and thus preserves security when it is executed with multiple protocol instances that run concurrently in an adversarily controlled way. Moreover, using our membership encryption, the POT protocol exhibits constant communication complexity on the buyer's side and O(n) communication cost on the vendor's side, which is so far the best known in the literature.Keywords: membership encryption, priced oblivious transfer, universally composable security, bilinear maps, non-interactive proof of knowledge, P-Signature, non-interactive range proof.

show abstract

Unlinkable Priced Oblivious Transfer with Rechargeable Wallets

Cited by 30 publications

References 21 publications

Outsourced private information retrieval

Outsourced private information retrieval

Saving On-Line Privacy

Universally Composable Efficient Priced Oblivious Transfer from a Flexible Membership Encryption

Contact Info

Product

Resources

About