Sciweavers

255 search results - page 5 / 51
» Security of Encryption Schemes in Weakened Random Oracle Mod...
Sort
View
PQCRYPTO
2010
250views Cryptology» more  PQCRYPTO 2010»
13 years 11 months ago
Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
Abstract. We propose a variant of the “bonsai tree” signature scheme, a latticebased existentially unforgeable signature scheme in the standard model. Our construction offers ...
Markus Rückert
CRYPTO
2004
Springer
138views Cryptology» more  CRYPTO 2004»
14 years 26 days ago
Secure Identity Based Encryption Without Random Oracles
We construct two efficient Identity Based Encryption (IBE) systems that are selective identity secure without the random oracle model. Selective identity secure IBE is a slightly w...
Dan Boneh, Xavier Boyen
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 7 months ago
Random Oracles in a Quantum World
Once quantum computers reach maturity most of today's traditional cryptographic schemes based on RSA or discrete logarithms become vulnerable to quantum-based attacks. Hence, ...
Özgür Dagdelen, Marc Fischlin, Anja Lehm...
CTRSA
2006
Springer
176views Cryptology» more  CTRSA 2006»
13 years 11 months ago
Chosen Ciphertext Secure Public Key Threshold Encryption Without Random Oracles
Abstract. We present a non-interactive chosen ciphertext secure threshold encryption system. The proof of security is set in the standard model and does not use random oracles. Our...
Dan Boneh, Xavier Boyen, Shai Halevi
CTRSA
2001
Springer
129views Cryptology» more  CTRSA 2001»
13 years 12 months ago
Formal Security Proofs for a Signature Scheme with Partial Message Recovery
The Pintsov-Vanstone signature scheme with partial message recovery (PVSSR) is a variant of the Schnorr and Nyberg-Rueppel signature schemes. It produces very short signatures on ...
Daniel R. L. Brown, Donald Byron Johnson