Sciweavers

102 search results - page 2 / 21
» Practical Identity-Based Encryption Without Random Oracles
Sort
View
PQCRYPTO
2010
250views Cryptology» more  PQCRYPTO 2010»
13 years 9 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
EUROCRYPT
2004
Springer
13 years 10 months ago
Chosen-Ciphertext Security from Identity-Based Encryption
Abstract. We propose a simple and efficient construction of a CCAsecure public-key encryption scheme from any CPA-secure identity-based encryption (IBE) scheme. Our construction re...
Ran Canetti, Shai Halevi, Jonathan Katz
CTRSA
2006
Springer
176views Cryptology» more  CTRSA 2006»
13 years 9 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
ASIACRYPT
2006
Springer
13 years 9 months ago
HIBE With Short Public Parameters Without Random Oracle
Abstract. At Eurocrypt 2005, Waters presented an identity based encryption (IBE) protocol which is secure in the full model without random oracle. In this paper, we extend Waters&#...
Sanjit Chatterjee, Palash Sarkar
ACNS
2005
Springer
167views Cryptology» more  ACNS 2005»
13 years 10 months ago
Identity Based Encryption Without Redundancy
This paper presents a first example of secure identity based encryption scheme (IBE) without redundancy in the sense of Phan and Pointcheval. This modification of the Boneh-Frank...
Benoît Libert, Jean-Jacques Quisquater