{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T22:28:05Z","timestamp":1775255285722,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540887324","type":"print"},{"value":"9783540887331","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-88733-1_21","type":"book-chapter","created":{"date-parts":[[2008,10,17]],"date-time":"2008-10-17T02:08:02Z","timestamp":1224209282000},"page":"298-312","source":"Crossref","is-referenced-by-count":5,"title":["Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library"],"prefix":"10.1007","author":[{"given":"Peeter","family":"Laud","sequence":"first","affiliation":[]},{"given":"Long","family":"Ngo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/11787006_8","volume-title":"Automata, Languages and Programming","author":"P. Ad\u00e3o","year":"2006","unstructured":"Ad\u00e3o, P., Fournet, C.: Cryptographically sound implementations for communicating processes. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 83\u201394. Springer, Heidelberg (2006)"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-540-30108-0_6","volume-title":"Computer Security \u2013 ESORICS 2004","author":"M. Backes","year":"2004","unstructured":"Backes, M.: A Cryptographically Sound Dolev-Yao Style Security Proof of the Otway-Rees Protocol. In: Samarati, P., Ryan, P.Y.A., Gollmann, D., Molva, R. (eds.) ESORICS 2004. LNCS, vol.\u00a03193, pp. 89\u2013108. Springer, Heidelberg (2004)"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Backes, M., D\u00fcrmuth, M.: A cryptographically sound Dolev-Yao style security proof of an electronic payment system. In: CSFW 2005, pp. 78\u201393 (2005)","DOI":"10.1109\/CSFW.2005.5"},{"issue":"2","key":"21_CR4","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10207-007-0046-6","volume":"7","author":"M. Backes","year":"2008","unstructured":"Backes, M., D\u00fcrmuth, M., Hofheinz, D., K\u00fcsters, R.: Conditional reactive simulatability. Int. J. Inf. Sec.\u00a07(2), 155\u2013169 (2008)","journal-title":"Int. J. Inf. Sec."},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Backes, M., Laud, P.: Computationally sound secrecy proofs by mechanized flow analysis. In: ACM CCS 2006, pp. 370\u2013379 (2006)","DOI":"10.1145\/1180405.1180450"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24597-1_1","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"M. Backes","year":"2003","unstructured":"Backes, M., Pfitzmann, B.: A Cryptographically Sound Security Proof of the Needham-Schroeder-Lowe Public-Key Protocol. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 1\u201312. Springer, Heidelberg (2003)"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Backes, M., Pfitzmann, B.: Symmetric Encryption in a Simulatable Dolev-Yao Style Cryptographic Library. In: CSFW 2004, pp. 204\u2013218 (2004)","DOI":"10.1109\/CSFW.2004.1310742"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/11555827_11","volume-title":"Computer Security \u2013 ESORICS 2005","author":"M. Backes","year":"2005","unstructured":"Backes, M., Pfitzmann, B.: Limits of the cryptographic realization of Dolev-Yao-style XOR. In: de Capitani di Vimercati, S., Syverson, P.F., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol.\u00a03679, pp. 178\u2013196. Springer, Heidelberg (2005)"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Backes, M., Pfitzmann, B.: Relating Symbolic and Cryptographic Secrecy. In: IEEE S&P 2005, pp. 171\u2013182 (2005)","DOI":"10.1109\/SP.2005.17"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Backes, M., Pfitzmann, B.: On the cryptographic key secrecy of the strengthened Yahalom protocol. In: SEC 2006 (IFIP 201), pp. 233\u2013245 (2006)","DOI":"10.1007\/0-387-33406-8_20"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-540-39650-5_16","volume-title":"Computer Security \u2013 ESORICS 2003","author":"M. Backes","year":"2003","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: Symmetric authentication within a simulatable cryptographic library. In: Snekkenes, E., Gollmann, D. (eds.) ESORICS 2003. LNCS, vol.\u00a02808, pp. 271\u2013290. Springer, Heidelberg (2003)"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: A Universally Composable Cryptographic Library. In: ACM CCS 2003, pp. 220\u2013230 (2003)","DOI":"10.1145\/948109.948140"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1007\/978-3-540-24638-1_19","volume-title":"TCC 2004 (LNCS 2951)","author":"M. Backes","year":"2004","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: A General Composition Theorem for Secure Reactive Systems. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 336\u2013354. Springer, Heidelberg (2004)"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/11863908_25","volume-title":"Computer Security \u2013 ESORICS 2006","author":"M. Backes","year":"2006","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: Limits of the BRSIM\/UC soundness of Dolev-Yao models with hashes. In: Gollmann, D., Meier, J., Sabelfeld, A. (eds.) ESORICS 2006. LNCS, vol.\u00a04189, pp. 404\u2013423. Springer, Heidelberg (2006)"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Bellare, M., Desai, A., Jokipii, E., Rogaway, P.: A Concrete Security Treatment of Symmetric Encryption. In: FOCS 1997, pp. 394\u2013403 (1997)","DOI":"10.1109\/SFCS.1997.646128"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11761679_25","volume-title":"EUROCRYPT 2006 (LNCS 4004)","author":"M. Bellare","year":"2006","unstructured":"Bellare, M., Rogaway, P.: The security of triple encryption and a framework for code-based game-playing proofs. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 409\u2013426. Springer, Heidelberg (2006)"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Blanchet, B.: A computationally sound mechanized prover for security protocols. In: IEEE S&P 2006, pp. 140\u2013154 (2006)","DOI":"10.1109\/SP.2006.1"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Blanchet, B.: Computationally sound mechanized proofs of correspondence assertions. In: CSF 2007, pp. 97\u2013111 (2007)","DOI":"10.1109\/CSF.2007.16"},{"key":"21_CR19","unstructured":"Canetti, R.: A unified framework for analyzing security of protocols. In: ECCC, vol.\u00a08(16) (2001)"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols. In: FOCS 2001, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"21_CR21","series-title":"Lecture Notes in Computer Science","first-page":"424","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"I. Damg\u00e5rd","year":"2000","unstructured":"Damg\u00e5rd, I.: Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 424\u2013436. Springer, Heidelberg (2000)"},{"key":"21_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume-title":"Public Key Cryptography","author":"I. Damg\u00e5rd","year":"2001","unstructured":"Damg\u00e5rd, I., Jurik, M.: A generalisation, a simplification and some applications of Paillier\u2019s probabilistic public-key system. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 119\u2013136. Springer, Heidelberg (2001)"},{"issue":"12","key":"21_CR23","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"29","author":"D. Dolev","year":"1983","unstructured":"Dolev, D., Yao, A.C.: On the security of public key protocols. IEEE Transactions on Information Theory\u00a0IT-29(12), 198\u2013208 (1983)","journal-title":"IEEE Transactions on Information Theory"},{"key":"21_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-45682-1_21","volume-title":"ASIACRYPT 2001 (LNCS 2248)","author":"P.-A. Fouque","year":"2001","unstructured":"Fouque, P.-A., Pointcheval, D.: Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 351\u2013368. Springer, Heidelberg (2001)"},{"key":"21_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/3-540-45472-1_7","volume-title":"FC 2000 (LNCS 1962)","author":"P.-A. Fouque","year":"2001","unstructured":"Fouque, P.-A., Poupard, G., Stern, J.: Sharing decryption in the context of voting or lotteries. In: Frankel, Y. (ed.) FC 2000. LNCS, vol.\u00a01962, pp. 90\u2013104. Springer, Heidelberg (2001)"},{"key":"21_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography. Volume 1 - Basic Tools","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography. Volume 1 - Basic Tools. Cambridge University Press, Cambridge (2001)"},{"key":"21_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-540-24852-1_4","volume-title":"Applied Cryptography and Network Security","author":"J. Groth","year":"2004","unstructured":"Groth, J.: Evaluating security of voting schemes in the universal composability framework. In: Jakobsson, M., Yung, M., Zhou, J. (eds.) ACNS 2004. LNCS, vol.\u00a03089, pp. 46\u201360. Springer, Heidelberg (2004)"},{"key":"21_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/11761679_21","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"J. Groth","year":"2006","unstructured":"Groth, J., Ostrovsky, R., Sahai, A.: Perfect non-interactive zero knowledge for np. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 339\u2013358. Springer, Heidelberg (2006)"},{"key":"21_CR29","doi-asserted-by":"crossref","unstructured":"Laud, P.: Symmetric encryption in automatic analyses for confidentiality against active adversaries. In: IEEE S&P 2004, pp. 71\u201385 (2004)","DOI":"10.1109\/SECPRI.2004.1301316"},{"key":"21_CR30","doi-asserted-by":"crossref","unstructured":"Laud, P.: Secrecy Types for a Simulatable Cryptographic Library. In: ACM CCS 2005, pp. 26\u201335 (2005)","DOI":"10.1145\/1102120.1102126"},{"key":"21_CR31","doi-asserted-by":"crossref","unstructured":"Laud, P., Ngo, L.: Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library. Cryptology ePrint Archive, Report 2008\/367 (2008)","DOI":"10.1007\/978-3-540-88733-1_21"},{"key":"21_CR32","volume-title":"The Handbook of Information Security","author":"H. Lipmaa","year":"2006","unstructured":"Lipmaa, H.: Secure electronic voting protocols. In: The Handbook of Information Security. John Wiley & Sons, Chichester (2006)"},{"key":"21_CR33","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":"21_CR34","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B., Waidner, M.: A Model for Asynchronous Reactive Systems and its Application to Secure Message Transmission. In: IEEE S&P 2001, pp. 184\u2013200 (2001)","DOI":"10.1109\/SECPRI.2001.924298"},{"key":"21_CR35","doi-asserted-by":"crossref","unstructured":"Sprenger, C., Backes, M., Basin, D.A., Pfitzmann, B., Waidner, M.: Cryptographically sound theorem proving. In: CSFW 2006, pp. 153\u2013166 (2006)","DOI":"10.1109\/CSFW.2006.10"},{"key":"21_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-78663-4_20","volume-title":"Trustworthy Global Computing","author":"I. T\u0161ahhirov","year":"2008","unstructured":"T\u0161ahhirov, I., Laud, P.: Application of dependency graphs to security protocol analysis. In: Barthe, G., Fournet, C. (eds.) TGC 2007. LNCS, vol.\u00a04912, pp. 294\u2013311. Springer, Heidelberg (2008)"},{"key":"21_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/978-3-540-30598-9_19","volume-title":"SCN 2004 (LNCS 3352)","author":"D. Wikstr\u00f6m","year":"2005","unstructured":"Wikstr\u00f6m, D.: Universally composable DKG with linear number of exponentiations. In: Blundo, C., Cimato, S. (eds.) SCN 2004. LNCS, vol.\u00a03352, pp. 263\u2013277. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Provable Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88733-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T22:53:37Z","timestamp":1738450417000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88733-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540887324","9783540887331"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88733-1_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}