A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
Key-dependent message (KDM) security is of great research significance, to better analyse and solve the potential security problems in complex application scenarios. ... In addition, this scheme enjoys a high level of efficiency, the cost of encryption and decryption is only ploylog(n) bit operations per message symbol, and we also prove that our scheme is KDM-CPA secure ... In Proceedings of the Advances in Cryptology—CRYPTO 2008, 28th Annual International Cryptology Conference, Santa Barbara, CA, USA, 17–21 August 2008. 8. ...doi:10.3390/app112412161 fatcat:uijmkhvcc5amvmiyf5knsqrhhu
(Crypto'21) proposes a definition trying to capture adversaries with quantum access to the signer. ... We present two short signature schemes achieving this notion: one is in the quantum random oracle model, assuming quantum hardness of SIS; and the other is in the plain model, assuming quantum hardness ... Computer Science, pages 602–631, Santa Barbara, CA, USA, August 17–21, 2020. ...arXiv:2112.06078v1 fatcat:potybhcv7nfqbaw4ek5ggiklmu
Blockchain technology has been widely used in many fields, such as smart cities, smart health care, and smart manufacturing, due to its anonymity, decentralization, and tamper resistance in peer-to-peer ... However, poor scalability has severely affected the widespread adoption of traditional blockchain technology in high-throughput and low-latency applications. ... CA, USA, August 2018. ...doi:10.1155/2021/5483243 fatcat:x67pir24enadjaauwvbh76dpre
A simple modification of our commitment scheme gives a construction which makes use of the underlying one-way function in a black-box way. ... Advances in Cryptology -CRYPTO 2008, 28th Annual International Cryptology Confer- ence, Santa Barbara, CA, USA, August 17-21, 2008. Proceedings, volume 5157 of Lecture Notes in Computer Science. ... Advances in Cryptology -CRYPTO 2010, 30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15-19, 2010. Proceedings, volume 6223 of Lecture Notes in Computer Science. Springer, 2010. ...doi:10.1145/1993636.1993729 dblp:conf/stoc/Goyal11 fatcat:zm2pxe4jb5conddcmttkcxoxoq
Lecture Notes in Computer Science
This result is optimal in the number of rounds. ... parallel. 7 We believe that some of the use of complexity leveraging in our hybrids can be avoided by modifications to our protocol. ... In Advances in Cryptology -CRYPTO 2008, 28th Annual International Cryp- tology Conference, Santa Barbara, CA, USA, August 17-21, 2008. Proceedings, pages 57-74, 2008. ...doi:10.1007/978-3-319-63688-7_16 fatcat:hf6ftndsejgt7iskkouyfl2m5q