{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:39:28Z","timestamp":1725485968093},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540698609"},{"type":"electronic","value":"9783540698616"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-69861-6_14","type":"book-chapter","created":{"date-parts":[[2007,6,11]],"date-time":"2007-06-11T16:17:51Z","timestamp":1181578671000},"page":"197-211","source":"Crossref","is-referenced-by-count":1,"title":["Client-Server Trade-Offs in Secure Computation"],"prefix":"10.1007","author":[{"given":"Berry","family":"Schoenmakers","sequence":"first","affiliation":[]},{"given":"Pim","family":"Tuyls","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"14_CR1","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"IT-31","author":"T. ElGamal","year":"1985","unstructured":"T. ElGamal. A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, IT-31(4):469\u2013472, 1985.","journal-title":"IEEE Transactions on Information Theory"},{"key":"14_CR2","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume":"1592","author":"P. Paillier","year":"1999","unstructured":"P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Advances in Cryptology\u2014EUROCRYPT\u2019 99, volume 1592 of Lecture Notes in Computer Science, pages 223\u2013238, Berlin, 1999. Springer-Verlag.","journal-title":"Advances in Cryptology\u2014EUROCRYPT\u2019 99"},{"key":"14_CR3","first-page":"119","volume":"3329","author":"B. Schoenmakers","year":"2004","unstructured":"B. Schoenmakers and P. Tuyls. Practical two-party computation based on the conditional gate. In Advances in Cryptology\u2014ASIACRYPT\u2019 04, volume 3329 of Lecture Notes in Computer Science, pages 119\u2013136, Berlin, 2004. Springer-Verlag.","journal-title":"Advances in Cryptology\u2014ASIACRYPT\u2019 04"},{"key":"14_CR4","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume":"1992","author":"I. Damg\u00e5rd","year":"2001","unstructured":"I. Damg\u00e5rd and M. Jurik. A generalisation, a simplification and some applications of Paillier\u2019s probabilistic public-key system. In Public Key Cryptography-PKC\u2019 01, volume 1992 of Lecture Notes in Computer Science, pages 119\u2013136, Berlin, 2001. Springer-Verlag.","journal-title":"Public Key Cryptography-PKC\u2019 01"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/3-540-48405-1_8","volume":"1666","author":"N. Gilboa","year":"1999","unstructured":"N. Gilboa. Two party RSA key generation. In Advances in Cryptology\u2014CRYPTO\u2019 99, volume 1666 of Lecture Notes in Computer Science, pages 116\u2013129, Berlin, 1999. Springer-Verlag.","journal-title":"Advances in Cryptology\u2014CRYPTO\u2019 99"},{"key":"14_CR6","first-page":"417","volume":"2442","author":"J. Algesheimer","year":"2002","unstructured":"J. Algesheimer, J. Camenisch, and V. Shoup. Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. In Advances in Cryptology\u2014CRYPTO\u2019 02, volume 2442 of Lecture Notes in Computer Science, pages 417\u2013432, Berlin, 2002. Springer-Verlag.","journal-title":"Advances in Cryptology\u2014CRYPTO\u2019 02"},{"issue":"4","key":"14_CR7","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1145\/502090.502094","volume":"48","author":"D. Boneh","year":"2001","unstructured":"D. Boneh and M. Franklin. Efficient generation of shared RSA keys. Journal of the ACM, 48(4):702\u2013722, 2001.","journal-title":"Journal of the ACM"},{"key":"14_CR8","unstructured":"R. Rivest, L. Adleman, and M. Dertouzos. On data banks and privacy homomorphisms. In Foundations of Secure Computation, pages 169\u2013177. Academic Press, 1978."},{"issue":"2","key":"14_CR9","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28(2):270\u2013299, 1984.","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"14_CR10","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s001459900013","volume":"9","author":"M. Franklin","year":"1996","unstructured":"M. Franklin and S. Haber. Joint encryption and message-efficient secure computation. Journal of Cryptology, 9(4):217\u2013232, 1996.","journal-title":"Journal of Cryptology"},{"key":"14_CR11","first-page":"162","volume":"1976","author":"A. Juels","year":"2000","unstructured":"A. Juels and M. Jakobsson. Mix and match: Secure function evaluation via ciphertexts. In Advances in Cryptology\u2014ASIACRYPT\u2019 00, volume 1976 of Lecture Notes in Computer Science, pages 162\u2013177, Berlin, 2000. Springer-Verlag.","journal-title":"Advances in Cryptology\u2014ASIACRYPT\u2019 00"},{"key":"14_CR12","first-page":"280","volume":"2045","author":"R. Cramer","year":"2001","unstructured":"R. Cramer, I. Damg\u00e5rd, and J.B. Nielsen. Multiparty computation from threshold homomorphic encryption. In Advances in Cryptology\u2014EUROCRYPT\u2019 01, volume 2045 of Lecture Notes in Computer Science, pages 280\u2013300, Berlin, 2001. Springer-Verlag. Full version eprint.iacr.org\/2000\/055, October 27, 2000.","journal-title":"Advances in Cryptology\u2014EUROCRYPT\u2019 01"},{"key":"14_CR13","first-page":"247","volume":"2729","author":"I. Damg\u00e5rd","year":"2003","unstructured":"I. Damg\u00e5rd and J.B. Nielsen. Universally composable efficient multiparty computation from threshold homomorphic encryption. In Advances in Cryptology\u2014CRYPTO\u2019 03, volume 2729 of Lecture Notes in Computer Science, pages 247\u2013264, Berlin, 2003. Springer-Verlag.","journal-title":"Advances in Cryptology\u2014CRYPTO\u2019 03"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game-or-a completeness theorem for protocols with honest majority. In Proc. 19th Symposium on Theory of Computing (STOC\u2019 87), pages 218\u2013229, New York, 1987. A.C.M.","DOI":"10.1145\/28395.28420"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computation. In Proc. 20th Symposium on Theory of Computing (STOC\u2019 88), pages 1\u201310, New York, 1988. A.C.M.","DOI":"10.1145\/62212.62213"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, and I. Damg\u00e5rd. Multiparty unconditionally secure protocols. In Proc. 20th Symposium on Theory of Computing (STOC\u2019 88), pages 11\u201319, New York, 1988. A.C.M.","DOI":"10.1145\/62212.62214"},{"key":"14_CR17","first-page":"522","volume":"4004","author":"B. Schoenmakers","year":"2006","unstructured":"B. Schoenmakers and P. Tuyls. Efficient binary conversion for Paillier encryptions. In Advances in Cryptology\u2014EUROCRYPT\u2019 06, volume 4004 of Lecture Notes in Computer Science, pages 522\u2013537, Berlin, 2006. Springer-Verlag.","journal-title":"Advances in Cryptology\u2014EUROCRYPT\u2019 06"},{"key":"14_CR18","first-page":"103","volume":"1233","author":"R. Cramer","year":"1997","unstructured":"R. Cramer, R. Gennaro, and B. Schoenmakers. A secure and optimally efficient multi-authority election scheme. In Advances in Cryptology\u2014EUROCRYPT\u2019 97, volume 1233 of Lecture Notes in Computer Science, pages 103\u2013118, Berlin, 1997. Springer-Verlag.","journal-title":"Advances in Cryptology\u2014EUROCRYPT\u2019 97"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"J. Cohen and M. Fischer. A robust and verifiable cryptographically secure election scheme. In Proc. 26th IEEE Symposium on Foundations of Computer Science (FOCS\u2019 85), pages 372\u2013382. IEEE Computer Society, 1985.","DOI":"10.1109\/SFCS.1985.2"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"J. Benaloh and M. Yung. Distributing the power of a government to enhance the privacy of voters. In Proc. 5th ACM Symposium on Principles of Distributed Computing (PODC\u2019 86), pages 52\u201362, New York, 1986. A.C.M.","DOI":"10.1145\/10590.10595"},{"key":"14_CR21","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-47721-7_19","volume":"263","author":"J. Benaloh","year":"1987","unstructured":"J. Benaloh. Secret sharing homomorphisms: Keeping shares of a secret secret. In Advances in Cryptology\u2014CRYPTO\u2019 86, volume 263 of Lecture Notes in Computer Science, pages 251\u2013260, Berlin, 1987. Springer-Verlag.","journal-title":"Advances in Cryptology\u2014CRYPTO\u2019 86"},{"key":"14_CR22","volume-title":"Verifiable Secret-Ballot Elections","author":"J. Benaloh","year":"1987","unstructured":"J. Benaloh. Verifiable Secret-Ballot Elections. PhD thesis, Yale University, Department of Computer Science Department, New Haven, CT, September 1987."},{"key":"14_CR23","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-45664-3_9","volume":"2274","author":"I. Damg\u00e5rd","year":"2002","unstructured":"I. Damg\u00e5rd and M. Jurik. Client\/server tradeoffs for online elections. In Public Key Cryptography\u2014PKC\u2019 02, volume 2274 of Lecture Notes in Computer Science, pages 125\u2013140, Berlin, 2002. Springer-Verlag.","journal-title":"Public Key Cryptography\u2014PKC\u2019 02"},{"key":"14_CR24","first-page":"398","volume":"2894","author":"H. Lipmaa","year":"2003","unstructured":"H. Lipmaa. On diophantine complexity and statistical zero-knowledge arguments. In Advances in Cryptology\u2014ASIACRYPT\u2019 03, volume 2894 of Lecture Notes in Computer Science, pages 398\u2013415, Berlin, 2003. Springer-Verlag.","journal-title":"Advances in Cryptology\u2014ASIACRYPT\u2019 03"}],"container-title":["Security, Privacy, and Trust in Modern Data Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69861-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T22:17:18Z","timestamp":1558217838000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69861-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540698609","9783540698616"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69861-6_14","relation":{},"subject":[],"published":{"date-parts":[[2007]]}}}