Results 1 to 10 of about 9,626 (278)
Weakened Random Oracle Models with Target Prefix [PDF]
, 2019 Weakened random oracle models (WROMs) are variants of the random oracle model (ROM). The WROMs have the random oracle and the additional oracle which breaks some property of a hash function. Analyzing the security of cryptographic schemes in WROMs, we can specify the property of a hash function on which the security of cryptographic schemes depends ...
Masayuki Tezuka +2 more
openaire +4 more sources
A Private Quantum Bit String Commitment
Entropy, 2020 We propose an entanglement-based quantum bit string commitment protocol whose composability is proven in the random oracle model. This protocol has the additional property of preserving the privacy of the committed message.
Mariana Gama, Paulo Mateus, André Souto
doaj +1 more source
Universally Composable Oblivious Transfer with Low Communication
Applied Sciences, 2023 In this paper, a universally composable 1-out-of-N oblivious transfer protocol with low communication is built. This protocol obtained full simulation security based on the modulo learning with rounding (Mod-LWR) assumption.
Jiashuo Song +5 more
doaj +1 more source
A Machine-Checked Formalization of the Random Oracle Model [PDF]
, 2006 Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowledge about the plaintext pertaining to a ciphertext without knowing the key. Ideally, one would prefer to abandon the perfect cryptography hypothesis and reason about the computational
Gilles Barthe, Sabrina Tarento
openaire +1 more source
Formal Indistinguishability Extended to the Random Oracle Model [PDF]
, 2009 Several generic constructions for transforming one-way func-tions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of their arguments. That is, given the image by a one-way function of a random value, an adversary has only negligible probability to compute this random value. Encryp-tion schemes must
Ene, Cristian +2 more
openaire +3 more sources
The equivalence of the random oracle model and the ideal cipher model, revisited [PDF]
Proceedings of the forty-third annual ACM symposium on Theory of computing, 2011 We consider the cryptographic problem of constructing an invertible random permutation from a public random function (i.e., which can be accessed by the adversary). This goal is formalized by the notion of indifferentiability of Maurer et al. (TCC 2004).
Holenstein Thomas +2 more
openaire +2 more sources
Two improved content extraction signature schemes
网络与信息安全学报, 2017 Motivated by the idea of batch signatures,two variants of content extraction signature schemes based on commit vector and RSA respectively were presented.In the proposed schemes,the efficiency of signing and verification were improved by unifying certain
Min WANG +3 more
doaj +3 more sources
Quantum Security of a Compact Multi-Signature
CryptographyWith the rapid advances in quantum computing, quantum security is now an indispensable property for any cryptographic system. In this paper, we study how to prove the security of a complex cryptographic system in the quantum random oracle model. We first
Shaoquan Jiang
doaj +1 more source
RKA Security for Identity-Based Signature Scheme
IEEE Access, 2020 Related-key attack (RKA) is a kind of side-channel attack considered for kinds of cryptographic primitives, such as public key encryption, digital signature, pseudorandom functions etc.
Jinyong Chang +4 more
doaj +1 more source
Time-Lock Puzzles in the Random Oracle Model [PDF]
, 2011 A time-lock puzzle is a mechanism for sending messages "to the future". The sender publishes a puzzle whose solution is the message to be sent, thus hiding it until enough time has elapsed for the puzzle to be solved. For time-lock puzzles to be useful, generating a puzzle should take less time than solving it. Since adversaries may have access to many
Mohammad Mahmoody +2 more
openaire +2 more sources