Fully-Simulatable Oblivious Set Transfer

Authors:
Huafei Zhu
Affiliations:
C&S Department, I2R, Singapore
Venue:
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
Year:
2008

Citing 14
Cited 0

A randomized protocol for signing contracts

Communications of the ACM
How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
All-or-nothing disclosure of secrets

Proceedings on Advances in cryptology---CRYPTO '86
Lower bounds for sampling algorithms for estimating the average

Information Processing Letters
Computational Sample Complexity

SIAM Journal on Computing
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
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
A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System

PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Replication is not needed: single database, computationally-private information retrieval

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Protocols for secure computations

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Simulatable Adaptive Oblivious Transfer

EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Public-key cryptosystems based on composite degree residuosity classes

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Blind identity-based encryption and simulatable oblivious transfer

ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Efficient fully-simulatable oblivious transfer

CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a new notion which we call oblivious set transfer is introduced and formalized. An oblivious set transfer in essence, is an extension of the notions of oblivious bit transfer and oblivious string transfer protocols. The security of oblivious set transfer protocols is defined in the real/ideal world simulation paradigm. We show that oblivious set transfer protocols that are provably secure in the full simulation model can be efficiently implemented assuming the existence of semantically secure encryption schemes, perfectly hiding commitments and perfectly binding commitments.