{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:44:17Z","timestamp":1725493457115},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540007081"},{"type":"electronic","value":"9783540365327"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36532-x_7","type":"book-chapter","created":{"date-parts":[[2007,10,25]],"date-time":"2007-10-25T15:34:36Z","timestamp":1193326476000},"page":"96-111","source":"Crossref","is-referenced-by-count":3,"title":["Negotiated Privacy"],"prefix":"10.1007","author":[{"given":"Stanislaw","family":"Jarecki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Lincoln","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vitaly","family":"Shmatikov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,25]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"M. Abadi and J. Feigenbaum. A simple protocol for secure circuit evaluation. In Proc. STACS\u2019 88, pages 264\u2013272, 1988.","DOI":"10.1007\/BFb0035850"},{"issue":"2","key":"7_CR2","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s00145-001-0014-7","volume":"15","author":"M. Abadi","year":"2002","unstructured":"M. Abadi and P. Rogaway. Reconciling two views of cryptography (the computational soundness of formal encryption).J. Cryptology, 15(2):103\u2013127, 2002.","journal-title":"J. Cryptology"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"M. Bellare, A. Boldyreva, A. Desai, and D. Pointcheval. Key-privacy in public-key encryption. In Proc. ASIACRYPT\u2019 01, pages 566\u2013582, 2001.","DOI":"10.1007\/3-540-45682-1_33"},{"key":"7_CR4","unstructured":"D. Boneh and R. Ostrovsky. Search on encrypted data, 2002."},{"key":"7_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/BFb0054851","volume-title":"The decisional Difie-Hellman problem","author":"D. Boneh","year":"1998","unstructured":"D. Boneh. The decisional Difie-Hellman problem. In Proc. 3rd Algorithmic Number Theory Symposium, volume 1423 of LNCS, pages 48\u201363. Springer-Verlag, 1998."},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In Proc. ACM Conference on Computer and Communications Security, pages 62\u201373, 1993.","DOI":"10.1145\/168588.168596"},{"key":"7_CR7","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5931.001.0001","volume-title":"Rethinking Public Key Infrastructure and Digital Certificates-Building in Privacy","author":"S. Brands","year":"2000","unstructured":"S. Brands. Rethinking Public Key Infrastructure and Digital Certificates-Building in Privacy. MIT Press, Cambridge, MA, 2000."},{"key":"7_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/3-540-39118-5","volume-title":"Untraceable electronic cash","author":"D. Chaum","year":"1988","unstructured":"D. Chaum, A. Fiat, and M. Naor. Untraceable electronic cash. In Proc. CRYPTO\u2019 88, volume 403 of LNCS, pages 319\u2013327. Springer-Verlag, 1988."},{"issue":"6","key":"7_CR9","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/293347.293350","volume":"45","author":"B. Chor","year":"1998","unstructured":"B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private information retrieval. J. ACM, 45(6):965\u2013981, 1998.","journal-title":"J. ACM"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"D. Chaum. Blind signatures for untracable payments. In Proc. CRYPTO\u2019 82, pages 199\u2013203, 1982.","DOI":"10.1007\/978-1-4757-0602-4_18"},{"key":"7_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/3-540-44987-6_7","volume-title":"An efficient system for nontransferable anonymous credentials with optional anonymity revocation","author":"J. Camenisch","year":"2001","unstructured":"J. Camenisch and A. Lysyanskaya. An efficient system for nontransferable anonymous credentials with optional anonymity revocation. In Proc. EUROCRYPT\u2019 01, volume 2045 of LNCS, pages 93\u2013118. Springer-Verlag, 2001."},{"key":"7_CR12","series-title":"Lect Notes Comput Sci","first-page":"89","volume-title":"Wallet databases with observers","author":"D. Chaum","year":"1992","unstructured":"D. Chaum and T. Pedersen. Wallet databases with observers. In Proc. CRYPTO\u2019 92, volume 740 of LNCS, pages 89\u2013105. Springer-Verlag, 1992."},{"key":"7_CR13","series-title":"Lect Notes Comput Sci","first-page":"307","volume-title":"Threshold cryptosystems","author":"Y. Desmedt","year":"1989","unstructured":"Y. Desmedt and Y. Frankel. Threshold cryptosystems. In Proc. CRYPTO\u2019 89, volume 435 of LNCS, pages 307\u2013315. Springer-Verlag, 1989."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"A. Evfimievski, R. Srikant, R. Agrawal, and J. Gehrke. Privacy preserving mining of association rules. In Proc. 8th ACM SIGKDD Int\u2019l Conference on Knowledge Discovery in Databases and Data Mining, 2002.","DOI":"10.1145\/775047.775080"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"P. Feldman. A practical scheme for non-interactive verifiable secret sharing. In Proc. 28th IEEE Symposium on Foundations of Comp. Science, pages 427\u2013438, 1987.","DOI":"10.1109\/SFCS.1987.4"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin. Protecting data privacy in private inforomation retrieval schemes. In Proc. 31th Annual ACM Symposium on Theory of Computing, pages 151\u2013160, 1998.","DOI":"10.1145\/276698.276723"},{"key":"7_CR17","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 and honest majority. In Proc. 19th Annual ACM Symposium on Theory of Computing, pages 218\u2013229, 1987.","DOI":"10.1145\/28395.28420"},{"issue":"2","key":"7_CR18","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/293411.293443","volume":"42","author":"D. Goldschlag","year":"1999","unstructured":"D. Goldschlag, M. Reed, and P. Syverson. Onion routing for anonymous and private Internet connections. Communications of the ACM, 42(2):39\u201341, 1999.","journal-title":"Communications of the ACM"},{"key":"7_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1007\/3-540-44750-4_17","volume-title":"Fair cryptosystems, revisited","author":"J. Kilian","year":"1995","unstructured":"J. Kilian and F.T. Leighton. Fair cryptosystems, revisited. In Proc. EUROCRYPT\u2019 95, volume 963 of LNCS, pages 208\u2013220. Springer-Verlag, 1995."},{"key":"7_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BFb0055727","volume-title":"Identity escrow","author":"J. Kilian","year":"1998","unstructured":"J. Kilian and E. Petrank. Identity escrow. In Proc. CRYPTO\u2019 98, volume 1462 of LNCS, pages 169\u2013185. Springer-Verlag, 1998."},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"A. Kiayias and M. Yung. Secure games with polynomial expressions. In ICALP\u2019 01, pages 939\u2013950, 2001.","DOI":"10.1007\/3-540-48224-5_76"},{"key":"7_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/3-540-44598-6_3","volume-title":"Privacy preserving data mining","author":"Y. Lindell","year":"2000","unstructured":"Y. Lindell and B. Pinkas. Privacy preserving data mining. In Proc. CRYPTO\u2019 00, volume 1880 of LNCS, pages 36\u201347. Springer-Verlag, 2000."},{"key":"7_CR23","series-title":"Lect Notes Comput Sci","first-page":"113","volume-title":"Fair public-key cryptosystems","author":"S. Micali","year":"1992","unstructured":"S. Micali. Fair public-key cryptosystems. In Proc. CRYPTO\u2019 92, volume 740 of LNCS, pages 113\u2013138. Springer-Verlag, 1992."},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"M. Naor and B. Pinkas. Oblivious transfer and polynomial evaluation. In Proc. 31th Annual ACM Symposium on Theory of Computing, pages 245\u2013254, 1998.","DOI":"10.1145\/301250.301312"},{"issue":"3","key":"7_CR25","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.P. Schnorr","year":"1991","unstructured":"C.P. Schnorr. Efficient signature generation by smart cards. J. Cryptology, 4(3):161\u2013174, 1991.","journal-title":"J. Cryptology"},{"issue":"11","key":"7_CR26","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir. How to share a secret. Communications of the ACM, 22(11):612\u2013613, 1979.","journal-title":"Communications of the ACM"},{"key":"7_CR27","unstructured":"D.X. Song, D. Wagner, and A. Perrig. Practical techniques for searches on encrypted data. In Proc. IEEE Symposium on Security and Privacy, pages 44\u201355, 2000."},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"A.C. Yao. Protocols for secure computations. In Proc. 23rd IEEE Symposium on Foundations of Comp. Science, pages 160\u2013164, 1982.","DOI":"10.1109\/SFCS.1982.38"},{"key":"7_CR29","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BFb0054114","volume-title":"Auto-recoverable and auto-certifiable cryptosystems","author":"A. Young","year":"1998","unstructured":"A. Young and M. Yung. Auto-recoverable and auto-certifiable cryptosystems. In Proc. EUROCRYPT\u2019 98, volume 1043 of LNCS pages 17\u201331. Springer-Verlag, 1998."}],"container-title":["Lecture Notes in Computer Science","Software Security \u2014 Theories and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36532-X_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T20:54:33Z","timestamp":1556916873000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36532-X_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540007081","9783540365327"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-36532-x_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}