A survey of key evolving cryptosystems
International Journal of Security and Networks
Secure public-key encryption scheme without random oracles
Information Sciences: an International Journal
Proxy Re-signatures in the Standard Model
ISC '08 Proceedings of the 11th international conference on Information Security
General Certificateless Encryption and Timed-Release Encryption
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Generalized Identity Based and Broadcast Encryption Schemes
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Weak Verifiable Random Functions
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Salvaging Merkle-Damgård for Practical Applications
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Subliminal channels in the identity-based threshold ring signature
International Journal of Computer Mathematics
On Black-Box Constructions of Predicate Encryption from Trapdoor Permutations
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
IWSEC'07 Proceedings of the Security 2nd international conference on Advances in information and computer security
Deniable cloud storage: sharing files via public-key deniability
Proceedings of the 9th annual ACM workshop on Privacy in the electronic society
Pairing-Based Onion Routing with Improved Forward Secrecy
ACM Transactions on Information and System Security (TISSEC)
Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
How to construct interval encryption from binary tree encryption
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Practical and efficient cryptographic enforcement of interval-based access control policies
ACM Transactions on Information and System Security (TISSEC)
Bi-deniable public-key encryption
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Security of practical cryptosystems using Merkle-Damgård hash function in the ideal cipher model
ProvSec'11 Proceedings of the 5th international conference on Provable security
Bonsai trees, or how to delegate a lattice basis
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Efficient lattice (H)IBE in the standard model
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Information-theoretically secure key-insulated multireceiver authentication codes
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Probabilistic public key encryption with equality test
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
Expressive encryption systems from lattices
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
Circular and KDM security for identity-based encryption
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Cryptanalysis of Two Efficient HIBE Schemes in the Standard Model
Fundamenta Informaticae
Symmetric inner-product predicate encryption based on three groups
ProvSec'12 Proceedings of the 6th international conference on Provable Security
A forward-secure certificate-based signature scheme in the standard model
CSS'12 Proceedings of the 4th international conference on Cyberspace Safety and Security
| Hi-index | 0.00 |
Cryptographic computations are often carried out on insecure devices for which the threat of key exposure represents a serious concern. Forward security allows one to mitigate the damage caused by exposure of secret keys. In a forward-secure scheme, secret keys are updated at regular periods of time; exposure of the secret key corresponding to a given time period does not enable an adversary to "break" the scheme (in the appropriate sense) for any prior time period. We present the first constructions of (non-interactive) forward-secure public-key encryption schemes. Our main construction achieves security against chosen-plaintext attacks in the standard model, and all parameters of the scheme are poly-logarithmic in the total number of time periods. Some variants and extensions of this scheme are also given. We also introduce the notion of binary tree encryption and construct a binary tree encryption scheme in the standard model. Our construction implies the first hierarchical identity-based encryption scheme in the standard model. (The notion of security we achieve, however, is slightly weaker than that achieved by some previous constructions in the random oracle model.)