Single Database Private Information Retrieval Implies Oblivious Transfer

Crescenzo, Giovanni Di; Malkin, Tal; Ostrovsky, Rafail

doi:10.1007/3-540-45539-6_10

Cited by 111 publications

(88 citation statements)

References 37 publications

(83 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Homomorphic encryption has been show to imply Private Information Retrieval (PIR) [KO97], [Man98], [IKO05]. Since PIR implies Collision Resistant Hash Functions [IKO05], Oblivious Transfer [CMO00], and lossy encryption [HLOV11], we immediately have constructions of any of these primitives based on any homomorphic encryption. The work of [AKP10] provides a clean abstraction of homomorphic encryption and a discussion of homomorphic encryption and its relations to IND-CCA1 security.…”

Section: Introductionmentioning

confidence: 99%

On Homomorphic Encryption and Chosen-Ciphertext Security

Hemenway

Ostrovsky

2012

Public Key Cryptography – PKC 2012

Self Cite

View full text Add to dashboard Cite

Abstract. Chosen-Ciphertext (IND-CCA) security is generally considered the right notion of security for a cryptosystem. Because of its central importance much effort has been devoted to constructing IND-CCA secure cryptosystems. In this work, we consider constructing IND-CCA secure cryptosystems from (group) homomorphic encryption. Our main results give natural and efficient constructions of IND-CCA secure cryptosystems from any homomorphic encryption scheme that satisfies weak cyclic properties, either in the plaintext, ciphertext or randomness space. Our results have the added benefit of being simple to describe and analyze.

show abstract

Section: Introductionmentioning

confidence: 99%

On Homomorphic Encryption and Chosen-Ciphertext Security

Hemenway

Ostrovsky

2012

Public Key Cryptography – PKC 2012

Self Cite

View full text Add to dashboard Cite

show abstract

“…13 Specifically, a large database x of N entries is held by a distinguished party, say P 1 , who functions as a sender. The entries of the database are indexed by some finite group of size N, which is taken to be Z N by default.…”

Section: Oblivious Transfer With Distributed Receivermentioning

confidence: 99%

“…We start by noting that 1-out-of-2 OT can be implemented from Sample-AS, using a result in [13]. Thus, the reduction may use 1-out-of-2 OT in addition to Sample-AS.…”

Section: Proofmentioning

confidence: 99%

“…(We make the security parameter k and the size N of the database implicit in the above notation.) We note that the general transformation from [46,13] gives a black-box construction of one-round sublinear-communication OT from one-round PIR. In the following we present an efficient construction of a DistOT protocol from any one-round OT protocol.…”

Section: An ''Almost Black-box'' Construction Of Distot Using One-roumentioning

confidence: 99%

See 1 more Smart Citation

Private Multiparty Sampling and Approximation of Vector Combinations

Ishai

Malkin

Strauss

et al. 2007

Automata, Languages and Programming

Self Cite

View full text Add to dashboard Cite

a b s t r a c tWe consider the problem of private efficient data mining of vertically-partitioned databases. Each of several parties holds a column of a data matrix (a vector) and the parties want to investigate the componentwise combination of their vectors. The parties want to minimize communication and local computation while guaranteeing privacy in the sense that no party learns more than necessary. Sublinear-communication private protocols have primarily been studied only in the two-party case. In contrast, this work focuses on multiparty settings.First, we give efficient private multiparty protocols for sampling a row of the data matrix and for computing arbitrary functions of a random row, where the row index is additively shared among two or more parties. These results can be used to obtain private approximation protocols for several useful combination functionalities. Moreover, these results have some interesting consequences for the general problem of reducing sublinear-communication secure multiparty computation to two-party private information retrieval (PIR).Second, we give protocols for computing approximations (summaries) of the componentwise sum, minimum, and maximum of the columns. Here, while providing a weaker privacy guarantee (where the approximation may leak up to the entire output vector), our protocols are extremely efficient. In particular, the required cryptographic overhead (compared to non-private solutions) is polylogarithmic in the number of rows.

show abstract

“…In [9,15], another property, namely data privacy, is also defined for PIR, and we refer the reader to the paper for details.…”

Section: Appendix A: An Introduction To Pirmentioning

confidence: 99%

A Formal Study of the Privacy Concerns in Biometric-Based Remote Authentication Schemes

Tang

Bringer

Chabanne

et al. 2008

Information Security Practice and Experience

View full text Add to dashboard Cite

With their increasing popularity in cryptosystems, biometrics have attracted more and more attention from the information security community. However, how to handle the relevant privacy concerns remains to be troublesome. In this paper, we propose a novel security model to formalize the privacy concerns in biometric-based remote authentication schemes. Our security model covers a number of practical privacy concerns such as identity privacy and transaction anonymity, which have not been formally considered in the literature. In addition, we propose a general biometric-based remote authentication scheme and prove its security in our security model.

show abstract

Single Database Private Information Retrieval Implies Oblivious Transfer

Cited by 111 publications

References 37 publications

On Homomorphic Encryption and Chosen-Ciphertext Security

On Homomorphic Encryption and Chosen-Ciphertext Security

Private Multiparty Sampling and Approximation of Vector Combinations

A Formal Study of the Privacy Concerns in Biometric-Based Remote Authentication Schemes

Contact Info

Product

Resources

About