{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T19:40:05Z","timestamp":1748461205109,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476710"},{"type":"electronic","value":"9783662476727"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47672-7_1","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T10:07:39Z","timestamp":1434708459000},"page":"1-13","source":"Crossref","is-referenced-by-count":2,"title":["Statistical Randomized Encodings: A\u00a0Complexity Theoretic View"],"prefix":"10.1007","author":[{"given":"Shweta","family":"Agrawal","sequence":"first","affiliation":[]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[]},{"given":"Dakshita","family":"Khurana","sequence":"additional","affiliation":[]},{"given":"Anat","family":"Paskin-Cherniavsky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Aiello, W., H\u00e5stad, J.: Relativized perfect zero knowledge is not BPP. Inf. Comput. (1991)","DOI":"10.1016\/0890-5401(91)90024-V"},{"key":"1_CR2","unstructured":"Applebaum, B.: Cryptography in Constant Parallel Time. Ph.D. thesis, Technion (2007)"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-642-20728-0_3","volume-title":"Information Theoretic Security","author":"B Applebaum","year":"2011","unstructured":"Applebaum, B.: Randomly encoding functions: a new cryptographic paradigm. In: Fehr, S. (ed.) ICITS 2011. LNCS, vol. 6673, pp. 25\u201331. Springer, Heidelberg (2011)"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Computationally private randomizing polynomials and their applications. In: IEEE Conference on Computational Complexity, pp. 260\u2013274. IEEE Computer Society (2005)","DOI":"10.1109\/CCC.2005.9"},{"issue":"4","key":"1_CR5","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1137\/S0097539705446950","volume":"36","author":"B Applebaum","year":"2006","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in NC0. SIAM J. Comput. 36(4), 845\u2013888 (2006)","journal-title":"SIAM J. Comput."},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-642-14165-2_14","volume-title":"Automata, Languages and Programming","author":"B Applebaum","year":"2010","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: From secrecy to soundness: efficient verification via secure computation. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 152\u2013163. Springer, Heidelberg (2010)"},{"issue":"4","key":"1_CR7","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/0204037","volume":"4","author":"TP Baker","year":"1975","unstructured":"Baker, T.P., Gill, J., Solovay, R.: Relativizatons of the P =? NP question. SIAM J. Comput. 4(4), 431\u2013442 (1975)","journal-title":"SIAM J. Comput."},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: STOC. ACM (1988)","DOI":"10.1145\/62212.62213"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damgard, I.: Multiparty unconditionally secure protocols. In: STOC, pp. 11\u201319. ACM, New York (1988)","DOI":"10.1145\/62212.62214"},{"key":"1_CR10","unstructured":"Dvir, Z., Gutfreund, D., Rothblum, G.N., Vadhan, S.: On approximating the entropy of polynomial mappings. In: ICS, pp. 460\u2013475 (2011)"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Feige, U., Killian, J., Naor, M.: A minimal model for secure computation (extended abstract). In: STOC, pp. 554\u2013563 (1994)","DOI":"10.1145\/195058.195408"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Galbraith, S.D., Rotger, V.: Easy decision-diffie-hellman groups (2004)","DOI":"10.1112\/S1461157000001108"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E.: Randomizing polynomials: a new representation with applications to round-efficient secure computation. In: FOCS, pp. 294\u2013304. IEEE Computer Society (2000)","DOI":"10.1109\/SFCS.2000.892118"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-45465-9_22","volume-title":"Automata, Languages and Programming","author":"Y Ishai","year":"2002","unstructured":"Ishai, Y., Kushilevitz, E.: Perfect constant-round secure computation via perfect randomizing polynomials. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 244\u2013256. Springer, Heidelberg (2002)"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Paskin-Cherniavsky, A.: From randomizing polynomials to parallel algorithms. In: ITCS. ACM, New York (2012)","DOI":"10.1145\/2090236.2090244"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding crytpography on oblivious transfer. In: STOC, pp. 20\u201331. ACM, New York (1988)","DOI":"10.1145\/62212.62215"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. J. ACM 51(2), Mar 2004","DOI":"10.1145\/972639.972643"},{"issue":"2","key":"1_CR18","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1145\/636865.636868","volume":"50","author":"A Sahai","year":"2003","unstructured":"Sahai, A., Vadhan, S.: A complete problem for statistical zero knowledge. J. ACM 50(2), 196\u2013249 (2003). http:\/\/doi.acm.org\/10.1145\/636865.636868","journal-title":"J. ACM"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: FOCS, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47672-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T19:09:48Z","timestamp":1748459388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-47672-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476710","9783662476727"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47672-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}