The Simplest Protocol for Oblivious Transfer

Chou, Tai‐Li; Orlandi, Claudio

doi:10.1007/978-3-319-22174-8_3

Cited by 128 publications

(119 citation statements)

References 25 publications

Supporting

Mentioning

101

Contrasting

Unclassified

Order By: Relevance

“…There are also chosen-key settings where the adversary is allowed to entirely choose the keys. For example, certain MPC protocols [CO15] rely on AE schemes that need to be committing against malicious adversaries, which can choose all inputs and thus also the keys. This has lead to the formalizations of committing [GLR17] and key-robust [FOR17] authenticated encryption.…”

Section: Motivationmentioning

confidence: 99%

Indifferentiable Authenticated Encryption

Barbosa

Farshim

2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We study Authenticated Encryption with Associated Data (AEAD) from the viewpoint of composition in arbitrary (single-stage) environments. We use the indifferentiability framework to formalize the intuition that a "good" AEAD scheme should have random ciphertexts subject to decryptability. Within this framework, we can then apply the indifferentiability composition theorem to show that such schemes offer extra safeguards wherever the relevant security properties are not known, or cannot be predicted in advance, as in general-purpose crypto libraries and standards. We show, on the negative side, that generic composition (in many of its configurations) and well-known classical and recent schemes fail to achieve indifferentiability. On the positive side, we give a provably indifferentiable Feistel-based construction, which reduces the round complexity from at least 6, needed for blockciphers, to only 3 for encryption. This result is not too far off the theoretical optimum as we give a lower bound that rules out the indifferentiability of any construction with less than 2 rounds.

show abstract

Section: Motivationmentioning

confidence: 99%

Indifferentiable Authenticated Encryption

Barbosa

Farshim

2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Oblivious transfer (OT) (1-out-of-) [34] enables one party the sender S to send one element out of , to a receiver R in such a way that the sender does not know which element is received by R. Furthermore, R does not find out anything about the other − 1 elements. If we consider the elements to be the stored (encrypted) biometric templates, we see that OT essentially allows one to search in the database, without revealing which item (i.e., biometric template) is selected for the matching process.…”

Section: Boxmentioning

confidence: 99%

Privacy-Preserving Biometric Authentication: Challenges and Directions

Pagnin

Mitrokotsa

2017

Security and Communication Networks

View full text Add to dashboard Cite

An emerging direction for authenticating people is the adoption of biometric authentication systems. Biometric credentials are becoming increasingly popular as a means of authenticating people due to the wide range of advantages that they provide with respect to classical authentication methods (e.g., password-based authentication). The most characteristic feature of this authentication method is the naturally strong bond between a user and her biometric credentials. This very same advantageous property, however, raises serious security and privacy concerns in case the biometric trait gets compromised. In this article, we present the most challenging issues that need to be taken into consideration when designing secure and privacypreserving biometric authentication protocols. More precisely, we describe the main threats against privacy-preserving biometric authentication systems and give directions on possible countermeasures in order to design secure and privacy-preserving biometric authentication protocols.

show abstract

“…Accordingly, the efficient instantiation of OT is of crucial importance as is evident in many recent works that focus on efficiency, e.g., [8,11,14,15,22,24,[27][28][29]32,33,43,46,49,52,56,56,60,64]. The best known OT protocol in the semi-honest and malicious case is that of [12], which achieves around 10,000 1-out-of-2 OTs per second using one thread. However, if millions or even billions of oblivious transfers need to be carried out, this will become prohibitively expensive.…”

Section: Oblivious Transfer and Extensionsmentioning

confidence: 99%

More Efficient Oblivious Transfer Extensions

et al. 2016

View full text Add to dashboard Cite

Oblivious transfer (OT) is one of the most fundamental primitives in cryptography and is widely used in protocols for secure two-party and multi-party computation. As secure computation becomes more practical, the need for practical large-scale OT protocols is becoming more evident. OT extensions are protocols that enable a relatively small number of "base-OTs" to be utilized to compute a very large number of OTs at low cost. In the semi-honest setting, Ishai et al. (Advances in cryptology-CRYPTO'03, vol 2729 of LNCS, Springer, 2003) presented an OT extension protocol for which the cost of each OT (beyond the base-OTs) is just a few hash function operations. In the malicious setting, Nielsen et al. (Advances in cryptology-CRYPTO'12, vol 7417 of LNCS, Springer, 2012) presented an efficient OT extension protocol for the setting of malicious adversaries that is secure in a random oracle model. In this work, we improve OT extensions with respect to communication complexity, computation complexity, and scalability in the semi-honest, covert, and malicious model. Furthermore, we show how to modify our maliciously secure OT extension protocol to achieve security with respect to a version of correlation robustness instead of the random oracle. We also provide specific optimizations of OT extensions that are tailored to the use of OT in various secure computation protocols such as Yao's garbled circuits and the protocol of Goldreich-Micali-Wigderson, which reduce the communication com-* This paper is a combined and extended version of [2] (ACM CCS 2013) and [3] (Eurocrypt 2015) † This work was done while the author was a Ph.D. student at the Department of Computer Science,

show abstract

The Simplest Protocol for Oblivious Transfer

Cited by 128 publications

References 25 publications

Indifferentiable Authenticated Encryption

Indifferentiable Authenticated Encryption

Privacy-Preserving Biometric Authentication: Challenges and Directions

More Efficient Oblivious Transfer Extensions

Contact Info

Product

Resources

About