{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:15:18Z","timestamp":1758269718566},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540006466"},{"type":"electronic","value":"9783540365044"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36504-4_9","type":"book-chapter","created":{"date-parts":[[2007,7,20]],"date-time":"2007-07-20T14:48:45Z","timestamp":1184942925000},"page":"120-135","source":"Crossref","is-referenced-by-count":38,"title":["Cryptographic Primitives Enforcing Communication and Storage Complexity"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Golle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stanislaw","family":"Jarecki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilya","family":"Mironov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"E. Adar and B. Huberman, \u201cFree Riding on Gnutella,\u201d First Monday, 5(10), 2000","DOI":"10.5210\/fm.v5i10.792"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"M. Bellare and O. Goldreich, \u201cOn defining proofs of knowledge,\u201d Proc. of CRYPTO\u201992, pp. 390\u2013420, 1992.","DOI":"10.1007\/3-540-48071-4_28"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"M. Bellare, J. Killian, and P. Rogaway, \u201cThe security of the cipher block chaining message authentication code,\u201d Proc. of CRYPTO\u201994, pp. 341\u2013358. http:\/\/www.cs.ucdavis.edu\/~rogaway , 1994.","DOI":"10.1007\/3-540-48658-5_32"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway, \u201cRandom oracles are practical: a paradigm for designing efficient protocols,\u201d Proc. of ACM CCS\u201993, pp. 62\u201373, 1993.","DOI":"10.1145\/168588.168596"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, \u201cProbabilistic algorithms in finite fields,\u201d Proc. of FOCS\u201981, pp. 394\u2013398, 1981.","DOI":"10.1109\/SFCS.1981.37"},{"key":"9_CR6","unstructured":"M. Blum, \u201cCoin nipping by telephone,\u201d Proc. of CRYPT0\u201981, pp. 11\u201315, 1981."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"D. Boneh and M. Franklin, \u201cIdentity based encryption from the Weil pairing,\u201d Proc. of CRYPTO\u201901, pp. 213\u2013229, 2001.","DOI":"10.1007\/3-540-44647-8_13"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"M. Burmester, Y. Desmedt, and J. Seberry, \u201cEquitable key escrow with limited time span (or, How to enforce time expiration cryptographically),\u201d Proc. of Asiacrypt\u201998, pp. 380\u2013391, 1998.","DOI":"10.1007\/3-540-49649-1_30"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"C. Cachin, J. Camenish, J. Kilian, and J. Muller, \u201cOne-round secure computation and secure autonomous mobile agents,\u201d Proc. of ICALP\u201900, pp. 512\u2013523, 2001.","DOI":"10.1007\/3-540-45022-X_43"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"R. Canetti, O. Goldreich, and S. Halevi, \u201cThe random oracle methodology revisited,\u201d Proc. of STOC\u201998, pp. 209\u2013218, 1998.","DOI":"10.1145\/276698.276741"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"D. Chaum and T. Pedersen, \u201cWallet databases with observers,\u201d Proc. of CRYPTO\u201992, pp. 89\u2013105, 1992.","DOI":"10.1007\/3-540-48071-4_7"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"C. Dwork, J. Lotspiech, and M. Naor, \u201cDigital signets: self-enforcing protection of digital content,\u201d Poc. of STOC\u201996, pp. 489\u2013498, 1996.","DOI":"10.1145\/237814.237997"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"A. Fiat and A. Shamir, \u201cHow to prove yourself: practical solutions to identification and signature problems,\u201d Proc. of CRYPTO\u201986, pp. 186\u2013194, 1987.","DOI":"10.1007\/3-540-47721-7_12"},{"key":"9_CR14","unstructured":"O. Goldreich, \u201cSecure multi-party computation,\u201d On-line manuscript, http:\/\/www.wisdom.weizmann.ac.il\/~oded , 1998."},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson, \u201cHow to play any mental game or A completeness theorem for protocols with honest majority,\u201d Proc. of STOC\u201987, pp. 218\u2013229, 1987. (See also [Gol98]).","DOI":"10.1145\/28395.28420"},{"issue":"2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali, and R. Rivest, \u201cA digital signature scheme secure against adaptive chosen-message attacks,\u201d SIAM J. on Computing, 17(2), pp. 281\u2013308, 1988.","journal-title":"SIAM J. on Computing"},{"key":"9_CR17","unstructured":"A. Joux and K. Nguyen, \u201cSeparating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups,\u201d Cryptology ePrint Archive, Report 2001\/003, available form http:\/\/eprint.iacr.org\/ , 2001."},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"E. Kaltofen and A. Lobo, \u201cOn rank properties of Toeplitz matrices over finite fields,\u201d Proc. of ISSAC\u201996, pp. 241\u2013249, 1996.","DOI":"10.1145\/236869.237081"},{"key":"9_CR19","unstructured":"D. Knuth, The Art of Computer Programming, v. 2, Seminumerical Algorithms, 2nd Ed., Addison-Wesley, 1975."},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"H. Krawczyk, \u201cLFSR-based hashing and authentication,\u201d In Proc. of CRYPTO\u201994, pp. 129\u2013139, 1994.","DOI":"10.1007\/3-540-48658-5_15"},{"issue":"1","key":"9_CR21","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0304-3975(93)90257-T","volume":"107","author":"Y. Mansour","year":"1993","unstructured":"Y. Mansour, N. Nisan, and P. Tiwari, \u201cThe computational complexity of universal hash functions,\u201d Theoretical Computer Science, v. 107(1), pp. 121\u2013133, 1993.","journal-title":"Theoretical Computer Science"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn and E. Schmidt, \u201cLas Vegas is better than determinism in VLSI and distributed computing,\u201d Proc. of STOC\u201982, pp. 330\u2013337, 1982.","DOI":"10.1145\/800070.802208"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"N. Nisan and A. Wigderson, \u201cOn rank vs. communication complexity,\u201d Proc. of FOCS\u201994, pp. 841\u2013836, 1994.","DOI":"10.1109\/SFCS.1994.365711"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"T. Pedersen, \u201cNon-interactive and information-theoretic secure verifiable secret sharing,\u201d Proc. of CRYPTO\u201991, pp. 129\u2013140, 1991.","DOI":"10.1007\/3-540-46766-1_9"},{"key":"9_CR25","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1977","unstructured":"R. Rivest, A. Shamir, and L. Adleman, \u201cA method for obtaining digital signatures and public-key cryptosystems,\u201d Comm. of ACM, 21, pp. 120\u2013126, 1977.","journal-title":"Comm. of ACM"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"A. Sadeghi and M. Steiner, \u201cAssumptions related to discrete logarithms: why subtleties make a real difference,\u201d Proc. of EUROCRYPT\u201901, pp. 244\u2013261, 2001.","DOI":"10.1007\/3-540-44987-6_16"},{"key":"9_CR27","unstructured":"T. Sander, private communications, 2001."},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"S. Saroiu, P. Gummadi, and S. Gribble, \u201cA measurement study of peer-to-peer file sharing systems,\u201d Proc. of Multimedia Computing and Networking 2002, January, 2002.","DOI":"10.1117\/12.449977"},{"key":"9_CR29","unstructured":"C. Schnorr, \u201cSecurity of DL-encryption and signatures against generic attacks\u2014A survey,\u201d Proc. of PKC&CNTC\u20192000, 2000."},{"key":"9_CR30","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J. Schwartz","year":"1980","unstructured":"J. Schwartz, \u201cProbabilistic algorithms for verification of polynomial identities,\u201d J. of ACM, v. 27, pp. 701\u2013717, 1980.","journal-title":"J. of ACM"},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"V. Shoup, \u201cLower bounds for discrete logarithms and related problems,\u201d Proc. of Eurocrypt\u201997, pp. 256\u2013266, 1997.","DOI":"10.1007\/3-540-69053-0_18"},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"A.-C. Yao, \u201cProtocols for secure computations,\u201d Proc. of FOCS\u201982, pp. 160\u2013164, 1982.","DOI":"10.1109\/SFCS.1982.38"},{"key":"9_CR33","doi-asserted-by":"crossref","unstructured":"A.-C. Yao, \u201cLower bounds by probabilistic arguments,\u201d Proc. of FOCS\u201983, pp. 420\u2013428, 1983.","DOI":"10.1109\/SFCS.1983.30"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36504-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T07:00:41Z","timestamp":1556694041000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36504-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540006466","9783540365044"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/3-540-36504-4_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}