Efficiency-improved fully simulatable adaptive OT under the DDH assumption

Authors:
Kaoru Kurosawa;Ryo Nojima;Le Trieu Phong
Affiliations:
Ibaraki University, Japan;NICT, Japan;NICT, Japan
Venue:
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Year:
2010

Citing 14
Cited 4

Zero-knowledge undeniable signatures (extended abstract)

EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Oblivious transfer and polynomial evaluation

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Efficient oblivious transfer protocols

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A verifiable secret shuffle and its application to e-voting

CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Oblivious Transfer with Adaptive Queries

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions

PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Number-theoretic constructions of efficient pseudo-random functions

Journal of the ACM (JACM)
Oblivious keyword search

Journal of Complexity - Special issue on coding and cryptography
Simulatable Adaptive Oblivious Transfer

EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Universally Composable Adaptive Oblivious Transfer

ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection

TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Simple Adaptive Oblivious Transfer without Random Oracle

ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Efficient k-out-of-n oblivious transfer schemes with adaptive and non-adaptive queries

PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Smooth projective hashing and two-message oblivious transfer

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques

Practical adaptive oblivious transfer from simple assumptions

TCC'11 Proceedings of the 8th conference on Theory of cryptography
Generic fully simulatable adaptive oblivious transfer

ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Simulatable adaptive oblivious transfer with statistical receiver's privacy

ProvSec'11 Proceedings of the 5th international conference on Provable security
A more efficient computationally sound non-interactive zero-knowledge shuffle argument

Journal of Computer Security - Advances in Security for Communication Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

At Asiacrypt 2009, Kurosawa and Nojima showed a fully simulatable adaptive oblivious transfer (OT) protocol under the DDH assumption in the standard model. However, Green and Hohenberger pointed out that the communication cost of each transfer phase is O(n), where n is the number of the sender's messages. In this paper, we show that the cost can be reduced to O(1) by utilizing a verifiable shuffle protocol.