{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T06:16:58Z","timestamp":1757571418491},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,1,22]],"date-time":"2014-01-22T00:00:00Z","timestamp":1390348800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s00446-013-0206-z","type":"journal-article","created":{"date-parts":[[2014,1,21]],"date-time":"2014-01-21T06:36:56Z","timestamp":1390286216000},"page":"147-164","source":"Crossref","is-referenced-by-count":10,"title":["Leakage-resilient coin tossing"],"prefix":"10.1007","volume":"27","author":[{"given":"Elette","family":"Boyle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shafi","family":"Goldwasser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yael Tauman","family":"Kalai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,1,22]]},"reference":[{"key":"206_CR1","doi-asserted-by":"crossref","unstructured":"Akavia, A., Goldwasser, S., Vaikuntanathan, V.: Simultaneous hardcore bits and cryptography against memory attacks. In: Proceedings of the 6th Theory of Cryptography Conference, pp. 474\u2013495 (2009)","DOI":"10.1007\/978-3-642-00457-5_28"},{"key":"206_CR2","doi-asserted-by":"crossref","unstructured":"Akavia, A., Goldwasser, S., Hazay, C.: Distributed public key schemes secure against continual leakage. In: PODC, pp. 155\u2013164 (2012)","DOI":"10.1145\/2332432.2332462"},{"key":"206_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Another advantage of free choice: completely asynchronous agreement protocols (extended abstract). In: PODC, pp. 27\u201330 (1983)","DOI":"10.1145\/800221.806707"},{"key":"206_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"206_CR5","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Halevi, S.: Leakage-tolerant interactive protocols. In: TCC, pp. 266\u2013284 (2012)","DOI":"10.1007\/978-3-642-28914-9_15"},{"issue":"1","key":"206_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S1793042105000108","volume":"1","author":"J Bourgain","year":"2005","unstructured":"Bourgain, J.: More on the sum-product phenomenon in prime fields and its applications. Int. J. Number Theory 1(1), 1\u201332 (2005)","journal-title":"Int. J. Number Theory"},{"key":"206_CR7","doi-asserted-by":"crossref","unstructured":"Boyle, E., Goldwasser, S., Jain, A., Kalai, Y.: Multiparty computation secure against continual memory leakage. In: STOC, pp. 1235\u20131254 (2012)","DOI":"10.1145\/2213977.2214087"},{"key":"206_CR8","doi-asserted-by":"crossref","unstructured":"Boyle, E., Garg, S., Jain, A., Kalai, Y., Sahai, A.: Secure computation against adaptive auxiliary information. In: CRYPTO, pp. 316\u2013334 (2013)","DOI":"10.1007\/978-3-642-40041-4_18"},{"key":"206_CR9","doi-asserted-by":"crossref","unstructured":"Bracha, G.: An asynchronous $$[(n-1)\/3]$$ [ ( n - 1 ) \/ 3 ] -resilient consensus protocol. In: PODC, pp. 154\u2013162 (1984)","DOI":"10.1145\/800222.806743"},{"key":"206_CR10","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Kalai, Y., Katz, J., Vaikuntanathan, V.: Overcoming the hole in the bucket: public-key cryptography resilient to continual memory leakage. In: FOCS, pp. 501\u2013510 (2010)","DOI":"10.1109\/FOCS.2010.55"},{"key":"206_CR11","doi-asserted-by":"crossref","unstructured":"Canetti, R., Feige, U., Goldreich, O., Naor, M.: Adaptively secure multi-party computation. In: STOC, pp. 639\u2013648 (1996)","DOI":"10.1145\/237814.238015"},{"key":"206_CR12","doi-asserted-by":"crossref","unstructured":"Canetti, R., Dodis, Y., Halevi, S., Kushilevitz, E., Sahai, A.: Exposure-resilient functions and all-or-nothing transforms. In: Advances in Cryptology\u2014EUROCRYPT\u201900, pp. 453\u2013469. (2000)","DOI":"10.1007\/3-540-45539-6_33"},{"key":"206_CR13","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: STOC, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"206_CR14","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults. In: Proceedings of the 26th Annual Symposium on Foundations of Computer Science, pp. 383\u2013395 (1985)","DOI":"10.1109\/SFCS.1985.64"},{"key":"206_CR15","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty (extended abstract). In: STOC, pp. 364\u2013369 (1986)","DOI":"10.1145\/12130.12168"},{"issue":"1","key":"206_CR16","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y Dodis","year":"2008","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.: Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38(1), 97\u2013139 (2008)","journal-title":"SIAM J. Comput."},{"key":"206_CR17","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Haralambiev, K., L\u00f3pez-Alt, A., Wichs, D.: Cryptography against continuous memory attacks. In: FOCS, pp. 511\u2013520 (2010)","DOI":"10.1109\/FOCS.2010.56"},{"issue":"3","key":"206_CR18","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1137\/0219032","volume":"19","author":"C Dwork","year":"1990","unstructured":"Dwork, C., Shmoys, D.B., Stockmeyer, L.J.: Flipping persuasively in constant time. SIAM J. Comput. 19(3), 472\u2013499 (1990)","journal-title":"SIAM J. Comput."},{"key":"206_CR19","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Pietrzak, K.: Leakage-resilient cryptography. In: Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 293\u2013302 (2008)","DOI":"10.1109\/FOCS.2008.56"},{"key":"206_CR20","doi-asserted-by":"crossref","unstructured":"Feige, U.: Noncryptographic selection protocols. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science (1999)","DOI":"10.1109\/SFFCS.1999.814586"},{"key":"206_CR21","doi-asserted-by":"crossref","unstructured":"Feldman, P., Micali, S.: Byzantine agreement in constant expected time (and trusting no one). In: FOCS, pp. 267\u2013276 (1985)","DOI":"10.1109\/SFCS.1985.14"},{"key":"206_CR22","doi-asserted-by":"crossref","unstructured":"Garg, S., Jain, A., Sahai, A.: Leakage-resilient zero knowledge. In: CRYPTO, pp. 297\u2013315 (2011)","DOI":"10.1007\/978-3-642-22792-9_17"},{"key":"206_CR23","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"206_CR24","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption and how to play mental poker keeping secret all partial information. In: STOC, pp. 365\u2013377 (1982)","DOI":"10.1145\/800070.802212"},{"key":"206_CR25","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Sudan, M., Vaikuntanathan, V.: Distributed computing with imperfect randomness. In: DISC, pp. 288\u2013302 (2005)","DOI":"10.1007\/11561927_22"},{"key":"206_CR26","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Sahai, A., Wagner, D.: Private circuits: Securing hardware against probing attacks. In: Advances in Cryptology\u2014CRYPTO\u201903, pp. 463\u2013481 (2003)","DOI":"10.1007\/978-3-540-45146-4_27"},{"key":"206_CR27","doi-asserted-by":"crossref","unstructured":"Kalai, Y., Li, X., Rao, A., Zuckerman, D.: Network extractor protocols. In: FOCS, pp. 654\u2013663 (2008)","DOI":"10.1109\/FOCS.2008.73"},{"key":"206_CR28","doi-asserted-by":"crossref","unstructured":"Kalai, Y.T., Li, X., Rao, A.: 2-source extractors under computational assumptions and cryptography with defective randomness. In: FOCS, pp. 617\u2013626 (2009)","DOI":"10.1109\/FOCS.2009.61"},{"key":"206_CR29","doi-asserted-by":"crossref","unstructured":"Kamp, J., Rao, A., Vadhan, S., Zuckerman, D.: Deterministic extractors for small-space sources. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pp. 691\u2013700 (2006)","DOI":"10.1145\/1132516.1132613"},{"key":"206_CR30","doi-asserted-by":"crossref","unstructured":"Katz, J., Vaikuntanathan, V.: Signature schemes with bounded leakage resilience. In: Advances in Cryptology\u2014ASIACRYPT\u201909, pp. 703\u2013720 (2009)","DOI":"10.1007\/978-3-642-10366-7_41"},{"key":"206_CR31","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"RJ McEliece","year":"1981","unstructured":"McEliece, R.J., Sarwate, D.V.: On sharing secrets and reed-solomon codes. Commun. ACM 24, 583\u2013584 (1981)","journal-title":"Commun. ACM"},{"key":"206_CR32","doi-asserted-by":"crossref","unstructured":"Micali, S., Reyzin, L.: Physically observable cryptography. In: Proceedings of the 1st Theory of Cryptography Conference, pp. 278\u2013296 (2004)","DOI":"10.1007\/978-3-540-24638-1_16"},{"key":"206_CR33","doi-asserted-by":"crossref","unstructured":"Moran, T., Naor, M., Segev, G.: An optimally fair coin toss. In: TCC, pp. 1\u201318 (2009)","DOI":"10.1007\/978-3-642-00457-5_1"},{"key":"206_CR34","doi-asserted-by":"crossref","unstructured":"Naor, M., Segev, G.: Public-key cryptosystems resilient to key leakage. In: Advances in Cryptology\u2014CRYPTO\u201909, pp. 18\u201335 (2009)","DOI":"10.1007\/978-3-642-03356-8_2"},{"key":"206_CR35","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Randomized byzantine generals. In: FOCS, pp. 403\u2013409 (1983)","DOI":"10.1109\/SFCS.1983.48"},{"key":"206_CR36","doi-asserted-by":"crossref","unstructured":"Raz, R.: Extractors with weak random seeds. In: STOC, pp. 11\u201320 (2005)","DOI":"10.1145\/1060590.1060593"},{"key":"206_CR37","doi-asserted-by":"crossref","unstructured":"Rivest, R.L.: All-or-nothing encryption and the package transform. In: FSE, pp. 210\u2013218 (1997)","DOI":"10.1007\/BFb0052348"},{"key":"206_CR38","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22, 612\u2013613 (1979)","journal-title":"Commun. ACM"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-013-0206-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-013-0206-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-013-0206-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T21:17:22Z","timestamp":1565126242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-013-0206-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,22]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["206"],"URL":"https:\/\/doi.org\/10.1007\/s00446-013-0206-z","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,22]]}}}