Results 151 to 160 of about 95,474 (182)
Some of the next articles are maybe not open access.
Revisiting TESLA in the Quantum Random Oracle Model
2017We study a scheme of Bai and Galbraith (CT-RSA’14), also known as TESLA. TESLA was thought to have a tight security reduction from the learning with errors problem (LWE) in the random oracle model (ROM). Moreover, a variant using chameleon hash functions was lifted to the quantum random oracle model (QROM).
Alkim, Erdem +7 more
openaire +3 more sources
Quantum Random Oracle Model with Auxiliary Input
2019The random oracle model (ROM) is an idealized model where hash functions are modeled as random functions that are only accessible as oracles. Although the ROM has been used for proving many cryptographic schemes, it has (at least) two problems. First, the ROM does not capture quantum adversaries. Second, it does not capture non-uniform adversaries that
Minki Hhan +2 more
openaire +1 more source
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
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 +1 more source
Security Analysis Based on Quantum Random Oracle Model
2020Random oracle model is a general security analysis tool for rigorous security proof and effective cryptographic protocol design. In the quantum world, the attempts of constructing a quantum random oracle (QRO) have been made, such as quantum-accessible random oracle for post-quantum cryptography and quantum random oracle for quantum cryptography.
Tao Shang, Jianwei Liu
openaire +1 more source
IBE in Adaptive-Identity Model Without Random Oracles
2011In the previous chapters, we have seen several IBE schemes and their extension to HIBE. As mentioned in Chapter 2, the security model for IBE schemes was introduced by Boneh and Franklin and allows the adversary to make both adaptiveidentity and adaptive-chosen ciphertext attacks.
Sanjit Chatterjee, Palash Sarkar
openaire +1 more source
Non-interactive Zero Knowledge Proofs in the Random Oracle Model
2019The Fiat-Shamir (FS) transform is a well known and widely used technique to convert any constant-round public-coin honest-verifier zero-knowledge (HVZK) proof or argument system \(\mathsf {HVZK}=(\mathcal {P},\mathcal {V})\) in a non-interactive zero-knowledge (NIZK) argument ...
Iovino V., Visconti I.
openaire +3 more sources
Secure Stern Signatures in Quantum Random Oracle Model
2019The Stern signatures are a class of lattice-based signatures constructed from Stern protocols, a special class of sigma protocols, admitting diverse functionalities with good asymptotic efficiency. However, the post-quantum security of existing Stern signatures is unclear, since they are built via the Fiat-Shamir transformation, which has not been ...
Hanwen Feng, Jianwei Liu, Qianhong Wu
openaire +1 more source
Fiat–Shamir Bulletproofs are Non-malleable (in the Random Oracle Model)
Journal of CryptologyzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ganesh, C +4 more
openaire +3 more sources