SIAM Journal on Computing
Identity-Based Encryption from the Weil Pairing
SIAM Journal on Computing
The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Relations Among Notions of Security for Public-Key Encryption Schemes
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Secure Integration of Asymmetric and Symmetric Encryption Schemes
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Key-Privacy in Public-Key Encryption
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
An Auction Protocol Which Hides Bids of Losers
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Chosen-Ciphertext Security from Identity-Based Encryption
SIAM Journal on Computing
Space-Efficient Identity Based EncryptionWithout Pairings
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Predicate encryption supporting disjunctions, polynomial equations, and inner products
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Anonymous hierarchical identity-based encryption (without random oracles)
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
The security of triple encryption and a framework for code-based game-playing proofs
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Mediated traceable anonymous encryption
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Generic construction of strongly secure timed-release public-key encryption
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
Standard security does not imply security against selective-opening
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Anonymous broadcast encryption: adaptive security and efficient constructions in the standard model
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Outsider-Anonymous broadcast encryption with sublinear ciphertexts
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Anonymous identity-based hash proof system and its applications
ProvSec'12 Proceedings of the 6th international conference on Provable Security
Message-Based traitor tracing with optimal ciphertext rate
LATINCRYPT'12 Proceedings of the 2nd international conference on Cryptology and Information Security in Latin America
Publicly verifiable ciphertexts
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
A robust and plaintext-aware variant of signed elgamal encryption
CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology
Publicly verifiable ciphertexts
Journal of Computer Security - Advances in Security for Communication Networks
| Hi-index | 0.00 |
We provide a provable-security treatment of “robust” encryption. Robustness means it is hard to produce a ciphertext that is valid for two different users. Robustness makes explicit a property that has been implicitly assumed in the past. We argue that it is an essential conjunct of anonymous encryption. We show that natural anonymity-preserving ways to achieve it, such as adding recipient identification information before encrypting, fail. We provide transforms that do achieve it, efficiently and provably. We assess the robustness of specific encryption schemes in the literature, providing simple patches for some that lack the property. We present various applications. Our work enables safer and simpler use of encryption.