{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T04:15:13Z","timestamp":1750997713661,"version":"3.41.0"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319704999"},{"type":"electronic","value":"9783319705002"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-70500-2_3","type":"book-chapter","created":{"date-parts":[[2017,11,4]],"date-time":"2017-11-04T02:32:13Z","timestamp":1509762733000},"page":"56-81","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Position-Based Cryptography and Multiparty Communication Complexity"],"prefix":"10.1007","author":[{"given":"Joshua","family":"Brody","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Dziembowski","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"Faust","sequence":"additional","affiliation":[]},{"given":"Krzysztof","family":"Pietrzak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,5]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/3-540-60922-9_51","volume-title":"STACS 96","author":"A Ambainis","year":"1996","unstructured":"Ambainis, A.: Upper bounds on multiparty communication complexity of shifts. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol. 1046, pp. 631\u2013642. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-60922-9_51"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/10719839_21","volume-title":"LATIN 2000: Theoretical Informatics","author":"A Ambainis","year":"2000","unstructured":"Ambainis, A., Lokam, S.V.: Improved upper bounds on the simultaneous messages complexity of the generalized addressing function. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 207\u2013216. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10719839_21"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/3-540-48405-1_5","volume-title":"Advances in Cryptology \u2014 CRYPTO 1999","author":"Y Aumann","year":"1999","unstructured":"Aumann, Y., Rabin, M.O.: Information theoretically secure communication in the limited storage space model. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 65\u201379. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_5"},{"issue":"1","key":"3_CR4","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1137\/S0097539700375944","volume":"33","author":"L Babai","year":"2004","unstructured":"Babai, L., G\u00e1l, A., Kimmel, P.G., Lokam, S.V.: Communication complexity of simultaneous messages. SIAM J. Comput. 33(1), 137\u2013166 (2004)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"3_CR5","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/s004930100009","volume":"21","author":"L Babai","year":"2001","unstructured":"Babai, L., Hayes, T.P., Kimmel, P.G.: The cost of the missing bit: communication complexity with help. Combinatorica 21(4), 455\u2013488 (2001)","journal-title":"Combinatorica"},{"issue":"2","key":"3_CR6","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/0022-0000(92)90047-M","volume":"45","author":"L Babai","year":"1992","unstructured":"Babai, L., Nisan, N., Szegedy, M.: Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs. J. Comput. Syst. Sci. 45(2), 204\u2013232 (1992)","journal-title":"J. Comput. Syst. Sci."},{"doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Ashby, V. (ed.) ACM CCS 1993, Fairfax, Virginia, USA, pp. 62\u201373. ACM Press, 3\u20135 November 1993","key":"3_CR7","DOI":"10.1145\/168588.168596"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/3-540-48285-7_30","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1993","author":"S Brands","year":"1994","unstructured":"Brands, S., Chaum, D.: Distance-bounding protocols. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 344\u2013359. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48285-7_30"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1038\/479307a","volume":"479","author":"G Brassard","year":"2011","unstructured":"Brassard, G.: Quantum information: the conundrum of secure positioning. Nature 479, 307\u2013308 (2011)","journal-title":"Nature"},{"issue":"1","key":"3_CR10","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1137\/130913687","volume":"43","author":"H Buhrman","year":"2014","unstructured":"Buhrman, H., Chandran, N., Fehr, S., Gelles, R., Goyal, V., Ostrovsky, R., Schaffner, C.: Position-based quantum cryptography: impossibility and constructions. SIAM J. Comput. 43(1), 150\u2013178 (2014)","journal-title":"SIAM J. Comput."},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/BFb0052243","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201997","author":"C Cachin","year":"1997","unstructured":"Cachin, C., Maurer, U.: Unconditional security against memory-bounded adversaries. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 292\u2013306. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052243"},{"doi-asserted-by":"crossref","unstructured":"Capkun, S., Hubaux, J.-P.: Secure positioning of wireless devices with application to sensor networks. In: Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2005, vol. 3, pp. 1917\u20131928. IEEE, March 2005","key":"3_CR12","DOI":"10.1109\/INFCOM.2005.1498470"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-540-70936-7_26","volume-title":"Theory of Cryptography","author":"D Cash","year":"2007","unstructured":"Cash, D., Ding, Y.Z., Dodis, Y., Lee, W., Lipton, R., Walfish, S.: Intrusion-resilient key exchange in the bounded retrieval model. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 479\u2013498. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_26"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"052304","DOI":"10.1103\/PhysRevA.92.052304","volume":"92","author":"K Chakraborty","year":"2015","unstructured":"Chakraborty, K., Leverrier, A.: Practical position-based quantum cryptography. Phys. Rev. A 92, 052304 (2015)","journal-title":"Phys. Rev. A"},{"doi-asserted-by":"crossref","unstructured":"Chandra, A.K., Furst, M.L., Lipton, R.J.: Multi-party protocols. In: Proceedings of the 15th Annual ACM Symposium on the Theory of Computing, pp. 94\u201399 (1983)","key":"3_CR15","DOI":"10.1145\/800061.808737"},{"issue":"4","key":"3_CR16","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1137\/100805005","volume":"43","author":"N Chandran","year":"2014","unstructured":"Chandran, N., Goyal, V., Moriarty, R., Ostrovsky, R.: Position-based cryptography. SIAM J. Comput. 43(4), 1291\u20131341 (2014)","journal-title":"SIAM J. Comput."},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/11681878_11","volume-title":"Theory of Cryptography","author":"S Dziembowski","year":"2006","unstructured":"Dziembowski, S.: Intrusion-resilience via the bounded-storage model. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 207\u2013224. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_11"},{"doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Maurer, U.M.: Tight security proofs for the bounded-storage model. In: 34th ACM STOC, pp. 341\u2013350, Montr\u00e9al, Qu\u00e9bec, Canada. ACM Press, 19\u201321 May 2002","key":"3_CR18","DOI":"10.1145\/509907.509960"},{"issue":"1","key":"3_CR19","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00145-003-0309-y","volume":"17","author":"S Dziembowski","year":"2004","unstructured":"Dziembowski, S., Maurer, U.M.: Optimal randomizer efficiency in the bounded-storage model. J. Crypt. 17(1), 5\u201326 (2004)","journal-title":"J. Crypt."},{"doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Pietrzak, K.: Intrusion-resilient secret sharing. In 48th FOCS, Providence, USA, pp. 227\u2013237. IEEE Computer Society Press, 20\u201323 October 2007","key":"3_CR20","DOI":"10.1109\/FOCS.2007.63"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-319-06734-6_19","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2014","author":"S Dziembowski","year":"2014","unstructured":"Dziembowski, S., Zdanowicz, M.: Position-based cryptography from noisy channels. In: Pointcheval, D., Vergnaud, D. (eds.) AFRICACRYPT 2014. LNCS, vol. 8469, pp. 300\u2013317. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06734-6_19"},{"issue":"3","key":"3_CR22","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s00037-012-0052-6","volume":"22","author":"J Ford","year":"2013","unstructured":"Ford, J., G\u00e1l, A.: Hadamard tensors and lower bounds on multiparty communication complexity. Comput. Complex. 22(3), 595\u2013622 (2013)","journal-title":"Comput. Complex."},{"issue":"1","key":"3_CR23","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1002\/rsa.20388","volume":"40","author":"FC Graham","year":"2012","unstructured":"Graham, F.C.: Quasi-random hypergraphs revisited. Random Struct. Algorithms 40(1), 39\u201348 (2012)","journal-title":"Random Struct. Algorithms"},{"key":"3_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)60342-3","volume-title":"Communication Complexity","author":"E Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"issue":"1","key":"3_CR25","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00145-003-0217-1","volume":"17","author":"C-J Lu","year":"2004","unstructured":"Lu, C.-J.: Encryption against storage-bounded adversaries from on-line strong extractors. J. Crypt. 17(1), 27\u201342 (2004)","journal-title":"J. Crypt."},{"issue":"1","key":"3_CR26","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF00191321","volume":"5","author":"UM Maurer","year":"1992","unstructured":"Maurer, U.M.: Conditionally-perfect secrecy and a provably-secure randomized cipher. J. Crypt. 5(1), 53\u201366 (1992)","journal-title":"J. Crypt."},{"issue":"2","key":"3_CR27","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 timestamping in the bounded-storage model. J. Crypt. 22(2), 189\u2013226 (2009)","journal-title":"J. Crypt."},{"doi-asserted-by":"crossref","unstructured":"Nisan, N., Wigderson, A.: Rounds in communication complexity revisited. In: 23rd ACM STOC, New Orleans, Louisiana, USA, pp. 419\u2013429. ACM Press, 6\u20138 May 1991","key":"3_CR28","DOI":"10.1145\/103418.103463"},{"issue":"1","key":"3_CR29","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1006\/jcss.1996.0004","volume":"52","author":"N Nisan","year":"1996","unstructured":"Nisan, N., Zuckerman, D.: Randomness is linear in space. J. Comput. Syst. Sci. 52(1), 43\u201352 (1996)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-58201-0_53","volume-title":"Automata, Languages and Programming","author":"P Pudl\u00e1k","year":"1994","unstructured":"Pudl\u00e1k, P.: Unexpected upper bounds on the complexity of some communication games. In: Abiteboul, S., Shamir, E. (eds.) ICALP 1994. LNCS, vol. 820, pp. 1\u201310. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58201-0_53"},{"issue":"3","key":"3_CR31","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S0097539794264809","volume":"26","author":"P Pudlk","year":"1997","unstructured":"Pudlk, P., R\u00f6dl, V., Sgall, J.: Boolean circuits, tensor ranks, and communication complexity. SIAM J. Comput. 26(3), 605\u2013633 (1997)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"3_CR32","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/PL00001602","volume":"9","author":"R Raz","year":"2000","unstructured":"Raz, R.: The BNS-Chung criterion for multi-party communication complexity. Comput. Complex. 9(2), 113\u2013122 (2000)","journal-title":"Comput. Complex."},{"doi-asserted-by":"crossref","unstructured":"Sastry, N., Shankar, U., Wagner, D.: Secure verification of location claims. In: Proceedings of the 2nd ACM Workshop on Wireless Security, WiSe 2003, pp. 1\u201310. ACM, New York (2003)","key":"3_CR33","DOI":"10.1145\/941311.941313"},{"unstructured":"Schaffner, C.: Position-based quantum cryptography. Webpage. http:\/\/homepages.cwi.nl\/schaffne\/positionbasedqcrypto.php . Accessed 17 Feb 2016","key":"3_CR34"},{"key":"3_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-44381-1_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"D Unruh","year":"2014","unstructured":"Unruh, D.: Quantum position verification in the random oracle model. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 1\u201318. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_1"},{"issue":"1","key":"3_CR36","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s00145-003-0237-x","volume":"17","author":"SP Vadhan","year":"2004","unstructured":"Vadhan, S.P.: Constructing locally computable extractors and cryptosystems in the bounded-storage model. J. Crypt. 17(1), 43\u201377 (2004)","journal-title":"J. Crypt."},{"key":"3_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/11516798_27","volume-title":"Principles of Distributed Systems","author":"A Vora","year":"2005","unstructured":"Vora, A., Nesterenko, M.: Secure location verification using radio broadcast. In: Higashino, T. (ed.) OPODIS 2004. LNCS, vol. 3544, pp. 369\u2013383. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11516798_27"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-70500-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T21:25:27Z","timestamp":1750973127000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-70500-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319704999","9783319705002"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-70500-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"5 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Baltimore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 November 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iacr.org\/workshops\/tcc2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}