{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T13:36:27Z","timestamp":1762954587135},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540333548"},{"type":"electronic","value":"9783540333555"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11734727_5","type":"book-chapter","created":{"date-parts":[[2006,7,10]],"date-time":"2006-07-10T11:57:27Z","timestamp":1152532647000},"page":"32-47","source":"Crossref","is-referenced-by-count":37,"title":["Efficient Cryptographic Protocol Design Based on Distributed El Gamal Encryption"],"prefix":"10.1007","author":[{"given":"Felix","family":"Brandt","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-45708-9_27","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J. Algesheimer","year":"2002","unstructured":"Algesheimer, J., Camenisch, J., Shoup, V.: Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 417\u2013432. Springer, Heidelberg (2002)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-540-24676-3_3","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"G. Aggarwal","year":"2004","unstructured":"Aggarwal, G., Mishra, N., Pinkas, B.: Secure computation of the kth-ranked element. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 40\u201355. Springer, Heidelberg (2004)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/BFb0052253","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"D. Boneh","year":"1997","unstructured":"Boneh, D., Franklin, M.: Efficient generation of shared RSA keys. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 425\u2013439. Springer, Heidelberg (1997)"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/3-540-38424-3_5","volume-title":"Advances in Cryptology - CRYPTO \u201990","author":"D. Beaver","year":"1991","unstructured":"Beaver, D., Feigenbaum, J., Kilian, J., Rogaway, P.: Security with low communication overhead. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol.\u00a0537, pp. 62\u201376. Springer, Heidelberg (1991)"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-30576-7_18","volume-title":"Theory of Cryptography","author":"D. Boneh","year":"2005","unstructured":"Boneh, D., Goh, E., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 325\u2013341. Springer, Heidelberg (2005)"},{"key":"5_CR6","first-page":"503","volume-title":"Proc. of 22nd STOC","author":"D. Beaver","year":"1990","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: Proc. of 22nd STOC, pp. 503\u2013513. ACM Press, New York (1990)"},{"issue":"1-2","key":"5_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0166-218X(00)00342-5","volume":"111","author":"F. Boudot","year":"2001","unstructured":"Boudot, F., Schoenmakers, B., Traor\u00e9, J.: A fair and efficient solution to the socialist millionaires\u2019 problem. Discrete Applied Mathematics\u00a0111(1-2), 23\u201336 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-44598-6_6","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"C. Cachin","year":"2000","unstructured":"Cachin, C., Camenisch, J.: Optimistic fair secure computation. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 93\u2013111. Springer, Heidelberg (2000)"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-44987-6_18","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"R. Cramer","year":"2001","unstructured":"Cramer, R., Damg\u00e5rd, I., Nielsen, J.B.: Multiparty computation from threshold homomorphic encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 280\u2013300. Springer, Heidelberg (2001)"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"R. Cramer","year":"1994","unstructured":"Cramer, R., Damg\u00e5rd, I., Schoenmakers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 174\u2013187. Springer, Heidelberg (1994)"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/3-540-69053-0_9","volume-title":"Advances in Cryptology - EUROCRYPT 1997","author":"R. Cramer","year":"1997","unstructured":"Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally efficient multi-authority election scheme. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 103\u2013118. Springer, Heidelberg (1997)"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","first-page":"3","volume-title":"Advances in Cryptology - CRYPTO 1992","author":"D. Chaum","year":"1993","unstructured":"Chaum, D., Pedersen, T.P.: Wallet databases with observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 3.1\u20133.6. Springer, Heidelberg (1993)"},{"key":"5_CR13","unstructured":"Damg\u00e5rd, I.: On \u03a3-protocols. Lecture Notes, University of Aarhus, Department for Computer Science (2002)"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/3-540-44647-8_33","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"A. De Santis","year":"2001","unstructured":"De Santis, A., Di Crescenzo, G., Ostrovsky, R., Persiano, G., Sahai, A.: Robust non-interactive zero knowledge. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 566\u2013598. Springer, Heidelberg (2001)"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/3-540-44987-6_10","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"I. Damg\u00e5rd","year":"2001","unstructured":"Damg\u00e5rd, I., Koprowski, M.: Practical threshold RSA signatures without a trusted dealer. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 152\u2013165. Springer, Heidelberg (2001)"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. El Gamal","year":"1985","unstructured":"El Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory\u00a031, 469\u2013472 (1985)","journal-title":"IEEE Transactions on Information Theory"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/3-540-45353-9_33","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"M. Fischlin","year":"2001","unstructured":"Fischlin, M.: A cost-effective pay-per-multiplication comparison method for millionaires. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 457\u2013472. Springer, Heidelberg (2001)"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"A. Fiat","year":"1988","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 186\u2013194. Springer, Heidelberg (1988)"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/3-540-48405-1_8","volume-title":"Advances in Cryptology - CRYPTO 1999","author":"N. Gilboa","year":"1999","unstructured":"Gilboa, N.: Two party RSA key generation. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 116\u2013129. Springer, Heidelberg (1999)"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/3-540-48910-X_21","volume-title":"Advances in Cryptology - EUROCRYPT 1999","author":"R. Gennaro","year":"1999","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete-log based cryptosystems. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 295\u2013310. Springer, Heidelberg (1999)"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/3-540-36563-X_26","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"R. Gennaro","year":"2003","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Applications of Pedersen\u2019s distributed key generation protocol. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 373\u2013390. Springer, Heidelberg (2003)"},{"key":"5_CR22","first-page":"218","volume-title":"Proc. of 19th STOC","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Proc. of 19th STOC, pp. 218\u2013229. ACM Press, New York (1987)"},{"key":"5_CR23","unstructured":"Garay, J., MacKenzie, P., Yang, K.: Efficient and secure multi-party computation with faulty majority and complete fairness (to appear, 2004)"},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-36288-6_11","volume-title":"Public Key Cryptography - PKC 2003","author":"J. Groth","year":"2002","unstructured":"Groth, J.: A verifiable secret shuffle of homomorphic encryptions. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 145\u2013160. Springer, Heidelberg (2002)"},{"key":"5_CR25","first-page":"205","volume-title":"Proc. of 36th Hawaii International Conference on System Sciences (HICSS)","author":"I. Ioannidis","year":"2003","unstructured":"Ioannidis, I., Grama, A.: An efficient protocol for Yao\u2019s millionaires\u2019 problem. In: Proc. of 36th Hawaii International Conference on System Sciences (HICSS), pp. 205\u2013210. IEEE Press, Los Alamitos (2003)"},{"key":"5_CR26","first-page":"294","volume-title":"Proc. of 41st FOCS Symposium","author":"Y. Ishai","year":"2000","unstructured":"Ishai, Y., Kushilevitz, E.: Randomizing polynomials: A new representation with applications to round-efficient secure computation. In: Proc. of 41st FOCS Symposium, pp. 294\u2013304. IEEE Press, Los Alamitos (2000)"},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-44448-3_13","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"M. Jakobsson","year":"2000","unstructured":"Jakobsson, M., Juels, A.: Mix and match: Secure function evaluation via ciphertexts. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 162\u2013177. Springer, Heidelberg (2000)"},{"key":"5_CR28","first-page":"20","volume-title":"Proc. of 20th ACM STOC","author":"J. Kilian","year":"1988","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: Proc. of 20th ACM STOC, pp. 20\u201331. ACM Press, New York (1988)"},{"key":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/3-540-45853-0_2","volume-title":"Computer Security - ESORICS 2002","author":"K. Kurosawa","year":"2002","unstructured":"Kurosawa, K., Ogata, W.: Bit-slice auction circuit. In: Gollmann, D., Karjoth, G., Waidner, M. (eds.) ESORICS 2002. LNCS, vol.\u00a02502, pp. 24\u201338. Springer, Heidelberg (2002)"},{"key":"5_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/3-540-44647-8_10","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"Y. Lindell","year":"2001","unstructured":"Lindell, Y.: Parallel coin-tossing and constant-round secure two-party computation. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 171\u2013189. Springer, Heidelberg (2001)"},{"key":"5_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/11496137_31","volume-title":"Applied Cryptography and Network Security","author":"H.-Y. Lin","year":"2005","unstructured":"Lin, H.-Y., Tzeng, W.-G.: An efficient solution to the Millionaires\u2019 Problem based on homomorphic encryption. In: Ioannidis, J., Keromytis, A.D., Yung, M. (eds.) ACNS 2005. LNCS, vol.\u00a03531, pp. 456\u2013466. Springer, Heidelberg (2005)"},{"key":"5_CR32","first-page":"590","volume-title":"Proc. of 33rd STOC","author":"M. Naor","year":"2001","unstructured":"Naor, M., Nissim, K.: Communication preserving protocols for secure function evaluation. In: Proc. of 33rd STOC, pp. 590\u2013599. ACM Press, New York (2001)"},{"key":"5_CR33","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1145\/336992.337028","volume-title":"Proc. of 1st ACM Conference on E-Commerce","author":"M. Naor","year":"1999","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: Proc. of 1st ACM Conference on E-Commerce, pp. 129\u2013139. ACM Press, New York (1999)"},{"key":"5_CR34","series-title":"Lecture Notes in Computer Science","first-page":"223","volume-title":"Advances in Cryptology - EUROCRYPT 1999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"5_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/11496618_6","volume-title":"Information Security and Cryptology \u2013 ICISC 2004","author":"K. Peng","year":"2005","unstructured":"Peng, K., Boyd, C., Dawson, E., Lee, B.: An efficient and verifiable solution to the millionaire problem. In: Park, C.-s., Chee, S. (eds.) ICISC 2004. LNCS, vol.\u00a03506, pp. 51\u201366. Springer, Heidelberg (2005)"},{"key":"5_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology - CRYPTO 1991","author":"T. Pedersen","year":"1992","unstructured":"Pedersen, T.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 129\u2013140. Springer, Heidelberg (1992)"},{"issue":"3","key":"5_CR37","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.P. Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Efficient signature generation by smart cards. Journal of Cryptology\u00a04(3), 161\u2013174 (1991)","journal-title":"Journal of Cryptology"},{"key":"5_CR38","volume-title":"Applied Cryptography","author":"B. Schneier","year":"1996","unstructured":"Schneier, B.: Applied Cryptography, 2nd edn. John Wiley, Chichester (1996)","edition":"2"},{"key":"5_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-540-30539-2_10","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"B. Schoenmakers","year":"2004","unstructured":"Schoenmakers, B., Tuyls, P.: Practical two-party computation based on the conditional gate. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 119\u2013136. Springer, Heidelberg (2004)"},{"key":"5_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BFb0054019","volume-title":"Public Key Cryptography","author":"Y. Tsiounis","year":"1998","unstructured":"Tsiounis, Y., Yung, M.: On the security of ElGamal-based encryption. In: Imai, H., Zheng, Y. (eds.) PKC 1998. LNCS, vol.\u00a01431, pp. 117\u2013134. Springer, Heidelberg (1998)"},{"key":"5_CR41","first-page":"160","volume-title":"Proc. of 23th FOCS Symposium","author":"A.C. Yao","year":"1982","unstructured":"Yao, A.C.: Protocols for secure computation. In: Proc. of 23th FOCS Symposium, pp. 160\u2013164. IEEE Computer Society Press, Los Alamitos (1982)"},{"key":"5_CR42","first-page":"162","volume-title":"Proc. of 27th FOCS Symposium","author":"A.C. Yao","year":"1986","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: Proc. of 27th FOCS Symposium, pp. 162\u2013167. IEEE Computer Society Press, Los Alamitos (1986)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology - ICISC 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11734727_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T00:31:59Z","timestamp":1552350719000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11734727_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540333548","9783540333555"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/11734727_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}