Public-key cryptosystems provably secure against chosen ciphertext attacks
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Identity-Based Encryption from the Weil Pairing
SIAM Journal on Computing
Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
General Composition and Universal Composability in Secure Multi-Party Computation
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Direct chosen ciphertext security from identity-based techniques
Proceedings of the 12th ACM conference on Computer and communications security
Efficient identity-based encryption without random oracles
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Games and the impossibility of realizable ideal functionality
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Chosen-Ciphertext security from tag-based encryption
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Breaking and Repairing Damgård et al. Public Key Encryption Scheme with Non-interactive Opening
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Group signature implies PKE with non-interactive opening and threshold PKE
IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
Efficient privacy-preserving data mining in malicious model
ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications: Part I
Privacy-preserving data mining in presence of covert adversaries
ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications: Part I
Signcryption with non-interactive non-repudiation without random oracles
Transactions on computational science X
Non-interactive opening for ciphertexts encrypted by shared keys
ICICS'11 Proceedings of the 13th international conference on Information and communications security
Public-key encryption with non-interactive opening: new constructions and stronger definitions
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Efficient CCA-Secure PKE from identity-based techniques
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
Efficient threshold encryption from lossy trapdoor functions
PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
A generic construction from Selective-IBE to public-key encryption with non-interactive opening
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
Hi-index | 0.00 |
We formally define the primitive of public-key encryption with non-interactive opening (PKENO), where the receiver of a cipher-text C can, convincingly and without interaction, reveal what the result was of decrypting C, without compromising the scheme's security. This has numerous applications in cryptographic protocol design, e.g., when the receiver wants to demonstrate that some information he was sent privately was not correctly formed. We give a definition based on the UC framework as well as an equivalent game-based definition. The PKENO concept was informally introduced by Damgård and Thorbek who suggested that it could be implemented based on Identity-Based Encryption. In this paper, we give direct and optimized implementations, that work without having to keep state information, unlike what one obtains from directly using IBE.