{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:09:10Z","timestamp":1774368550234,"version":"3.50.1"},"reference-count":19,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4399,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1016\/s0166-218x(00)00342-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:27:39Z","timestamp":1027614459000},"page":"23-36","source":"Crossref","is-referenced-by-count":134,"title":["A fair and efficient solution to the socialist millionaires\u2019 problem"],"prefix":"10.1016","volume":"111","author":[{"given":"Fabrice","family":"Boudot","sequence":"first","affiliation":[]},{"given":"Berry","family":"Schoenmakers","sequence":"additional","affiliation":[]},{"given":"Jacques","family":"Traor\u00e9","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00342-5_BIB1","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/168588.168596"},{"key":"10.1016\/S0166-218X(00)00342-5_BIB2","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/266420.266439"},{"key":"10.1016\/S0166-218X(00)00342-5_BIB3","doi-asserted-by":"crossref","unstructured":"D. Boneh, The decision Diffie\u2013Hellman problem, Third Algorithmic Number Theory Symposium, Lecture Notes in Computer Science, Vol. 1423, Springer, Berlin, 1998, pp. 48\u201363.","DOI":"10.1007\/BFb0054851"},{"key":"10.1016\/S0166-218X(00)00342-5_BIB4","doi-asserted-by":"crossref","unstructured":"D. Chaum, T.P. Pedersen, Wallet databases with observers. Advances in Cryptology \u2013 CRYPTO \u201992, Lecture Notes in Computer Science, Vol. 740, Springer, Berlin, 1993, pp. 89\u2013105.","DOI":"10.1007\/3-540-48071-4_7"},{"key":"10.1016\/S0166-218X(00)00342-5_BIB5","doi-asserted-by":"crossref","unstructured":"R. Cramer, I. Damg\u00e5rd, B. Schoenmakers, Proofs of partial knowledge and simplified design of witness hiding protocols, Advances in Cryptology \u2013 CRYPTO \u201994, Lecture Notes in Computer Science, Vol. 839, Springer, Berlin, 1994, pp. 174\u2013187.","DOI":"10.1007\/3-540-48658-5_19"},{"key":"10.1016\/S0166-218X(00)00342-5_BIB6","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","article-title":"A public key cryptosystem and a signature scheme based on discrete logarithms","volume":"31","author":"ElGamal","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(00)00342-5_BIB7","doi-asserted-by":"crossref","unstructured":"A. Fiat, A. Shamir, How to prove yourself: Practical solutions to identification and signature problems, Advances in Cryptology \u2013 CRYPTO \u201986, Lecture Notes in Computer Science, Vol. 263, Springer, New York, 1987, pp. 186\u2013194.","DOI":"10.1007\/3-540-47721-7_12"},{"key":"10.1016\/S0166-218X(00)00342-5_BIB8","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, A. Wigderson, How to play any mental game \u2013 or \u2013 a completeness theorem for protocols with honest majority, Proceedings of 19th Symposium on Theory of Computing (STOC\u201987), ACM, New York, 1987, pp. 218\u2013229.","DOI":"10.1145\/28395.28420"},{"issue":"2","key":"10.1016\/S0166-218X(00)00342-5_BIB9","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","article-title":"Probabilistic encryption","volume":"28","author":"Goldwasser","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0166-218X(00)00342-5_BIB10","unstructured":"M. Jakobsson, M. Yung, Proving without knowing: On oblivious, agnostic and blindfolded provers, Advances in Cryptology \u2013 CRYPTO \u201996, Lecture Notes in Computer Science, Vol. 1109, Springer, Berlin, 1996, pp. 186\u2013200."},{"key":"10.1016\/S0166-218X(00)00342-5_BIB11","doi-asserted-by":"crossref","unstructured":"T. Okamoto, Provably secure and practical identification schemes and corresponding signature schemes, Advances in Cryptology \u2013 CRYPTO \u201992, Lecture Notes in Computer Science, Vol. 740, Springer, Berlin, 1993, pp. 31\u201353.","DOI":"10.1007\/3-540-48071-4_3"},{"key":"10.1016\/S0166-218X(00)00342-5_BIB12","unstructured":"D. Pointcheval, Les Preuves de Connaissance et leurs Preuves de S\u00e9curit\u00e9, Ph.D. Thesis, Universit\u00e9 de Caen, France, 1996."},{"key":"10.1016\/S0166-218X(00)00342-5_BIB13","doi-asserted-by":"crossref","unstructured":"D. Pointcheval, J. Stern, Security proofs for signature schemes, Advances in Cryptology \u2013 EUROCRYPT \u201996, Lecture Notes in Computer Science, Vol. 1070, Springer, Berlin, 1996, pp. 387\u2013398.","DOI":"10.1007\/3-540-68339-9_33"},{"key":"10.1016\/S0166-218X(00)00342-5_BIB14","series-title":"Public-Key Cryptography","author":"Salomaa","year":"1990"},{"key":"10.1016\/S0166-218X(00)00342-5_BIB15","series-title":"Applied Cryptography","author":"Schneier","year":"1996"},{"issue":"3","key":"10.1016\/S0166-218X(00)00342-5_BIB16","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF00196725","article-title":"Efficient signature generation by smart cards","volume":"4","author":"Schnorr","year":"1991","journal-title":"J. Cryptol."},{"key":"10.1016\/S0166-218X(00)00342-5_BIB17","doi-asserted-by":"crossref","unstructured":"A. Yao, Protocols for secure computations, Proceedings of 23rd IEEE Symposium on Foundations of Computer Science (FOCS \u201982), IEEE Computer Society, Silverspring, MD, 1982, pp. 160\u2013164.","DOI":"10.1109\/SFCS.1982.38"},{"key":"10.1016\/S0166-218X(00)00342-5_BIB18","doi-asserted-by":"crossref","unstructured":"A. Yao, How to generate and exchange secrets, Proceedings of 27th IEEE Symposium on Foundations of Computer Science (FOCS \u201986), IEEE Computer Society, Silverspring, MD, 1986, pp. 162\u2013167.","DOI":"10.1109\/SFCS.1986.25"},{"key":"10.1016\/S0166-218X(00)00342-5_BIB19","unstructured":"G. Z\u00e9mor, private communication, 1998."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003425?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003425?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T12:31:39Z","timestamp":1578745899000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00003425"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S0166218X00003425"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00342-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}