DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Random oracle
Random oracle
Modern Cryptography: Lecture 13 Digital Signatures
A Provably-Unforgeable Threshold Eddsa with an Offline Recovery Party
On Notions of Security for Deterministic Encryption, and Efficient Constructions Without Random Oracles
Securing Threshold Cryptosystems Against Chosen Ciphertext Attack∗
Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information
Random Oracle Model, Hashing Applications
How Risky Is the Random-Oracle Model?
Hash Functions Part II
Random Oracles in a Quantum World
Improved Bounds on Security Reductions for Discrete Log Based Signatures
CRYPTREC Review of Eddsa CRYPTREC EX-3003-2020
Random Oracle Reducibility
Hash Function Security : Cryptanalysis of the Very Smooth Hash
A New and Improved Paradigm for Hybrid Encryption Secure Against Chosen-Ciphertext Attack
The Random Oracle Methodology, Revisited∗
A Cramer-Shoup Encryption Scheme from the Linear Assumption and from Progressively Weaker Linear Variants
Hash Function Requirements for Schnorr Signatures
Cryptanalysis of Dedicated Cryptographic Hash Functions
Top View
Taming the Many Eddsas
Applications of Paillier S Cryptosystem
Lecture 14 - CCA Security
Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation
Secure Hash-And-Sign Signatures Without the Random Oracle
Cryptographic Hash Functions
Non-Interactive Half-Aggregation of Eddsa and Variants of Schnorr Signatures
Signature Schemes in the Quantum Random-Oracle Model
VSH, an Efficient and Provable Collision-Resistant Hash Function
Fast Cramer-Shoup Cryptosystem
On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model
Random Oracles With(Out) Programmability*
Randomness-Dependent Message Security
The Cramer-Shoup Cryptosystem
Identity-Based Cryptography from Paillier Cryptosystem
Short Signatures Without Random Oracles
The Provable Security of Ed25519: Theory and Practice
An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem
Simpler Proofs of Quantumness
Digital Signatures
Random Oracles Are Practical: a Paradigm for Designing Efficient
High-Speed High-Security Signatures
Limits on the Usefulness of Random Oracles
On the Security of One-Witness Blind Signature Schemes
CRYPTOGRAPHY KNOWLEDGE AREA Issue 1.0