Practical t-out-n oblivious transfer and its applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2836, Issue , 2003, Pages 226-237

  Wu, Qian Hong ^a   Zhang, Jian Hong ^a   Wang, Yu Min ^a  

^a XIDIAN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

COMPUTATIONAL POWER; DISCRETE LOGARITHM PROBLEMS; DISTRIBUTED OBLIVIOUS TRANSFERS; ITS APPLICATIONS; MODULAR EXPONENTIATIONS; OBLIVIOUS TRANSFER; PUBLIC VERIFIABILITY;

ARTIFICIAL INTELLIGENCE;

EID: 0142218971     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39927-8_21     Document Type: Article

References (22)

1. M. Abe, M. Ohkubo, and K. Suzuki. 1-out-of-n Signatures from a Variety of Keys. ASIACRYPT'02, 2002, pages 415-432, 2002.
2. G. Brassard, C. Crépeau. Oblivious Transfers and Privacy Amplification. EUROCRYPT'97, pages 334-346, 1997.
3. F. Bao, R. Deng, P. Feng. An Efficient and Practical Scheme for Privacy Protection in E-commerce of Digital Goods. ICICS'03, pages 162-170. 2000.
4. G. Brassard, C. Crépeau, J.-M. Robert. Information Theoretic Reduction among Disclosure Problems. 27th IEEE Symposium on Foundations of Computer Science, pages 168-173, 1986.
5. G. Brassard, C. Crepeau, M. Santha. Oblivious Transfer and Intersecting Codes. IEEE Trans. on Inf. Th., special issue in coding and complexity, Vol. 42, No. 6, pages 1769-1780, 1996.
6. M. Ben-Or, S. Goldwasser, A. Wigderson. Completeness Theorems for Non-cryptographic Fault-tolerant Distributed Computation. 20th ACM Symposium on the Theory of computing, pages 1-10, 1988.
7. R. Cramer, I. Damgard, and B. Schoenmakers. Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. CRYPTO'94, pages 174-187, 1994.
8. B. Chor, O. Goldreich, E. Kushilevitz, M. Susdan. Private Information Retrieval, Journal of the ACM 45(6), pages 965-982, 1998.
9. D. Chaum and T. Pedersen. Transferred Cash Grows in Size. EUROCRYPT'92, pages 390-407, 1993.
10. B. Chor, R. L. Rivest. A Knapsack Type Public-key Cryptosystem Based on Arithmetic in Finite Field. CRYPTO'84, pages 54-65, 1985.
11. S. Even, O. Goldreich, A. Lempel. A Randomized Protocol for Signing Contracts, Communications of the ACM 28, pages 637-647, 1985.
12. O. Goldreich, R. Vainish. How to Solve any Protocol Problem: An Efficient Improvement. CRYPTO'87, pages 73-86, 1988.
13. H. A. Hussain, J. W. A. Sada, and S. M. Kalipha. New Multistage Knapsack Public-key Cryptosystem. International Journal of Systems Science, Vol. 22, No. 11, pages 2313-2320, Nov. 1991.
14. J. C. Lagarias, and A. M. Odlyzko. Solving Low-density Subset Sum Problems. 24th IEEE Symposium on Foundations of Computer Science, pages 1-10, 1983.
15. R. C. Merkle, and M. Hellman. Hiding Information and Signatures in Trapdoor Knapsack. IEEE Transactions on Information Theory, Vol.24, No.5, pages 525-530, 1978.
16. M. Naor, B. Pinkas. Distributed Oblivious Transfer. ASIACRYPT'00, pages 205-219, 2000.
17. M. Rabin. How to Exchange Secrets by Oblivious Transfer. Technical Report TR-81, Aiken Computation Laboratory, Harvard University, 1981.
18. A. Shamir, and A. Fiat. On the Security of the Merkle-Hellman Cryptographic Scheme. IEEE Trans. On Information Theory, Vol.26, No.3, pages 339-340, May 1980.
19. J. P. Stern. A New and Efficient All-or-nothing Disclosure of Secrets Protocol. ASIACRYPT'98, pages 357-371, 1998.
20. A. Salomaa, L. Santean. Secret Selling of Secrets with Several Buyers. 42nd EATCS Bulletin, pages 178-186, 1990.
21. W. Tzeng. Efficient 1-out-of-n Oblivious Transfer Schemes. PKC'02, pages 159-171, 2002.
22. S. Vaudenay. Cryptanalysis of the Chor-Rivest Cryptosystem. CRYPTO'98, pages 243-256, 1998.