{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T22:08:12Z","timestamp":1755036492024,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T00:00:00Z","timestamp":1660262400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T00:00:00Z","timestamp":1660262400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s10623-022-01075-7","type":"journal-article","created":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T16:02:52Z","timestamp":1660320172000},"page":"3011-3044","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A gapless code-based hash proof system based on RQC and its applications"],"prefix":"10.1007","volume":"90","author":[{"given":"Slim","family":"Bettaieb","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lo\u00efc","family":"Bidoux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Blazy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6065-6373","authenticated-orcid":false,"given":"Yann","family":"Connan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Gaborit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,12]]},"reference":[{"key":"1075_CR1","first-page":"69","volume-title":"EUROCRYPT 2015 Part II, vol.\u00a09057 of LNCS","author":"M Abdalla","year":"2015","unstructured":"Abdalla M., Benhamouda F., Pointcheval D.: Disjunctions for hash proof systems: New constructions and applications. In: Oswald E., Fischlin M. (eds.) EUROCRYPT 2015 Part II, vol.\u00a09057 of LNCS, pp. 69\u2013100. Springer, Heidelberg (2015)."},{"key":"1075_CR2","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/978-3-642-03356-8_39","volume-title":"CRYPTO 2009, vol.\u00a05677 of LNCS","author":"M Abdalla","year":"2009","unstructured":"Abdalla M., Chevalier C., Pointcheval D.: Smooth projective hashing for conditionally extractable commitments. In: Halevi S. (ed.) CRYPTO 2009, vol.\u00a05677 of LNCS, pp. 671\u2013689. Springer, Heidelberg (2009)."},{"key":"1075_CR3","unstructured":"Aguilar-Melchor C., Aragon N., Bettaieb S., Bidoux L., Blazy O., Bos J., Deneuville J.-C., Gaborit P., Persichetti E., Robert J.-M., V\u00e9ron P., Z\u00e9mor G. Hamming quasi-cyclic (HQC)."},{"key":"1075_CR4","unstructured":"Aguilar-Melchor C., Aragon N., Bettaieb S., Bidoux L., Blazy O., Couvreur A., Deneuville J.-C., Gaborit P., Hauteville A., Z\u00e9mor G.: Rank quasi-cyclic (RQC)"},{"issue":"5","key":"1075_CR5","doi-asserted-by":"publisher","first-page":"3927","DOI":"10.1109\/TIT.2018.2804444","volume":"64","author":"C Aguilar-Melchor","year":"2018","unstructured":"Aguilar-Melchor C., Blazy O., Deneuville J.-C., Gaborit P., Z\u00e9mor G.: Efficient encryption from random quasi-cyclic codes. IEEE Trans. Inf. Theory 64(5), 3927\u20133943 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1075_CR6","doi-asserted-by":"crossref","unstructured":"Alam\u00e9lou Q., Blazy O., Cauchie S., Gaborit P.: A practical group signature scheme based on rank metric. In International Workshop on the Arithmetic of Finite Fields, pp.\u00a0258\u2013275. Springer (2016)","DOI":"10.1007\/978-3-319-55227-9_18"},{"key":"1075_CR7","unstructured":"Alekhnovich, M.: More on average case vs approximation complexity. In 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. (2003), IEEE, pp.\u00a0298\u2013307."},{"key":"1075_CR8","doi-asserted-by":"crossref","unstructured":"Aragon, N., Gaborit, P., Hauteville, A., Tillich, J.-P.: A new algorithm for solving the rank syndrome decoding problem. In 2018 IEEE International Symposium on Information Theory (ISIT) (2018), IEEE, pp.\u00a02421\u20132425.","DOI":"10.1109\/ISIT.2018.8437464"},{"key":"1075_CR9","doi-asserted-by":"crossref","unstructured":"Bardet, M., Briaud, P., Bros, M., Gaborit, P., Neiger, V., Ruatta, O., Tillich, J.-P.: An algebraic attack on rank metric code-based cryptosystems. In Annual International Conference on the Theory and Applications of Cryptographic Techniques (2020), Springer, pp.\u00a064\u201393.","DOI":"10.1007\/978-3-030-45727-3_3"},{"key":"1075_CR10","doi-asserted-by":"crossref","unstructured":"Bardet, M., Bros, M., Cabarcas, D., Gaborit, P., Perlner, R., Smith-Tone, D., Tillich, J.-P., Verbel, J.: Improvements of algebraic attacks for solving the rank decoding and minrank problems. In International Conference on the Theory and Application of Cryptology and Information Security (2020), Springer, pp.\u00a0507\u2013536.","DOI":"10.1007\/978-3-030-64837-4_17"},{"key":"1075_CR11","doi-asserted-by":"crossref","unstructured":"Bellare, M., Pointcheval, D., Rogaway, P.: Authenticated key exchange secure against dictionary attacks. In EUROCRYPT\u00a02000 (May 2000), B.\u00a0Preneel, Ed., vol.\u00a01807 of LNCS, Springer, Heidelberg, pp.\u00a0139\u2013155.","DOI":"10.1007\/3-540-45539-6_11"},{"key":"1075_CR12","unstructured":"Bellovin, S.\u00a0M., and Merritt, M.: Encrypted key exchange: Password-based protocols secure against dictionary attacks. In 1992 IEEE Symposium on Security and Privacy (May 1992), IEEE Computer Society Press, pp.\u00a072\u201384."},{"key":"1075_CR13","unstructured":"Benhamouda, F.: Diverse modules and zero-knowledge. PhD thesis, PSL Research University - ENS, July 2016."},{"key":"1075_CR14","doi-asserted-by":"crossref","unstructured":"Benhamouda, F., Blazy, O., Chevalier, C., Pointcheval, D., Vergnaud, D.: New techniques for SPHFs and efficient one-round PAKE protocols. In CRYPTO\u00a02013, Part\u00a0I (Aug. 2013), R.\u00a0Canetti and J.\u00a0A. Garay, Eds., vol.\u00a08042 of LNCS, Springer, Heidelberg, pp.\u00a0449\u2013475.","DOI":"10.1007\/978-3-642-40041-4_25"},{"key":"1075_CR15","doi-asserted-by":"crossref","unstructured":"Benhamouda, F., Blazy, O., Ducas, L., and Quach, W.: Hash proof systems over lattices revisited. In PKC\u00a02018, Part\u00a0II (Mar. 2018), M.\u00a0Abdalla and R.\u00a0Dahab, Eds., vol.\u00a010770 of LNCS, Springer, Heidelberg, pp.\u00a0644\u2013674.","DOI":"10.1007\/978-3-319-76581-5_22"},{"key":"1075_CR16","doi-asserted-by":"crossref","unstructured":"Berlekamp, E., McEliece, R., Van\u00a0Tilborg, H.: On the inherent intractability of certain coding problems (corresp.). IEEE Transactions on Information Theory 24, 3 (1978), 384\u2013386.","DOI":"10.1109\/TIT.1978.1055873"},{"key":"1075_CR17","doi-asserted-by":"crossref","unstructured":"Blazy, O., Chevalier, C.: Generic construction of UC-secure oblivious transfer. In ACNS 15 (June 2015), T.\u00a0Malkin, V.\u00a0Kolesnikov, A.\u00a0B. Lewko, and M.\u00a0Polychronakis, Eds., vol.\u00a09092 of LNCS, Springer, Heidelberg, pp.\u00a065\u201386.","DOI":"10.1007\/978-3-319-28166-7_4"},{"key":"1075_CR18","doi-asserted-by":"crossref","unstructured":"Blazy, O., Chevalier, C., Germouty, P.: Adaptive oblivious transfer and generalization. In ASIACRYPT\u00a02016, Part\u00a0II (Dec. 2016), J.\u00a0H. Cheon and T.\u00a0Takagi, Eds., vol.\u00a010032 of LNCS, Springer, Heidelberg, pp.\u00a0217\u2013247.","DOI":"10.1007\/978-3-662-53890-6_8"},{"key":"1075_CR19","doi-asserted-by":"crossref","unstructured":"Blazy, O., Chevalier, C., Vu, Q.\u00a0H.: Post-quantum UC-secure oblivious transfer in the standard model with adaptive corruptions. In Proceedings of the 14th International Conference on Availability, Reliability and Security (2019), pp.\u00a01\u20136.","DOI":"10.1145\/3339252.3339280"},{"key":"1075_CR20","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols. In 42nd FOCS (Oct. 2001), IEEE Computer Society Press, pp.\u00a0136\u2013145.","DOI":"10.1109\/SFCS.2001.959888"},{"key":"1075_CR21","unstructured":"Chen, K.: A new identification algorithm. In Cryptography: Policy and Algorithms (Berlin, Heidelberg, 1996), E.\u00a0Dawson and J.\u00a0Goli\u0107, Eds., Springer Berlin Heidelberg, pp.\u00a0244\u2013249."},{"key":"1075_CR22","doi-asserted-by":"crossref","unstructured":"Cramer, R., Shoup, V.: Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In EUROCRYPT\u00a02002 (Apr.\u00a0\/\u00a0May 2002), L.\u00a0R. Knudsen, Ed., vol.\u00a02332 of LNCS, Springer, Heidelberg, pp.\u00a045\u201364.","DOI":"10.1007\/3-540-46035-7_4"},{"key":"1075_CR23","doi-asserted-by":"crossref","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In CRYPTO\u201986 (Aug. 1987), A.\u00a0M. Odlyzko, Ed., vol.\u00a0263 of LNCS, Springer, Heidelberg, pp.\u00a0186\u2013194.","DOI":"10.1007\/3-540-47721-7_12"},{"issue":"1","key":"1075_CR24","first-page":"3","volume":"21","author":"EM Gabidulin","year":"1985","unstructured":"Gabidulin E.M.: Theory of codes with maximum rank distance. Problemy Peredachi Informatsii 21(1), 3\u201316 (1985).","journal-title":"Problemy Peredachi Informatsii"},{"key":"1075_CR25","unstructured":"Gaborit, P., Murat, G., Ruatta, O., Z\u00e9mor, G.: Low rank parity check codes and their application to cryptography. In Proceedings of the Workshop on Coding and Cryptography WCC (2013), vol.\u00a02013."},{"issue":"2","key":"1075_CR26","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1109\/TIT.2015.2511786","volume":"62","author":"P Gaborit","year":"2015","unstructured":"Gaborit P., Ruatta O., Schrek J.: On the complexity of the rank syndrome decoding problem. IEEE Transactions on Information Theory 62(2), 1006\u20131019 (2015).","journal-title":"IEEE Transactions on Information Theory"},{"key":"1075_CR27","doi-asserted-by":"crossref","unstructured":"Gaborit, P., Schrek, J., Z\u00e9mor, G.: Full cryptanalysis of the Chen identification protocol. In International Workshop on Post-Quantum Cryptography (2011), Springer, pp.\u00a035\u201350.","DOI":"10.1007\/978-3-642-25405-5_3"},{"issue":"12","key":"1075_CR28","doi-asserted-by":"publisher","first-page":"7245","DOI":"10.1109\/TIT.2016.2616127","volume":"62","author":"P Gaborit","year":"2016","unstructured":"Gaborit P., Z\u00e9mor G.: On the hardness of the decoding and the minimum distance problems for rank codes. IEEE Transactions on Information Theory 62(12), 7245\u20137252 (2016).","journal-title":"IEEE Transactions on Information Theory"},{"key":"1075_CR29","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Sahai, A., Waters, B.: Witness encryption and its applications. In 45th ACM STOC (June 2013), D.\u00a0Boneh, T.\u00a0Roughgarden, and J.\u00a0Feigenbaum, Eds., ACM Press, pp.\u00a0467\u2013476.","DOI":"10.1145\/2488608.2488667"},{"issue":"2","key":"1075_CR30","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/1151414.1151418","volume":"9","author":"R Gennaro","year":"2006","unstructured":"Gennaro R., Lindell Y.: A framework for password-based authenticated key exchange. ACM Transactions on Information and System Security 9(2), 181\u2013234 (2006).","journal-title":"ACM Transactions on Information and System Security"},{"issue":"1","key":"1075_CR31","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/s00145-010-9092-8","volume":"25","author":"S Halevi","year":"2012","unstructured":"Halevi S., Kalai Y.T.: Smooth projective hashing and two-message oblivious transfer. Journal of Cryptology 25(1), 158\u2013193 (2012).","journal-title":"Journal of Cryptology"},{"key":"1075_CR32","doi-asserted-by":"crossref","unstructured":"Hofheinz, D., H\u00f6velmanns, K., Kiltz, E.: A modular analysis of the Fujisaki-Okamoto transformation. In TCC\u00a02017, Part\u00a0I (Nov. 2017), Y.\u00a0Kalai and L.\u00a0Reyzin, Eds., vol.\u00a010677 of LNCS, Springer, Heidelberg, pp.\u00a0341\u2013371.","DOI":"10.1007\/978-3-319-70500-2_12"},{"key":"1075_CR33","doi-asserted-by":"crossref","unstructured":"Kalai, Y.\u00a0T.: Smooth projective hashing and two-message oblivious transfer. In EUROCRYPT\u00a02005 (May 2005), R.\u00a0Cramer, Ed., vol.\u00a03494 of LNCS, Springer, Heidelberg, pp.\u00a078\u201395.","DOI":"10.1007\/11426639_5"},{"key":"1075_CR34","doi-asserted-by":"crossref","unstructured":"Katz, J., Vaikuntanathan, V.: Round-optimal password-based authenticated key exchange. In TCC\u00a02011 (Mar. 2011), Y.\u00a0Ishai, Ed., vol.\u00a06597 of LNCS, Springer, Heidelberg, pp.\u00a0293\u2013310.","DOI":"10.1007\/978-3-642-19571-6_18"},{"key":"1075_CR35","doi-asserted-by":"crossref","unstructured":"Katz, J., Vaikuntanathan, V.: Smooth projective hashing and password-based authenticated key exchange from lattices. In ASIACRYPT\u00a02009 (Dec. 2009), M.\u00a0Matsui, Ed., vol.\u00a05912 of LNCS, Springer, Heidelberg, pp.\u00a0636\u2013652.","DOI":"10.1007\/978-3-642-10366-7_37"},{"key":"1075_CR36","doi-asserted-by":"crossref","unstructured":"Kawachi, A., Tanaka, K., Xagawa, K.: Concurrently secure identification schemes based on the worst-case hardness of lattice problems. In International Conference on the Theory and Application of Cryptology and Information Security (2008), Springer, pp.\u00a0372\u2013389.","DOI":"10.1007\/978-3-540-89255-7_23"},{"key":"1075_CR37","doi-asserted-by":"crossref","unstructured":"Ling, S., Nguyen, K., Stehl\u00e9, D., Wang, H.: Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications. In PKC\u00a02013 (Feb.\u00a0\/\u00a0Mar. 2013), K.\u00a0Kurosawa and G.\u00a0Hanaoka, Eds., vol.\u00a07778 of LNCS, Springer, Heidelberg, pp.\u00a0107\u2013124.","DOI":"10.1007\/978-3-642-36362-7_8"},{"key":"1075_CR38","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In 22nd ACM STOC (May 1990), ACM Press, pp.\u00a0427\u2013437.","DOI":"10.1145\/100216.100273"},{"issue":"3","key":"1075_CR39","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1090\/S0002-9947-1933-1501703-0","volume":"35","author":"O Ore","year":"1933","unstructured":"Ore O.: On a special class of polynomials. Transactions of the American Mathematical Society 35(3), 559\u2013584 (1933).","journal-title":"Transactions of the American Mathematical Society"},{"key":"1075_CR40","doi-asserted-by":"crossref","unstructured":"Persichetti, E.: Code-based public-key encryption resistant to key leakage. In International Conference on Availability, Reliability, and Security (2013), Springer, pp.\u00a044\u201354.","DOI":"10.1007\/978-3-642-40588-4_4"},{"key":"1075_CR41","doi-asserted-by":"crossref","unstructured":"Pointcheval, D., Stern, J.: Security proofs for signature schemes. In International Conference on the Theory and Applications of Cryptographic Techniques (1996), Springer, pp.\u00a0387\u2013398.","DOI":"10.1007\/3-540-68339-9_33"},{"issue":"6","key":"1075_CR42","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 Transactions on Information Theory 42(6), 1757\u20131768 (1996).","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"1075_CR43","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s002000050053","volume":"8","author":"P V\u00e9ron","year":"1997","unstructured":"V\u00e9ron P.: Improved identification schemes based on error-correcting codes. Applicable Algebra in Engineering, Communication and Computing 8(1), 57\u201369 (1997).","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"1075_CR44","doi-asserted-by":"crossref","unstructured":"Zhang, J., Yu, Y.: Two-round PAKE from approximate SPH and instantiations from lattices. In ASIACRYPT\u00a02017, Part\u00a0III (Dec. 2017), T.\u00a0Takagi and T.\u00a0Peyrin, Eds., vol.\u00a010626 of LNCS, Springer, Heidelberg, pp.\u00a037\u201367.","DOI":"10.1007\/978-3-319-70700-6_2"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01075-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01075-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01075-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,11]],"date-time":"2022-11-11T08:09:05Z","timestamp":1668154145000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01075-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,12]]},"references-count":44,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["1075"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01075-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2022,8,12]]},"assertion":[{"value":"14 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}