{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:13:01Z","timestamp":1750306381657,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,20]],"date-time":"2016-07-20T00:00:00Z","timestamp":1468972800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,20]]},"DOI":"10.1145\/2947626.2947649","type":"proceedings-article","created":{"date-parts":[[2016,7,12]],"date-time":"2016-07-12T12:11:05Z","timestamp":1468325465000},"page":"96-99","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Fuzzy Commitment Scheme based on Reed Solomon Codes"],"prefix":"10.1145","author":[{"given":"Sonam","family":"Chauhan","sequence":"first","affiliation":[{"name":"SRM University, Delhi-NCR, Sonepat, Haryana, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ajay","family":"Sharma","sequence":"additional","affiliation":[{"name":"SRM University, Delhi-NCR, Sonepat, Haryana, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Advances in Cryptology: A report on CRYPTO '81","author":"Blum M.","year":"1981","unstructured":"Blum M. Coin flipping by telephone . In Advances in Cryptology: A report on CRYPTO '81 , 1981 , 11--15. Blum M. Coin flipping by telephone. In Advances in Cryptology: A report on CRYPTO '81, 1981, 11--15."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/319709.319714"},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of CRYPTO '89","author":"Naor M.","year":"1989","unstructured":"Naor M. 1989 . Bit Commitment using pseudo-randomness . In Proceedings of CRYPTO '89 . Springer Verlag LNCS series. Naor M. 1989. Bit Commitment using pseudo-randomness. In Proceedings of CRYPTO '89. Springer Verlag LNCS series."},{"key":"e_1_3_2_1_4_1","volume-title":"Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In Advances in Cryptology- CRYPTO '91, 11th Annual International Cryptology Conference, 129--140","author":"Pedersen T.P.","year":"1991","unstructured":"Pedersen T.P. 1991 . Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In Advances in Cryptology- CRYPTO '91, 11th Annual International Cryptology Conference, 129--140 . Pedersen T.P. 1991. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In Advances in Cryptology- CRYPTO '91, 11th Annual International Cryptology Conference, 129--140."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/646761.706019"},{"key":"e_1_3_2_1_6_1","first-page":"306","article-title":"Efficient Cryptographic Protocols based on Noisy Channels. In Advances in Cryptology- EUROCRYPT '97","volume":"1233","author":"Cr\u00e9peau Claude","year":"1997","unstructured":"Cr\u00e9peau Claude 1997 . Efficient Cryptographic Protocols based on Noisy Channels. In Advances in Cryptology- EUROCRYPT '97 , LNCS 1233 (1997), 306 -- 317 . Cr\u00e9peau Claude 1997. Efficient Cryptographic Protocols based on Noisy Channels. In Advances in Cryptology- EUROCRYPT '97, LNCS 1233(1997), 306--317.","journal-title":"LNCS"},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of the IEEE International Conference on Advances in Computer Vision an Information Technology (India","author":"Al-Saggaf A.A.","year":"2007","unstructured":"Al-Saggaf A.A. , Acharya H.S. 2007 . A Fuzzy Commitment Scheme . In Proceedings of the IEEE International Conference on Advances in Computer Vision an Information Technology (India , November 2007), 28--30. Al-Saggaf A.A., Acharya H.S. 2007. A Fuzzy Commitment Scheme. In Proceedings of the IEEE International Conference on Advances in Computer Vision an Information Technology (India, November 2007), 28--30."},{"key":"e_1_3_2_1_8_1","volume-title":"Surveys in Mathematics & its Applications, 5","author":"Ojha D.B.","year":"2010","unstructured":"Ojha D.B. , and Sharma Ajay 201 0. A Fuzzy Commitment Scheme with McEliece's cipher . In Surveys in Mathematics & its Applications, 5 ( 2010 ), 73--82. Ojha D.B., and Sharma Ajay 2010. A Fuzzy Commitment Scheme with McEliece's cipher. In Surveys in Mathematics & its Applications, 5 (2010), 73--82."},{"key":"e_1_3_2_1_9_1","first-page":"22","article-title":"Polynomial Codes over certain Finite Fields","volume":"47","author":"Reed I.S.","year":"1958","unstructured":"Reed I.S. , Solomon G. 1958 . Polynomial Codes over certain Finite Fields . In M.I.T Lincoln Laboratory Group Report 47 , 22 -- 31 . Reed I.S., Solomon G. 1958. Polynomial Codes over certain Finite Fields. In M.I.T Lincoln Laboratory Group Report 47, 22--31.","journal-title":"M.I.T Lincoln Laboratory Group Report"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"e_1_3_2_1_11_1","volume-title":"International Symposium on Information Theory","author":"Berlekamp E.R.","year":"1967","unstructured":"Berlekamp E.R. 1967 . Nonbinary BCH decoding . In International Symposium on Information Theory , San Remo, Italy , 1967. Berlekamp E.R. 1967. Nonbinary BCH decoding. In International Symposium on Information Theory, San Remo, Italy, 1967."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1969.1054260"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Sugiyama Y. Kasahara M. Hirasawa S. and Namekawa T. 1975. A method for solving key equation for decoding goppa codes. In Information and Control 27 1(January 1975) 87--99.  Sugiyama Y. Kasahara M. Hirasawa S. and Namekawa T. 1975. A method for solving key equation for decoding goppa codes. In Information and Control 27 1(January 1975) 87--99.","DOI":"10.1016\/S0019-9958(75)90090-X"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.1987.1093590"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/646760.705870"},{"volume-title":"Proceedings of CRYPTO '92","author":"Naor M.","key":"e_1_3_2_1_16_1","unstructured":"Naor M. , Ostrovsky R. , Venkatesan R. and Yung M . 1993. Perfect zero-knowledge arguments for NP can be based on general complexity assumptions . In Proceedings of CRYPTO '92 , LNCS (740), 196--214. Naor M., Ostrovsky R., Venkatesan R. and Yung M. 1993. Perfect zero-knowledge arguments for NP can be based on general complexity assumptions. In Proceedings of CRYPTO '92, LNCS (740), 196--214."}],"event":{"name":"SIN '16: 9th International Conference on Security of Information and Networks","acronym":"SIN '16","location":"Newark NJ USA"},"container-title":["Proceedings of the 9th International Conference on Security of Information and Networks"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2947626.2947649","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2947626.2947649","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:02Z","timestamp":1750223222000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2947626.2947649"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,20]]},"references-count":16,"alternative-id":["10.1145\/2947626.2947649","10.1145\/2947626"],"URL":"https:\/\/doi.org\/10.1145\/2947626.2947649","relation":{},"subject":[],"published":{"date-parts":[[2016,7,20]]},"assertion":[{"value":"2016-07-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}