{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T06:42:40Z","timestamp":1710398560805},"reference-count":25,"publisher":"Vilnius University Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.15388\/20-infor415","type":"journal-article","created":{"date-parts":[[2020,5,6]],"date-time":"2020-05-06T09:52:43Z","timestamp":1588758763000},"page":"277-298","source":"Crossref","is-referenced-by-count":4,"title":["Authenticated Key Agreement Protocol Based on Provable Secure Cryptographic Functions"],"prefix":"10.15388","author":[{"given":"Ausrys","family":"Kilciauskas","sequence":"first","affiliation":[]},{"given":"Gintaras","family":"Butkus","sequence":"additional","affiliation":[]},{"given":"Eligijus","family":"Sakalauskas","sequence":"additional","affiliation":[]}],"member":"6097","published-online":{"date-parts":[[2020,5,6]]},"reference":[{"key":"2020061109543243113_j_infor415_ref_001","first-page":"62","volume-title":"ACM CCS 93: 1st Conference on Computer and Communications Security","year":"1993"},{"key":"2020061109543243113_j_infor415_ref_002","first-page":"10","volume-title":"Advances in Cryptology EUROCRYPT\u201996","volume":"1070","year":"1996"},{"key":"2020061109543243113_j_infor415_ref_003","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/BFb0054851","volume-title":"Proceedings of the Third Algorithmic Number Theory Symposium","volume":"1423","year":"1998"},{"key":"2020061109543243113_j_infor415_ref_004"},{"key":"2020061109543243113_j_infor415_ref_005","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1109\/MSP.2009.12","article-title":"Man-in-the-middle attack to the HTTPS protocol","volume":"7","year":"2009","journal-title":"IEEE Security & Privacy Magazine"},{"issue":"4","key":"2020061109543243113_j_infor415_ref_006","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","article-title":"A public-key cryptosystem and a signature scheme based on discrete logarithms","volume":"31","year":"1985","journal-title":"IEEE Transactions on Information Theory"},{"key":"2020061109543243113_j_infor415_ref_007","volume-title":"Encyclopedia of Cryptography and Security","year":"2011"},{"issue":"4","key":"2020061109543243113_j_infor415_ref_008","doi-asserted-by":"crossref","first-page":"711","DOI":"10.15388\/Informatica.2019.226","article-title":"A new provably secure certificateless signature with revocation in the standard model","volume":"30","year":"2019","journal-title":"Informatica"},{"issue":"2","key":"2020061109543243113_j_infor415_ref_009","doi-asserted-by":"crossref","first-page":"327","DOI":"10.15388\/Informatica.2019.208","article-title":"Security, trustworthiness and effectivity analysis of an offline E-cash system with observers","volume":"30","year":"2019","journal-title":"Informatica"},{"issue":"1","key":"2020061109543243113_j_infor415_ref_010","first-page":"69","article-title":"Hash function requirements for Schnorr signatures","volume":"3","year":"2009","journal-title":"Journal of Mathematical Cryptology"},{"key":"2020061109543243113_j_infor415_ref_011","first-page":"387","volume-title":"Advances in Cryptology \u2013 EUROCRYPT\u201996","volume":"1070","year":"1996"},{"issue":"3","key":"2020061109543243113_j_infor415_ref_012","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/s001450010003","article-title":"Security arguments for digital signatures and blind signatures","volume":"13","year":"2000","journal-title":"Journal of Cryptology"},{"issue":"1","key":"2020061109543243113_j_infor415_ref_013","first-page":"33","article-title":"The multivariate quadratic power problem over Zn is NP-complete","volume":"41","year":"2012","journal-title":"Information Technology and Control"},{"issue":"2","key":"2020061109543243113_j_infor415_ref_014","doi-asserted-by":"crossref","first-page":"43","DOI":"10.3390\/sym10020043","article-title":"Enhanced matrix power function for cryptographic primitive construction","volume":"10","year":"2018","journal-title":"Symmetry"},{"issue":"2","key":"2020061109543243113_j_infor415_ref_015","doi-asserted-by":"crossref","first-page":"283","DOI":"10.15388\/Informatica.2014.15","article-title":"New asymmetric cipher of non-commuting cryptography class based on matrix power function","volume":"25","year":"2014","journal-title":"Informatica"},{"issue":"3","key":"2020061109543243113_j_infor415_ref_016","doi-asserted-by":"crossref","first-page":"517","DOI":"10.15388\/Informatica.2017.142","article-title":"Improved asymmetric cipher based on matrix power function resistant to linear algebra attack","volume":"28","year":"2017","journal-title":"Informatica"},{"issue":"11","key":"2020061109543243113_j_infor415_ref_017","doi-asserted-by":"crossref","first-page":"571","DOI":"10.3390\/sym10110571","article-title":"MPF problem over modified medial semigroup Is NP-complete","volume":"10","year":"2018","journal-title":"Symmetry"},{"key":"2020061109543243113_j_infor415_ref_018","first-page":"92","volume-title":"Information Science and Computing, Book 4 Advanced Studies in Software and Knowledge Engineering","year":"2008"},{"issue":"1","key":"2020061109543243113_j_infor415_ref_019","doi-asserted-by":"crossref","first-page":"9","DOI":"10.3390\/sym9010009","article-title":"Improved asymmetric cipher based on matrix power function with provable security","volume":"9","year":"2017","journal-title":"Symmetry"},{"key":"2020061109543243113_j_infor415_ref_020","first-page":"239","volume-title":"Advances in Cryptology \u2013 CRYPTO\u201989","volume":"435","year":"1990"},{"issue":"3","key":"2020061109543243113_j_infor415_ref_021","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF00196725","article-title":"Efficient signature generation by smart cards","volume":"4","year":"1991","journal-title":"Journal of Cryptology"},{"key":"2020061109543243113_j_infor415_ref_022","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1007\/978-3-642-29011-4_33","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","volume":"7237","year":"2012"},{"issue":"26","key":"2020061109543243113_j_infor415_ref_023","first-page":"1484","article-title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer","volume":"1997","year":"1997","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"2020061109543243113_j_infor415_ref_024","doi-asserted-by":"crossref","first-page":"595","DOI":"10.15388\/Informatica.2019.220","article-title":"Efficient certificate-based signature with short key and signature sizes from lattices","volume":"30","year":"2019","journal-title":"Informatica"},{"key":"2020061109543243113_j_infor415_ref_025","first-page":"117","volume-title":"Lecture Notes in Computer Science","volume":"1431","year":"2006"}],"container-title":["Informatica"],"original-title":[],"language":"en","deposited":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T07:29:39Z","timestamp":1591860579000},"score":1,"resource":{"primary":{"URL":"https:\/\/informatica.vu.lt\/doi\/10.15388\/20-INFOR415"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":25,"alternative-id":["10.15388\/20-INFOR415"],"URL":"https:\/\/doi.org\/10.15388\/20-infor415","relation":{},"ISSN":["0868-4952","1822-8844"],"issn-type":[{"value":"0868-4952","type":"print"},{"value":"1822-8844","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}