{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:25:29Z","timestamp":1725899129150},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385186"},{"type":"electronic","value":"9783642385193"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38519-3_11","type":"book-chapter","created":{"date-parts":[[2013,5,2]],"date-time":"2013-05-02T03:59:28Z","timestamp":1367467168000},"page":"157-174","source":"Crossref","is-referenced-by-count":0,"title":["Nested Merkle\u2019s Puzzles against Sampling Attacks"],"prefix":"10.1007","author":[{"given":"Shlomi","family":"Dolev","sequence":"first","affiliation":[]},{"given":"Nova","family":"Fandina","sequence":"additional","affiliation":[]},{"given":"Ximing","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems. Electronic Colloquium on Computational Complexity (ECCC)\u00a03(7) (1996)","DOI":"10.1145\/237814.237838"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/3-540-44810-1_22","volume-title":"Security Protocols","author":"T. Aura","year":"2001","unstructured":"Aura, T., Nikander, P., Leiwo, J.: DOS-resistant authentication with client puzzles. In: Christianson, B., Crispo, B., Malcolm, J.A., Roe, M. (eds.) Security Protocols 2000. LNCS, vol.\u00a02133, pp. 170\u2013177. Springer, Heidelberg (2001)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/978-3-642-29011-4_42","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A. Banerjee","year":"2012","unstructured":"Banerjee, A., Peikert, C., Rosen, A.: Pseudorandom functions and lattices. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 719\u2013737. Springer, Heidelberg (2012)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-642-03356-8_22","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"B. Barak","year":"2009","unstructured":"Barak, B., Mahmoody-Ghidary, M.: Merkle puzzles are optimal \u2014 an o(n\n                2)-query attack on any key exchange from a random oracle. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 374\u2013390. Springer, Heidelberg (2009)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-540-78524-8_4","volume-title":"Theory of Cryptography","author":"E. Biham","year":"2008","unstructured":"Biham, E., Goren, Y.J., Ishai, Y.: Basing weak public-key cryptography on strong one-way functions. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 55\u201372. Springer, Heidelberg (2008)"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-642-22792-9_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"G. Brassard","year":"2011","unstructured":"Brassard, G., H\u00f8yer, P., Kalach, K., Kaplan, M., Laplante, S., Salvail, L.: Merkle puzzles in a quantum world. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 391\u2013410. Springer, Heidelberg (2011)"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Brassard, G., Salvail, L.: Quantum merkle puzzles. In: ICQNM, pp. 76\u201379. IEEE Computer Society (2008)","DOI":"10.1109\/ICQNM.2008.16"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/BFb0052243","volume-title":"Advances in Cryptology - CRYPTO 19\u201997","author":"C. Cachin","year":"1997","unstructured":"Cachin, C., Maurer, U.M.: Unconditional security against memory-bounded adversaries. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 292\u2013306. Springer, Heidelberg (1997)"},{"issue":"4","key":"11_CR9","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1145\/1008731.1008734","volume":"51","author":"R. Canetti","year":"2004","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. J. ACM\u00a051(4), 557\u2013594 (2004)","journal-title":"J. ACM"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Dolev, S., Gilboa, N., Kopeetsky, M., Persiano, G., Spirakis, P.G.: Information security for sensors by overwhelming random sequences and permutations. In: Al-Shaer, E., Keromytis, A.D., Shmatikov, V. (eds.) ACM CCS, pp. 669\u2013671 (2010)","DOI":"10.1145\/1866307.1866392"},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/s00224-009-9236-0","volume":"48","author":"S. Dolev","year":"2011","unstructured":"Dolev, S., Kopeetsky, M., Shamir, A.: RFID authentication efficient proactive information security within computational security. Theory Comput. Syst.\u00a048(1), 132\u2013149 (2011)","journal-title":"Theory Comput. Syst."},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-76627-8_20","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"S. Dolev","year":"2007","unstructured":"Dolev, S., Korach, E., Uzan, G.: Magnifying Computing Gaps establishing encrypted communication over unidirectional channels (Extended abstract). In: Masuzawa, T., Tixeuil, S. (eds.) SSS 2007. LNCS, vol.\u00a04838, pp. 253\u2013265. Springer, Heidelberg (2007)"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: Johnson, D.S. (ed.) STOC, pp. 44\u201361 (1989)","DOI":"10.1145\/73007.73012"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-540-30598-9_11","volume-title":"Security in Communication Networks","author":"A. Juels","year":"2005","unstructured":"Juels, A.: Minimalist cryptography for low-cost RFID tags (Extended abstract). In: Blundo, C., Cimato, S. (eds.) SCN 2004. LNCS, vol.\u00a03352, pp. 149\u2013164. Springer, Heidelberg (2005)"},{"key":"11_CR15","unstructured":"Mahmoody, M., Moran, T., Vadhan, S.: Non-interactive time-stamping and proofs of work in the random oracle model. Cryptology ePrint Archive, Report 2011\/553 (2011), \n                  \n                    http:\/\/eprint.iacr.org\/"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-642-22792-9_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"M. Mahmoody","year":"2011","unstructured":"Mahmoody, M., Moran, T., Vadhan, S.: Time-lock puzzles in the random oracle model. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 39\u201350. Springer, Heidelberg (2011)"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Mao, W.: Timed-release cryptography. Cryptology ePrint Archive, Report 2001\/014 (2001), \n                  \n                    http:\/\/eprint.iacr.org\/","DOI":"10.1007\/3-540-45537-X_27"},{"issue":"4","key":"11_CR18","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1145\/359460.359473","volume":"21","author":"R.C. Merkle","year":"1978","unstructured":"Merkle, R.C.: Secure communications over insecure channels. Commun. ACM\u00a021(4), 294\u2013299 (1978)","journal-title":"Commun. ACM"},{"issue":"2","key":"11_CR19","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s00145-008-9035-9","volume":"22","author":"T. Moran","year":"2009","unstructured":"Moran, T., Shaltiel, R., Ta-Shma, A.: Non-interactive time stamping in the bounded-storage model. J. Cryptology\u00a022(2), 189\u2013226 (2009)","journal-title":"J. Cryptology"},{"key":"11_CR20","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and timed-release crypto. Technical report, Cambridge, MA, USA (1996)"},{"key":"11_CR21","unstructured":"Sotakova, M.: Breaking one-round key-agreement protocols in the random oracle model. Cryptology ePrint Archive, Report 2008\/053 (2008), \n                  \n                    http:\/\/eprint.iacr.org\/"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38519-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T15:12:30Z","timestamp":1557673950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38519-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385186","9783642385193"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38519-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}