Results 31 to 40 of about 5,642 (158)
Non Observability in the Random Oracle Model [PDF]
, 2013 Security proofs in the Random Oracle Model (ROM) often make use of the fact that the queries made by the adversary to the oracle are observable as well as the responses to those queries can be programmed. While, the issue of programmability of query responses has received attention in the literature, to the best of our knowledge, observability of the ...
Prabhanjan Ananth, Raghav Bhaskar
openaire +1 more source
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
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
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
Cryptanalysis of a Lightweight Certificateless Signature Scheme for IIOT Environments
IEEE Access, 2018 As an extremely significant cryptographic primitive, certificateless signature (CLS) schemes can provide message authentication with no use of traditional digital certificates.
Bo Zhang +3 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 +1 more source
Random Oracle Model Of Information Hiding System
, 2008 {"references": ["Francois Cayre, Caroline Fontaine, and Teddy Furon, \"Watermarking\nsecurity: theory and practice,\" IEEE Transactions on Signal Processing,\nvol. 53, pp. 3976-3987, Oct. 2005.", "C. Cachin, \"An information-theoretic model for steganography,\" in\nInformation Hiding: Second International Workshop, vol.
Jiang, Nan, Wang, Jian
openaire +1 more source
Analysis of collision probability in Merkle trees in the random oracle model
Journal of Mathematical CryptologyThis work analyzes the probability of collisions in Merkle graphs, with a focus on a specific class of attacks in balanced Merkle trees. To provide a tractable model, each hash function is modeled as an independent random oracle with finite input space ...
Corsi Alessandro +2 more
doaj +1 more source
Selectively Linkable and Convertible Ring Signature Scheme Based on DLP [PDF]
Jisuanji gongcheng, 2019 Most of the existing linkable and convertible ring signature schemes do not have strong anonymity.To solve this problem,a ring signature scheme based on Discrete Logarithm Problem(DLP) is proposed.The actual signer establishes an association tag by ...
CAO Suzhen,SUN Han,DAI Wenjie,WANG Xiuya
doaj +1 more source