{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:03Z","timestamp":1750220643246,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T00:00:00Z","timestamp":1603152000000},"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":[[2020,10,20]]},"DOI":"10.1145\/3424978.3425018","type":"proceedings-article","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T19:06:17Z","timestamp":1602788777000},"page":"1-5","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Lattice-based Concurrent Signatures in the Standard Model"],"prefix":"10.1145","author":[{"given":"Baohong","family":"Li","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Xi'an Jiaotong University, Xi'an, China"}]},{"given":"Hongping","family":"Zhao","sequence":"additional","affiliation":[{"name":"518th Hosp. of PLA. Xi'an, China"}]},{"given":"Jiacheng","family":"Li","sequence":"additional","affiliation":[{"name":"Development Department, Xi'an Jiaotong University, JUMP Network Technology Co., Ltd, Xi'an, China"}]}],"member":"320","published-online":{"date-parts":[[2020,10,20]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Jakobsson M and MacKenzie P","author":"Garay J","year":"1999","unstructured":"Garay J , Jakobsson M and MacKenzie P ( 1999 ). Abuse-free optimistic contract signing. In Advances in Cryptology-CRYPTO 1999 LNCS 1666 Springer-Verlag , 449--466. Garay J, Jakobsson M and MacKenzie P (1999). Abuse-free optimistic contract signing. In Advances in Cryptology-CRYPTO 1999 LNCS 1666 Springer-Verlag, 449--466."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/511446.511497"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1007\/BFb0055475"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1145\/319709.319726"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1007\/3-540-44598-6_15"},{"key":"e_1_3_2_1_6_1","volume-title":"Shoup V and Waidner M","author":"Asokan N","year":"1998","unstructured":"Asokan N , Shoup V and Waidner M ( 1998 ). Optimistic fair exchange of signatures, In Advances in Cryptology-EUROCRYPT 1998 LNCS 1403 Springer-Verlag , 591--606. Asokan N, Shoup V and Waidner M (1998). Optimistic fair exchange of signatures, In Advances in Cryptology-EUROCRYPT 1998 LNCS 1403 Springer-Verlag, 591--606."},{"key":"e_1_3_2_1_7_1","volume-title":"Kudla C and Paterson K","author":"Chen L","year":"2004","unstructured":"Chen L , Kudla C and Paterson K ( 2004 ). Concurrent signatures. In Advances in Cryptology-EUROCRYPT 2004 LNCS 3027 Springer-Verlag , 287--305. Chen L, Kudla C and Paterson K (2004). Concurrent signatures. In Advances in Cryptology-EUROCRYPT 2004 LNCS 3027 Springer-Verlag, 287--305."},{"key":"e_1_3_2_1_8_1","volume-title":"Mu Y and Zhang F","author":"Susilo W","year":"2004","unstructured":"Susilo W , Mu Y and Zhang F ( 2004 ). Perfect concurrent signature schemes. In Information and Communications Security (ICICS 2004) LNCS 3269 SpringerVerlag , 14--26. Susilo W, Mu Y and Zhang F (2004). Perfect concurrent signature schemes. In Information and Communications Security (ICICS 2004) LNCS 3269 SpringerVerlag, 14--26."},{"key":"e_1_3_2_1_9_1","volume-title":"Bao F and Zhou J","author":"Wang G","year":"2006","unstructured":"Wang G , Bao F and Zhou J ( 2006 ). The fairness of perfect concurrent signatures. In Information and Communications Security (ICICS 2006) LNCS 4307 Springer-Verlag , 435--451. Wang G, Bao F and Zhou J (2006). The fairness of perfect concurrent signatures. In Information and Communications Security (ICICS 2006) LNCS 4307 Springer-Verlag, 435--451."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1007\/11602897_17"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1007\/11836810_10"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1007\/978-3-642-24316-5_13"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1007\/11602897_16"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1016\/j.tcs.2014.09.044"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1137\/S0097539795293172"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1109\/INCoS.2013.105"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1016\/j.ipl.2016.02.007"},{"key":"e_1_3_2_1_18_1","volume-title":"Salmasizadeh M and Aref M","author":"Asaar M","year":"2016","unstructured":"Asaar M , Salmasizadeh M and Aref M ( 2016 ). A provably secure code-based concurrent signature scheme. Http :\/\/eprint.iacr.org\/2016\/450. Asaar M, Salmasizadeh M and Aref M (2016). A provably secure code-based concurrent signature scheme. Http:\/\/eprint.iacr.org\/2016\/450."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1145\/237814.237838"},{"key":"e_1_3_2_1_20_1","volume-title":"Lattice-based Cryptography. Post-Quantum Cryptography. Berlin\/Heidelberg: Springer, 147--191","author":"Micciancio D","year":"2009","unstructured":"Micciancio D and Regev O ( 2009 ). Lattice-based Cryptography. Post-Quantum Cryptography. Berlin\/Heidelberg: Springer, 147--191 . Micciancio D and Regev O (2009). Lattice-based Cryptography. Post-Quantum Cryptography. Berlin\/Heidelberg: Springer, 147--191."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1137\/S0097539705447360"},{"key":"e_1_3_2_1_22_1","volume-title":"Lattice Mixing and Vanishing Trapdoors-a Framework for Fully Secure Short Signatures and More. In PKC 2010 LNCS 6056 Springer","author":"Boyen X","year":"2010","unstructured":"Boyen X ( 2010 ). Lattice Mixing and Vanishing Trapdoors-a Framework for Fully Secure Short Signatures and More. In PKC 2010 LNCS 6056 Springer , Heidelberg, 499--517. Boyen X (2010). Lattice Mixing and Vanishing Trapdoors-a Framework for Fully Secure Short Signatures and More. In PKC 2010 LNCS 6056 Springer, Heidelberg, 499--517."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1007\/s00145-011-9105-2"},{"key":"e_1_3_2_1_24_1","volume-title":"Symposium on Theoretical Aspects of Computer Science (STACS","author":"Alwen J","year":"2009","unstructured":"Alwen J and Peikert C ( 2009 ). Generating shorter bases for hard random lattices . In Symposium on Theoretical Aspects of Computer Science (STACS 2009), 75--86. Alwen J and Peikert C (2009). Generating shorter bases for hard random lattices. In Symposium on Theoretical Aspects of Computer Science (STACS 2009), 75--86."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1145\/1374376.1374407"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1007\/978-3-642-13190-5_28"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1145\/1060590.1060603"}],"event":{"acronym":"CSAE 2020","name":"CSAE 2020: The 4th International Conference on Computer Science and Application Engineering","location":"Sanya China"},"container-title":["Proceedings of the 4th International Conference on Computer Science and Application Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3424978.3425018","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3424978.3425018","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:10Z","timestamp":1750197730000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3424978.3425018"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,20]]},"references-count":27,"alternative-id":["10.1145\/3424978.3425018","10.1145\/3424978"],"URL":"https:\/\/doi.org\/10.1145\/3424978.3425018","relation":{},"subject":[],"published":{"date-parts":[[2020,10,20]]},"assertion":[{"value":"2020-10-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}