A fair and efficient solution to the socialist millionaires' problem

Discrete Applied Mathematics

Volumn 111, Issue 1-2, 2001, Pages 23-36

  Boudot, Fabrice ^a   Schoenmakers, Berry ^b   Traoré, Jacques ^a  

^a ORANGE LABS   (France)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035879575     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00342-5     Document Type: Article

References (19)

1. M. Bellare, P. Rogaway, Random oracles are practical: a paradigm for designing efficient protocols, First ACM Conference on Computer and Communications Security, Fairfax, November 1993.
2. M. Bellare, S. Goldwasser, Verifiable partial key escrow, Fourth Annual Conference on Computer and Communications Security, 1997, Earlier version Technical Report CS95-447, Department of Computer Science and Engineering, University of California at San Diego, October 1995.
3. D. Boneh, The decision Diffie-Hellman problem, Third Algorithmic Number Theory Symposium, Lecture Notes in Computer Science, Vol. 1423, Springer, Berlin, 1998, pp. 48-63.
4. D. Chaum, T.P. Pedersen, Wallet databases with observers. Advances in Cryptology - CRYPTO '92, Lecture Notes in Computer Science, Vol. 740, Springer, Berlin, 1993, pp. 89-105.
5. R. Cramer, I. Damgård, B. Schoenmakers, Proofs of partial knowledge and simplified design of witness hiding protocols, Advances in Cryptology - CRYPTO '94, Lecture Notes in Computer Science, Vol. 839, Springer, Berlin, 1994, pp. 174-187.
6. ElGamal T. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inform. Theory. 31:1985;469-472.
7. A. Fiat, A. Shamir, How to prove yourself: Practical solutions to identification and signature problems, Advances in Cryptology - CRYPTO '86, Lecture Notes in Computer Science, Vol. 263, Springer, New York, 1987, pp. 186-194.
8. O. Goldreich, S. Micali, A. Wigderson, How to play any mental game - or - a completeness theorem for protocols with honest majority, Proceedings of 19th Symposium on Theory of Computing (STOC'87), ACM, New York, 1987, pp. 218-229.
9. Goldwasser S., Micali S. Probabilistic encryption. J. Comput. System Sci. 28(2):1984;270-299.
10. M. Jakobsson, M. Yung, Proving without knowing: On oblivious, agnostic and blindfolded provers, Advances in Cryptology - CRYPTO '96, Lecture Notes in Computer Science, Vol. 1109, Springer, Berlin, 1996, pp. 186-200.
11. T. Okamoto, Provably secure and practical identification schemes and corresponding signature schemes, Advances in Cryptology - CRYPTO '92, Lecture Notes in Computer Science, Vol. 740, Springer, Berlin, 1993, pp. 31-53.
12. D. Pointcheval, Les Preuves de Connaissance et leurs Preuves de Sécurité, Ph.D. Thesis, Université de Caen, France, 1996.
13. D. Pointcheval, J. Stern, Security proofs for signature schemes, Advances in Cryptology - EUROCRYPT '96, Lecture Notes in Computer Science, Vol. 1070, Springer, Berlin, 1996, pp. 387-398.
14. Salomaa A. Public-Key Cryptography. 1990;Springer, Berlin.
15. Schneier B. Applied Cryptography. 1996;Wiley, New York.
16. Schnorr C.P. Efficient signature generation by smart cards. J. Cryptol. 4(3):1991;161-174.
17. A. Yao, Protocols for secure computations, Proceedings of 23rd IEEE Symposium on Foundations of Computer Science (FOCS '82), IEEE Computer Society, Silverspring, MD, 1982, pp. 160-164.
18. A. Yao, How to generate and exchange secrets, Proceedings of 27th IEEE Symposium on Foundations of Computer Science (FOCS '86), IEEE Computer Society, Silverspring, MD, 1986, pp. 162-167.
19. G. Zémor, private communication, 1998.