Results 51 to 60 of about 95,474 (182)
Verifiable Random Functions (VRFs) [PDF]
, 2018 A Verifiable Random Function (VRF) is the public-key version of a keyed cryptographic hash. Only the holder of the private key can compute the hash, but anyone with public key can verify the correctness of the hash.
Goldberg, Sharon +3 more
core
Predictable arguments of knowledge [PDF]
, 2017 We initiate a formal investigation on the power of predictability for argument of knowledge systems for NP. Specifically, we consider private-coin argument systems where the answer of the prover can be predicted, given the private randomness of the ...
B Barak +29 more
core +2 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
Security of discrete log cryptosystems in the random oracle and the generic model [PDF]
, 1999 We introduce novel security proofs that use combinatorial counting arguments rather than reductions to the discrete logarithm or to the Diffie-Hellman problem. Our security results are sharp and clean with no polynomial reduction times involved.
Jakobsson, Markus, Schnorr, Claus Peter
core
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
Unbiased risk estimation method for covariance estimation [PDF]
, 2011 We consider a model selection estimator of the covariance of a random process. Using the Unbiased Risk Estimation (URE) method, we build an estimator of the risk which allows to select an estimator in a collection of model.
Chabriac, Claudie +2 more
core +2 more sources
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
A tight security reduction in the quantum random oracle model for code-based signature schemes [PDF]
, 2017 Quantum secure signature schemes have a lot of attention recently, in particular because of the NIST call to standardize quantum safe cryptography. However, only few signature schemes can have concrete quantum security because of technical difficulties ...
Chailloux, André +1 more
core +1 more source