{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T08:26:50Z","timestamp":1726043210233},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030302146"},{"type":"electronic","value":"9783030302153"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-30215-3_9","type":"book-chapter","created":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T23:02:43Z","timestamp":1567378963000},"page":"171-189","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Code-Based Zero Knowledge PRF Arguments"],"prefix":"10.1007","author":[{"given":"Carlo","family":"Brunetta","sequence":"first","affiliation":[]},{"given":"Bei","family":"Liang","sequence":"additional","affiliation":[]},{"given":"Aikaterini","family":"Mitrokotsa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,2]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-1-4757-0602-4_25","volume-title":"Advances in Cryptology","author":"Leonard M. Adleman","year":"1983","unstructured":"Adleman, L.M.: Implementing an electronic notary public. In: Advances in Cryptology (1983)"},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Aguilar, C., Gaborit, P., Schrek, J.: A new zero-knowledge code based identification scheme with reduced communication. In: 2011 IEEE Information Theory Workshop (2011). https:\/\/doi.org\/10.1109\/ITW.2011.6089577","DOI":"10.1109\/ITW.2011.6089577"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/11554868_6","volume-title":"Progress in Cryptology \u2013 Mycrypt 2005","author":"D Augot","year":"2005","unstructured":"Augot, D., Finiasz, M., Sendrier, N.: A family of fast syndrome based cryptographic hash functions. In: Dawson, E., Vaudenay, S. (eds.) Mycrypt 2005. LNCS, vol. 3715, pp. 64\u201383. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11554868_6"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/978-3-642-29011-4_42","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A Banerjee","year":"2012","unstructured":"Banerjee, A., Peikert, C., Rosen, A.: Pseudorandom functions and lattices. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 719\u2013737. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_42"},{"issue":"3","key":"9_CR5","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E Berlekamp","year":"1978","unstructured":"Berlekamp, E., McEliece, R., Van Tilborg, H.: On the inherent intractability of certain coding problems (Corresp.). IEEE Transact. Inf. Theory 24(3), 384\u2013386 (1978)","journal-title":"IEEE Transact. Inf. Theory"},{"issue":"4","key":"9_CR6","first-page":"57","volume":"8","author":"C Brunetta","year":"2018","unstructured":"Brunetta, C., Liang, B., Mitrokotsa, A.: Lattice-based simulatable VRFs: challenges and future directions. J. Internet Serv. Inf. Secur. (JISIS) 8(4), 57\u201369 (2018)","journal-title":"J. Internet Serv. Inf. Secur. (JISIS)"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Cayrel, P.L., Gaborit, P., Girault, M.: Identity-based identification and signature schemes using correcting codes. In: WCC, vol. 2007 (2007)","DOI":"10.1109\/ISIT.2007.4557225"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Cayrel, P.L., V\u00e9ron, P., El Yousfi Alaoui, S.M.: A zero-knowledge identification scheme based on the q-ary syndrome decoding problem. In: Selected Areas in Cryptography (2011)","DOI":"10.1007\/978-3-642-19574-7_12"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BFb0053430","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201994","author":"F Chabaud","year":"1995","unstructured":"Chabaud, F.: On the security of some cryptosystems based on error-correcting codes. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 131\u2013139. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0053430"},{"key":"9_CR10","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-642-23141-4_14","volume-title":"Information Security and Assurance","author":"SM Yousfi Alaoui El","year":"2011","unstructured":"El Yousfi Alaoui, S.M., Cayrel, P.-L., Mohammed, M.: Improved identity-based identification and signature schemes using quasi-dyadic Goppa codes. In: Kim, T., Adeli, H., Robles, R.J., Balitanas, M. (eds.) ISA 2011. CCIS, vol. 200, pp. 146\u2013155. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23141-4_14"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-662-48797-6_12","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"MF Ezerman","year":"2015","unstructured":"Ezerman, M.F., Lee, H.T., Ling, S., Nguyen, K., Wang, H.: A provably secure group signature scheme from code-based assumptions. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 260\u2013285. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_12"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/3-540-68339-9_22","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"J-B Fischer","year":"1996","unstructured":"Fischer, J.-B., Stern, J.: An efficient pseudo-random generator provably as secure as syndrome decoding. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 245\u2013255. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_22"},{"key":"9_CR13","doi-asserted-by":"publisher","unstructured":"Gaborit, P., Lauradoux, C., Sendrier, N.: SYND: a fast code-based stream cipher with a security reduction. In: 2007 IEEE International Symposium on Information Theory, June 2007. https:\/\/doi.org\/10.1109\/ISIT.2007.4557224","DOI":"10.1109\/ISIT.2007.4557224"},{"issue":"3","key":"9_CR14","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1002\/j.1538-7305.1952.tb01393.x","volume":"31","author":"EN Gilbert","year":"1952","unstructured":"Gilbert, E.N.: A comparison of signalling alphabets. Bell Syst. Tech. J. 31(3), 504\u2013522 (1952). https:\/\/doi.org\/10.1002\/j.1538-7305.1952.tb01393.x","journal-title":"Bell Syst. Tech. J."},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: STOC 1989. ACM (1989). https:\/\/doi.org\/10.1145\/73007.73010","DOI":"10.1145\/73007.73010"},{"issue":"4","key":"9_CR16","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM 33(4), 792\u2013807 (1986). https:\/\/doi.org\/10.1145\/6490.6503","journal-title":"J. ACM"},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Hu, R., Morozov, K., Takagi, T.: Proof of plaintext knowledge for code-based public-key encryption revisited. In: ASIA CCS 2013 (2013). https:\/\/doi.org\/10.1145\/2484313.2484385","DOI":"10.1145\/2484313.2484385"},{"key":"9_CR18","doi-asserted-by":"crossref","DOI":"10.1201\/b17668","volume-title":"Introduction to Modern Cryptography","author":"J Katz","year":"2014","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography. CRC Press, Boca Raton (2014)"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/978-3-319-70700-6_11","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"B Libert","year":"2017","unstructured":"Libert, B., Ling, S., Nguyen, K., Wang, H.: Zero-knowledge arguments for lattice-based PRFs and applications to E-Cash. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10626, pp. 304\u2013335. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_11"},{"key":"9_CR20","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-23141-4_11","volume-title":"Information Security and Assurance","author":"M Meziani","year":"2011","unstructured":"Meziani, M., Cayrel, P.-L., El Yousfi Alaoui, S.M.: 2SC: An efficient code-based stream cipher. In: Kim, T., Adeli, H., Robles, R.J., Balitanas, M. (eds.) ISA 2011. CCIS, vol. 200, pp. 111\u2013122. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23141-4_11"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-31410-0_7","volume-title":"Progress in Cryptology - AFRICACRYPT 2012","author":"M Meziani","year":"2012","unstructured":"Meziani, M., Hoffmann, G., Cayrel, P.-L.: Improving the performance of the SYND stream cipher. In: Mitrokotsa, A., Vaudenay, S. (eds.) AFRICACRYPT 2012. LNCS, vol. 7374, pp. 99\u2013116. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31410-0_7"},{"issue":"6","key":"9_CR22","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.556672","volume":"42","author":"J Stern","year":"1996","unstructured":"Stern, J.: A new paradigm for public key identification. IEEE Transact. Inf. Theory 42(6), 1757\u20131768 (1996). https:\/\/doi.org\/10.1109\/18.556672","journal-title":"IEEE Transact. Inf. Theory"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/BFb0019850","volume-title":"Coding Theory and Applications","author":"J Stern","year":"1989","unstructured":"Stern, J.: A method for finding codewords of small weight. In: Cohen, G., Wolfmann, J. (eds.) Coding Theory 1988. LNCS, vol. 388, pp. 106\u2013113. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/BFb0019850"},{"key":"9_CR24","first-page":"739","volume":"117","author":"RR Varshamov","year":"1957","unstructured":"Varshamov, R.R.: Estimate of the number of signals in error correcting codes. Docklady Akad. Nauk, S.S.S.R. 117, 739\u2013741 (1957)","journal-title":"Docklady Akad. Nauk, S.S.S.R."},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-662-49896-5_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"Y Yu","year":"2016","unstructured":"Yu, Y., Steinberger, J.: Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 154\u2013183. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_6"}],"container-title":["Lecture Notes in Computer Science","Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30215-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,17]],"date-time":"2021-01-17T22:53:24Z","timestamp":1610924004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30215-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030302146","9783030302153"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30215-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"2 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New York City, NY","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isw2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/isc2019.cs.stonybrook.edu\/","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":"86","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":"23","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":"27% - 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":"5-7","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)"}}]}}