{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:51Z","timestamp":1750306371023,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,5,30]],"date-time":"2016-05-30T00:00:00Z","timestamp":1464566400000},"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,5,30]]},"DOI":"10.1145\/2898420.2898423","type":"proceedings-article","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T22:58:31Z","timestamp":1464130711000},"page":"31-38","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Refining Identification Scheme based on Isomorphism of Polynomials with Two Secrets"],"prefix":"10.1145","author":[{"given":"Bagus","family":"Santoso","sequence":"first","affiliation":[{"name":"The University of Electro-Communications, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,5,30]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"December","author":"Babai L.","year":"2015","unstructured":"L. Babai . Graph Isomorphism in Quasipolynomial Time. ArXiv e-prints , December 2015 . L. Babai. Graph Isomorphism in Quasipolynomial Time. ArXiv e-prints, December 2015."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2015.04.001"},{"key":"e_1_3_2_1_3_1","unstructured":"C. Bouillaguet J. Faug\u00e8re P.-A. Fouque and L. Perret. Isomorphism of polynomials: New results.  C. Bouillaguet J. Faug\u00e8re P.-A. Fouque and L. Perret. Isomorphism of polynomials: New results."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_13"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_3"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-006-0224-0"},{"key":"e_1_3_2_1_7_1","unstructured":"Kona I Co. Ltd. KONA I Brochure (2016). http:\/\/www.konai.com\/common\/download.php?fullpath=board\/5\/27_0&filename=KONAI_2015brochure_R4_Eng_1015.pdf 2016.  Kona I Co. Ltd. KONA I Brochure (2016). http:\/\/www.konai.com\/common\/download.php?fullpath=board\/5\/27_0&filename=KONAI_2015brochure_R4_Eng_1015.pdf 2016."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-42033-7_7"},{"key":"e_1_3_2_1_9_1","series-title":"LNCS","first-page":"33","volume-title":"EUROCRYPT '96","author":"Patarin J.","year":"1996","unstructured":"J. Patarin . Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP) : Two New Families of Asymmetric Algorithms . In EUROCRYPT '96 , volume 1070 of LNCS , pages 33 -- 48 , May 1996 . J. Patarin. Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms. In EUROCRYPT '96, volume 1070 of LNCS, pages 33--48, May 1996."},{"key":"e_1_3_2_1_10_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/BFb0054126","volume-title":"EUROCRYPT '98","author":"Patarin J.","year":"1998","unstructured":"J. Patarin , L. Goubin , and N. Courtois . Improved algorithms for isomorphisms of polynomials . In EUROCRYPT '98 , volume 1403 of LNCS , pages 184 -- 200 , 1998 . J. Patarin, L. Goubin, and N. Courtois. Improved algorithms for isomorphisms of polynomials. In EUROCRYPT '98, volume 1403 of LNCS, pages 184--200, 1998."},{"key":"e_1_3_2_1_11_1","volume-title":"On the computational complexity of some equivalence problems of polynomial systems of equations over finite fields. Electronic Colloquium on Computational Complexity (ECCC), (116)","author":"Perret L.","year":"2004","unstructured":"L. Perret . On the computational complexity of some equivalence problems of polynomial systems of equations over finite fields. Electronic Colloquium on Computational Complexity (ECCC), (116) , 2004 . L. Perret. On the computational complexity of some equivalence problems of polynomial systems of equations over finite fields. Electronic Colloquium on Computational Complexity (ECCC), (116), 2004."},{"key":"e_1_3_2_1_12_1","volume-title":"Solving the \"isomorphism of polynomials with two secrets\" problem for all pairs of quadratic forms. CoRR, abs\/1406.3163","author":"Pl\u00fbt J.","year":"2014","unstructured":"J. Pl\u00fbt , P. Fouque , and G. Macario-Rat . Solving the \"isomorphism of polynomials with two secrets\" problem for all pairs of quadratic forms. CoRR, abs\/1406.3163 , 2014 . J. Pl\u00fbt, P. Fouque, and G. Macario-Rat. Solving the \"isomorphism of polynomials with two secrets\" problem for all pairs of quadratic forms. CoRR, abs\/1406.3163, 2014."},{"key":"e_1_3_2_1_13_1","volume-title":"Texas Instruments","author":"Sattlegger K.","year":"2014","unstructured":"K. Sattlegger and U. Denk . Navigating your way through the RFID jungle. Technical report , Texas Instruments , February 2014 . K. Sattlegger and U. Denk. Navigating your way through the RFID jungle. Technical report, Texas Instruments, February 2014."},{"key":"e_1_3_2_1_14_1","volume-title":"August","author":"Alliance Smart Card","year":"2005","unstructured":"Smart Card Alliance . Giesecke & Devrient and Samsung first to introduce 512 kB SIM-platform. http:\/\/www.smartcardalliance.org\/giesecke-devrient-and-samsung-first-to-introduce-512-kb-sim-platform\/ , August 2005 . Smart Card Alliance. Giesecke & Devrient and Samsung first to introduce 512 kB SIM-platform. http:\/\/www.smartcardalliance.org\/giesecke-devrient-and-samsung-first-to-introduce-512-kb-sim-platform\/, August 2005."}],"event":{"name":"ASIA CCS '16: ACM Asia Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Xi'an China","acronym":"ASIA CCS '16"},"container-title":["Proceedings of the 3rd ACM International Workshop on ASIA Public-Key Cryptography"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2898420.2898423","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2898420.2898423","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:56:30Z","timestamp":1750222590000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2898420.2898423"}},"subtitle":["a New Theoretical and Practical Analysis"],"short-title":[],"issued":{"date-parts":[[2016,5,30]]},"references-count":14,"alternative-id":["10.1145\/2898420.2898423","10.1145\/2898420"],"URL":"https:\/\/doi.org\/10.1145\/2898420.2898423","relation":{},"subject":[],"published":{"date-parts":[[2016,5,30]]},"assertion":[{"value":"2016-05-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}