{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:38:24Z","timestamp":1783010304118,"version":"3.54.6"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031385506","type":"print"},{"value":"9783031385513","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-38551-3_19","type":"book-chapter","created":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T19:02:27Z","timestamp":1691521347000},"page":"602-632","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":48,"title":["Expand-Convolute Codes for\u00a0Pseudorandom Correlation Generators from\u00a0LPN"],"prefix":"10.1007","author":[{"given":"Srinivasan","family":"Raghuraman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Rindal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Titouan","family":"Tanguy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,8,9]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Aguilar-Melchor, C., Blazy, O., Deneuville, J.C., Gaborit, P., Z\u00e9mor, G.: Efficient encryption from random Quasi-cyclic codes. IEEE TIT (2018)","DOI":"10.1109\/TIT.2018.2804444"},{"key":"19_CR2","doi-asserted-by":"publisher","unstructured":"Akavia, A., Bogdanov, A., Guo, S., Kamath, A., Rosen, A.: Candidate weak pseudorandom functions in $${\\sf AC} ^0$$$$o$$ MOD$$_2$$, pp. 251\u2013260 (2014). https:\/\/doi.org\/10.1145\/2554797.2554821","DOI":"10.1145\/2554797.2554821"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Al Jabri, A.: A statistical decoding algorithm for general linear block codes (2001)","DOI":"10.1007\/3-540-45325-3_1"},{"key":"19_CR4","doi-asserted-by":"publisher","unstructured":"Alekhnovich, M.: More on average case vs approximation complexity, pp. 298\u2013307 (2003). https:\/\/doi.org\/10.1109\/SFCS.2003.1238204","DOI":"10.1109\/SFCS.2003.1238204"},{"key":"19_CR5","unstructured":"Aragon, N., et al.: Bike: bit flipping key encapsulation (2017)"},{"issue":"1","key":"19_CR6","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/TIT.2008.2008114","volume":"55","author":"L Bazzi","year":"2009","unstructured":"Bazzi, L., Mahdian, M., Spielman, D.A.: The minimum distance of turbo-like codes. IEEE Trans. Inf. Theory 55(1), 6\u201315 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"19_CR7","doi-asserted-by":"publisher","first-page":"1261","DOI":"10.1109\/26.539767","volume":"44","author":"C Berrou","year":"1996","unstructured":"Berrou, C., Glavieux, A.: Near optimum error correcting coding and decoding: turbo-codes. IEEE Trans. Commun. 44(10), 1261\u20131271 (1996)","journal-title":"IEEE Trans. Commun."},{"key":"19_CR8","doi-asserted-by":"publisher","unstructured":"Blum, A., Furst, M.L., Kearns, M.J., Lipton, R.J.: Cryptographic primitives based on hard learning problems, pp. 278\u2013291 (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_24","DOI":"10.1007\/3-540-48329-2_24"},{"key":"19_CR9","unstructured":"Bogdanov, A., Rosen, A.: Pseudorandom functions: three decades later. Cryptology ePrint Archive, Report 2017\/652 (2017). https:\/\/eprint.iacr.org\/2017\/652"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Boyle, E., et al.: Correlated pseudorandomness from expand-accumulate codes. In: CRYPTO (2022)","DOI":"10.1007\/978-3-031-15979-4_21"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Boyle, E., et al.: Efficient two-round OT extension and silent non-interactive secure computation (2019)","DOI":"10.1145\/3319535.3354255"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators: silent OT extension and more. Crypto (2019)","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"19_CR13","unstructured":"Carlos, A.M., et al.: Hamming quasi-cyclic (hqc) (2020)"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Couteau, G., Rindal, P., Raghuraman, S.: Silver: Silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes. In: CRYPTO (2021)","DOI":"10.1007\/978-3-030-84252-9_17"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Debris-Alazard, T., Tillich, J.P.: Statistical decoding (2017)","DOI":"10.1109\/ISIT.2017.8006839"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Fossorier, M.P., Kobara, K., Imai, H.: Modeling bit flipping decoding based on nonorthogonal check sums with application to iterative decoding attack of McEliece cryptosystem (2006)","DOI":"10.1109\/TIT.2006.887515"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V.: The parity problem in the presence of noise, decoding random linear codes, and the subset sum problem (2005)","DOI":"10.1007\/11538462_32"},{"key":"19_CR18","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic (1978)"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Prange, E.: The use of information sets in decoding cyclic codes (1962)","DOI":"10.1109\/TIT.1962.1057777"},{"key":"19_CR20","unstructured":"Stern, J.: A method for finding codewords of small weight (1988)"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Vardy, A.: The intractability of computing the minimum distance of a code (1997)","DOI":"10.1109\/18.641542"},{"key":"19_CR22","unstructured":"Zichron, L.: Locally computable arithmetic pseudorandom generators (2017)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38551-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T22:03:40Z","timestamp":1753567420000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38551-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031385506","9783031385513"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38551-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"479","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"124","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}