Results 221 to 230 of about 6,728 (248)
Some of the next articles are maybe not open access.
2021
Over the course of the previous chapters we have seen how random oracles allow for the creation of elegant and efficient schemes which can furthermore be proven secure in the random oracle model. In this chapter we have a closer look at what it means to have a security proof in the random oracle model rather than in the standard model.
Arno Mittelbach, Marc Fischlin
openaire +1 more source
Over the course of the previous chapters we have seen how random oracles allow for the creation of elegant and efficient schemes which can furthermore be proven secure in the random oracle model. In this chapter we have a closer look at what it means to have a security proof in the random oracle model rather than in the standard model.
Arno Mittelbach, Marc Fischlin
openaire +1 more source
Ring signatures without random oracles
Proceedings of the 2006 ACM Symposium on Information, computer and communications security, 2006Since the formalization of ring signature by Rivest, Shamir and Tauman in 2001, there are lots of variations appeared in the literature. Almost all of the variations rely on the random oracle model for security proof. In this paper, we propose a ring signature scheme based on bilinear pairings, which is proven to be secure against adaptive chosen ...
Sherman S. M. Chow +3 more
openaire +2 more sources
Random Oracles in the Standard Model
2016Provable security is a fundamental concept of modern cryptography (see, e.g., Katz and Lindell; Introduction to Modern Cryptography, Chapter 1, 2007). In order to argue about security, we first require a precise and rigorous definition of what security means (e.g., a definition of secure encryption).
openaire +2 more sources
The Wonderful World of Global Random Oracles
2018The random-oracle model by Bellare and Rogaway (CCS’93) is an indispensable tool for the security analysis of practical cryptographic protocols. However, the traditional random-oracle model fails to guarantee security when a protocol is composed with arbitrary protocols that use the same random oracle.
Jan Camenisch +4 more
openaire +2 more sources
2010
The signature schemes described in the previous chapters, whether based on the RSA/strong RSA assumptions or bilinear maps, represent essentially the extent of what is currently known regarding efficient yet provably secure signature schemes.
openaire +1 more source
The signature schemes described in the previous chapters, whether based on the RSA/strong RSA assumptions or bilinear maps, represent essentially the extent of what is currently known regarding efficient yet provably secure signature schemes.
openaire +1 more source
Proxy Signature Without Random Oracles
2006In mobile Ad Hoc networks, the existence and availability of trusted authorities is severely limited by intrinsic network features, and problems such as “service availability” have become a crucial issue. A proxy signature scheme allows an entity to delegate his/her signing capability to another entity in such a way that the latter can sign messages on
Xinyi Huang 0001 +3 more
openaire +1 more source
Efficient Signcryption Without Random Oracles
2006Signcryption is an asymmetric cryptographic method that simultaneously provides confidentiality and authenticity at a lower computational and communication overhead. A number of signcryption schemes have been proposed in the literature, but they are only proven to be secure in the random oracle model.
Qianhong Wu +3 more
openaire +1 more source
Lattice-based group signature scheme without random oracle
Information Security Journal, 2020, B B Amberker
exaly