A randomized protocol for signing contracts
Communications of the ACM
All-or-nothing disclosure of secrets
Proceedings on Advances in cryptology---CRYPTO '86
Founding crytpography on oblivious transfer
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
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
Cryptographic Protocols and Voting
Proceedings of the Colloquium in Honor of Arto Salomaa on Results and Trends in Theoretical Computer Science
ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
New Results on Unconditionally Secure Distributed Oblivious Transfer
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Oblivious Transfer with Adaptive Queries
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Oblivious Transfer in the Bounded Storage Model
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
How to Solve any Protocol Problem - An Efficiency Improvement
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Non-Interactive Oblivious Transfer and Spplications
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Practical Quantum Oblivious Transfer
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
A New Efficient All-Or-Nothing Disclosure of Secrets Protocol
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Distributed Oblivious Transfer
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
The Power of RSA Inversion Oracles and the Security of Chaum's RSA-Based Blind Signature Scheme
FC '01 Proceedings of the 5th International Conference on Financial Cryptography
Efficient 1-Out-n Oblivious Transfer Schemes
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Oblivious Transfer with a Memory-Bounded Receiver
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Journal of Complexity - Special issue on coding and cryptography
Oblivious transfers and intersecting codes
IEEE Transactions on Information Theory - Part 1
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
A Secure Construction for Threshold Anonymous Password-Authenticated Key Exchange
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Very-Efficient Anonymous Password-Authenticated Key Exchange and Its Extensions
AAECC-18 '09 Proceedings of the 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
ID-Based Adaptive Oblivious Transfer
Information Security Applications
A secure threshold anonymous password-authenticated key exchange protocol
IWSEC'07 Proceedings of the Security 2nd international conference on Advances in information and computer security
Efficient oblivious augmented maps: location-based services with a payment broker
PET'07 Proceedings of the 7th international conference on Privacy enhancing technologies
Privacy-preserving trust verification
Proceedings of the 15th ACM symposium on Access control models and technologies
Efficiency-improved fully simulatable adaptive OT under the DDH assumption
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Fast secure computation of set intersection
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Oblivious transfer with timed-release receiver's privacy
Journal of Systems and Software
An asymmetric fingerprinting scheme based on tardos codes
IH'11 Proceedings of the 13th international conference on Information hiding
Simulatable adaptive oblivious transfer with statistical receiver's privacy
ProvSec'11 Proceedings of the 5th international conference on Provable security
Anonymous password-based authenticated key exchange
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Efficient oblivious transfers with access control
Computers & Mathematics with Applications
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
A novel k-out-of-n oblivious transfer protocol from bilinear pairing
Advances in Multimedia - Special issue on Web Services in Multimedia Communication
Hi-index | 0.00 |
In this paper we propose efficient two-round k-out-of-n oblivious transfer schemes, in which R sends O(k) messages to S, and S sends O(n) messages back to R. The computation cost of R and S is reasonable. The choices of R are unconditionally secure. For the basic scheme, the secrecy of unchosen messages is guaranteed if the Decisional Diffie-Hellman problem is hard. When k=1, our basic scheme is as efficient as the most efficient 1-out-of-n oblivious transfer scheme. Our schemes have the nice property of universal parameters, that is each pair of R and S need neither hold any secret key nor perform any prior setup (initialization). The system parameters can be used by all senders and receivers without any trapdoor specification. Our k-out-of-n oblivious transfer schemes are the most efficient ones in terms of the communication cost, in both rounds and the number of messages. Moreover, one of our schemes can be extended in a straightforward way to an adaptivek-out-of-n oblivious transfer scheme, which allows the receiver R to choose the messages one by one adaptively. In our adaptive-query scheme, S sends O(n) messages to R in one round in the commitment phase. For each query of R, only O(1) messages are exchanged and O(1) operations are performed. In fact, the number k of queries need not be pre-fixed or known beforehand. This makes our scheme highly flexible.