{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T18:10:10Z","timestamp":1746295810067,"version":"3.40.4"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319087825"},{"type":"electronic","value":"9783319087832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08783-2_17","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T14:04:30Z","timestamp":1404569070000},"page":"191-202","source":"Crossref","is-referenced-by-count":0,"title":["A Protocol for Generating Random Elements with Their Probabilities"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Holenstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robin","family":"K\u00fcnzler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., Barak, B.: Computational Complexity - A Modern Approach. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511804090"},{"key":"17_CR2","unstructured":"Akavia, A., Goldreich, O., Goldwasser, S., Moshkovitz, D.: On basing one-way functions on NP-hardness. In: Kleinberg, J.M. (ed.) STOC, pp. 701\u2013710. ACM (2006), See also errata on author\u2019s webpage, http:\/\/www.wisdom.weizmann.ac.il\/~oded\/p_aggm.html"},{"issue":"3","key":"17_CR3","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0022-0000(91)90006-Q","volume":"42","author":"W. Aiello","year":"1991","unstructured":"Aiello, W., H\u00e5stad, J.: Statistical zero-knowledge languages can be recognized in two rounds. J. Comput. Syst. Sci.\u00a042(3), 327\u2013345 (1991)","journal-title":"J. Comput. Syst. Sci."},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Babai, L.: Trading group theory for randomness. In: Sedgewick, R. (ed.) STOC, pp. 421\u2013429. ACM (1985)","DOI":"10.1145\/22145.22192"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Babai, L.: E-mail and the unexpected power of interaction. In: Structure in Complexity Theory Conference, pp. 30\u201344. IEEE Computer Society (1990)","DOI":"10.1109\/SCT.1990.113952"},{"issue":"2","key":"17_CR6","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/0022-0000(88)90028-1","volume":"36","author":"L. Babai","year":"1988","unstructured":"Babai, L., Moran, S.: Arthur-merlin games: A randomized proof system, and a hierarchy of complexity classes. J. Comput. Syst. Sci.\u00a036(2), 254\u2013276 (1988)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"17_CR7","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1137\/S0097539705446974","volume":"36","author":"A. Bogdanov","year":"2006","unstructured":"Bogdanov, A., Trevisan, L.: On worst-case to average-case reductions for NP problems. SIAM J. Comput.\u00a036(4), 1119\u20131159 (2006)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"17_CR8","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1137\/0222061","volume":"22","author":"J. Feigenbaum","year":"1993","unstructured":"Feigenbaum, J., Fortnow, L.: Random-self-reducibility of complete sets. SIAM J. Comput.\u00a022(5), 994\u20131005 (1993)","journal-title":"SIAM J. Comput."},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Fortnow, L.: The complexity of perfect zero-knowledge. In: Structure in Complexity Theory Conference. IEEE Computer Society (1987)","DOI":"10.1145\/28395.28418"},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput.\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Mansour, Y., Sipser, M.: Interactive proof systems: Provers that never fail and random selection (extended abstract). In: FOCS, pp. 449\u2013461. IEEE Computer Society (1987)","DOI":"10.1109\/SFCS.1987.35"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Computational complexity - a conceptual perspective. Cambridge University Press (2008)","DOI":"10.1017\/CBO9780511804106"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Sipser, M.: Private coins versus public coins in interactive proof systems. In: Hartmanis, J. (ed.) STOC, pp. 59\u201368. ACM (1986)","DOI":"10.1145\/12130.12137"},{"issue":"1-2","key":"17_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00037-002-0169-0","volume":"11","author":"O. Goldreich","year":"2002","unstructured":"Goldreich, O., Vadhan, S.P., Wigderson, A.: On interactive proofs with a laconic prover. Computational Complexity\u00a011(1-2), 1\u201353 (2002)","journal-title":"Computational Complexity"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Haitner, I., Mahmoody, M., Xiao, D.: A new sampling protocol and applications to basing cryptographic primitives on the hardness of NP. In: IEEE Conference on Computational Complexity, pp. 76\u201387. IEEE Computer Society (2010)","DOI":"10.1109\/CCC.2010.17"},{"issue":"4","key":"17_CR16","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1145\/146585.146605","volume":"39","author":"C. Lund","year":"1992","unstructured":"Lund, C., Fortnow, L., Karloff, H.J., Nisan, N.: Algebraic methods for interactive proof systems. J. ACM\u00a039(4), 859\u2013868 (1992)","journal-title":"J. ACM"},{"issue":"4","key":"17_CR17","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1145\/146585.146609","volume":"39","author":"A. Shamir","year":"1992","unstructured":"Shamir, A.: IP = PSPACE. J. ACM\u00a039(4), 869\u2013877 (1992)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08783-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T17:49:07Z","timestamp":1746294547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08783-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319087825","9783319087832"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08783-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}