Two-party private vector dominance: The all-or-nothing deal

Proceedings - Third International Conference onInformation Technology: New Generations, ITNG 2006

Volumn 2006, Issue , 2006, Pages 166-171

  Ibrahim, Maged Hamada ^a  

^a HELWAN UNIVERSITY   (Egypt)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER APPLICATIONS; ELECTRONIC COMMERCE; INFORMATION TECHNOLOGY; KNOWLEDGE ENGINEERING; PROBLEM SOLVING;

INFORMATION REVEALING; SECRET VECTORS; SECURITY PROOF;

SECURITY OF DATA;

EID: 33750804685     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITNG.2006.136     Document Type: Conference Paper

References (31)

1. M. Rabin,"How to exchange secrets by oblivious transfer," TR-81, Harvard Aiken Computation Laboratory, 1981.
2. Y. Gertner, Y. Ishai, E. Kushilevitz, T. Malkin, "Protecting data privacy in information retrieval schemes," In Proc. of 30th Stoc., 1998.
3. J. Stern, "A new and efficient all-or-nothing disclosure of secrets protocol," In ASIACRYPT'98, 1998.
4. E. Kushilevitz, R. Ostrovsky, "Single-database computationally private information retrieval," In Proc. of 38th FOCS., 1997, pp. 364-373.
5. C. Cachin, S. Micali, M. Stadler, "Computationally private information retrieval with polylogarithmic communication," In EUROCRYPT'99, 1999.
6. M. Ben-Or, S. Goldwasser, A. Wigderson, "Completeness theorems for non-cryptographic fault-tolerant distributed computation," In Proc. of the 20th ACM symp. on the theory of computing, 1988, pp. 1-10.
7. B. Chor, O. Goldreich, E. Kushilevitz, M. Susdan, "Private information retrieval,"Journal of ACM 45(6), 1998,pp. 965-982.
8. M. Noar and B. Pinkas, "Oblivious transfer and polynomial evaluation," In Proc. of stat. Stoc., 1999, pp. 245-254.
9. M. Naor and B. Pinkas, "Efficient Oblivious Transfer Protocols," Proc.of SODA, Jan, 2001, pp. 7-9.
10. A. C. Yao, "Protocols for Secure Computations," 23rd Symp. on FOCS, IEEE, 1982, pp. 160-164.
11. O. Goldreich, S. Micali, A. Wigderson, "How to play any mental game," 19th STOC, ACM, 1987, pp. 218-229
12. M. Ben-Or, S. Goldwasser, and A. Wigderson, "Completeness theorems for non-cryptographic fault-tolerant distributed computation," In Proc. of STOC'88, 1988.
13. A. Shamir, "How to share a secret," Comm. ACM, 22(11), 1979, pp. 612-613,
14. T. Rabin and M. Ben-Or, "Verifiable secret sharing and multiparty protocols with honest majority," In ACM Symp. on Principles of Distributed Computing, August, 1989, pp. 73-85.
15. M. Abadi and J. Feigenbaum, "Secure circuit evaluation," a protocol based on hiding information from an oracle. Journal of Cryptology 2, 1990, pp. 1-12.
16. D. Chaum, C. Crepeau, I. Damgard, "Multiparty unconditionally secure protocols," In Proc. of STOC, 1988, pp. 11-19.
17. Joe Kilian, "More general completeness theorems for secure two-party computation," Proc. of 32nd ACM symp. on Theory of computing, May 21-23, 2000, pp. 316-324.
18. C. Cachin, "Efficient private bidding and auctions with an oblivious third party," In 6th ACM Conference on Computer and Communications Security (CCS), 1999, pp. 120-127.
19. O. Baudron and J. Stern, "Non-interactive Private Auctions," In Financial Cryptography - Fifth Int. Conference, Lecture Notes in Computer Science, BWI, February 2001.
20. Z. Galil, S. Haber, M. Yung, "Secure Fault Tolerant Protocols and the Public Key Model," Crypto'87, Springer-Verlag, 1987.
21. O. Goldreich and R. Vainish, "How to solve any protocol problem: an efficient improvement," Proc. of Crypto '87, LNCS Vol. 293, 1988, pp. 73-86.
22. A. Yao, "How to generate and exchange secrets," Proc. of the 27th FOCS, 1986, pp. 162-186.
23. T. Sander, A. Young, M. Yung,"Non-Interactive Crypto-Computing for NC,"Proc. of the 40th IEEE on FOCS, 1999.
24. I. Ioannidis and A. Grama, "An Efficient Protocol for Yao's Millionaires' Problem," found on the web.
25. D. Naccache and J. Stern, "A new public key cryptosystem based on higher residues," In 5th ACM Symp. on Computer and Communications Security, 1998.
26. N. Gilboa, "Two Party RSA Key Generation," Proc of Crypto'99, Lecture Notes in Computer Science, Vol. 1666, Springer-Verlag, 1999, pp. 116-129.
27. T. Straub, "Efficient Two Party Multi-Prime RSA Key Generation," In Proc. IASTED, New York, 2003.
28. Maged H. Ibrahim, I. I. Ibrahim, A. H. El-Sawy, "Fast Three-Party Shared Generation of RSA Keys Without Distributed Primality Tests," in Proc. of ISNG'04, Las Vegas, USA, 2004, pp. 5-10.
29. T. Okamoto and S. Uchiyama, "A New Public-Key Cryptosystem as secure as Factoring," Proc. of Eurocrypt'98, SpringerVerlag, 1998, pp. 308-318.
30. P. Paillier, "Public-key Cryptosystems Based on Discrete Logarithms Residues," In Eurocrypt'99, LNCS, 1999.
31. M. J. Atallah, and W. Du, "A Multi-Dimensional Yao's Millionaire Protocol," found on the web.