Protocol of comparing information without leaking

Ruan Jian Xue Bao/Journal of Software

Volumn 15, Issue 3, 2004, Pages 421-427

  Qin, Jing ^a,b   Zhang, Zhen Feng ^b   Feng, Deng Guo ^b   Li, Bao ^b  

^a SHANDONG UNIVERSITY   (China)

^b UNIVERSITY OF CHINESE ACADEMY OF SCIENCES   (China)

Author keywords

universal hash function; hiding assumption; Computationally indistinguishable; Homomorphic encryption; Public key cryptosystem; Secure multi party computation

Indexed keywords

COMPUTER NETWORKS; FORMAL LOGIC; NETWORK PROTOCOLS; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA; THEOREM PROVING;

COMPUTATIONALLY INDISTINGUISHABLE; DELTA UNIVERSAL HASH FUNCTION; HIDING ASSUMPTION; HOMOMORPHIC ENCRYPTION; PUBLIC KEY CRYPTOSYSTEM; SECURE MULTI COMPUTATION;

CRYPTOGRAPHY;

EID: 2942748384     PISSN: 10009825     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (12)

1. Goldreich O. Secure multi-party computation, manuscript version 1.3. 2002. http://theory.lcs.mit.edu/-oded
2. Cramer R. Introduction to secure computation. In: Damgaard I, ed. Lectures on Data Security-Modern Cryptology in Theory and Practice. Lecture Notes in Computer Science, Vol 1561. Springer-Verlag, 1999. 16-62.
3. Yao AC. Protocols for secure computation. In: Proc. of the 23rd IEEE Symp. on Foundation of Computer Science. Chicago: IEEE Computer Society, 1982. 160-164.
4. Cachin C. Efficient private bidding and auctions with an oblivious third party. In: ACM Conf. on Computer and Communications Security, ed. Proc. of the 6th ACM Conf. on Computer and Communications Security. Assn for Computing Machinery, 1999. 120-127.
5. Fagin R, Naor M, Winkler P. Comparing information without leaking it. Communications of the ACM, 1996, 39(5): 77-85.
6. Schneier B. Applied Cryptography: Protocols, Algorithms, and Source Code in C. 2nd ed., John Wiley and Sons, Inc., 1996.
7. Cachin C, Micali S, Stadler M. Computationally private information retrieval with polylogarithmic communication. In: Slern J, ed. Proc. of the Advances in Cryptology-Eurocrypt'99. Lecture Notes in Computer Science, Vol.1592, Springer-Verlag, 1999. 402-414.
8. Naccache D, Stern J. A new public-key cryptosystem based on higher residues. In: Association for Computing Machinery, ed. Proc. of the 5th ACM Conf. on Computer and Communications Security. San Francisco: ACM, 1998. 59-66.
9. Okamoto T, Uchiyama S. A new public key cryptosystem as secure as factoring. In: Nyberg K, ed. Proc. of the Advances in Cryptology-Eurocrypt'98. Lecture Notes in Computer Science, Vol 1403, Springer-Verlag, 1998. 308-318.
10. Paillier P. Public-Key cryptosystem based on composite degree residuosity classes. In: Proc. of the Advances in Cryptology-Euroctypt'99. Lecture Notes in Computer Science, Vol 1592, Springer-Verlag, 1999. 223-238.
11. Naor M, Yung M. Universal one-way hash functions and their cryptographic applications. In: Association for Computing Machinery, ed. Proc. of the 21st Annual ACM Symp. on Theory of Computing (STOC). Seattle: ACM, 1989. 33-43.
12. Bellare M. A note on negligible functions. Journal of Cryptology, 2002, 15(4): 271-284.