Public-key cryptosystems provably secure against chosen ciphertext attacks
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Wallet Databases with Observers
CRYPTO '92 Proceedings of the 12th 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
On the Security of Joint Signature and Encryption
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security
FOCS '99 Proceedings of the 40th Annual 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
Space-Efficient Identity Based EncryptionWithout Pairings
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Lossy trapdoor functions and their applications
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Trapdoors for hard lattices and new cryptographic constructions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Non-interactive Proofs for Integer Multiplication
EUROCRYPT '07 Proceedings of the 26th annual international conference on 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
Construction of Threshold Public-Key Encryptions through Tag-Based Encryptions
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Chosen-ciphertext secure key-encapsulation based on gap hashed Diffie-Hellman
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Fully anonymous group signatures without random oracles
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Miniature CCA2 PK encryption: tight security without redundancy
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Public-key encryption with non-interactive opening
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
Chosen ciphertext secure public key threshold encryption without random oracles
CT-RSA'06 Proceedings of the 2006 The Cryptographers' Track at the RSA conference on Topics in Cryptology
Foundations of group signatures: the case of dynamic groups
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Chosen-ciphertext security of multiple encryption
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Efficient identity-based encryption without random oracles
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Chosen-Ciphertext security from tag-based encryption
TCC'06 Proceedings of the Third conference on Theory of Cryptography
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
Efficient threshold encryption from lossy trapdoor functions
PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
On the security of dynamic group signatures: preventing signature hijacking
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key 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 |
Public-key encryption schemes with non-interactive opening (PKENO) allow a receiver to non-interactively convince third parties that a ciphertext decrypts to a given plaintext or, alternatively, that such a ciphertext is invalid. Two practical generic constructions for PKENO have been proposed so far, starting from either identity-based encryption or public-key encryption with witness-recovering decryption (PKEWR). We show that the known transformation from PKEWR to PKENO fails to provide chosen-ciphertext security; only the transformation from identity-based encryption remains thus valid. Next, we prove that PKENO can alternatively be built out of robust non-interactive threshold public-key cryptosystems, a primitive that differs from identity-based encryption. Using the new transformation, we construct two efficient PKENO schemes: one based on the Decisional Diffie-Hellman assumption (in the Random-Oracle Model) and one based on the Decisional Linear assumption (in the standard model). Last but not least, we propose new applications of PKENO in protocol design. Motivated by these applications, we reconsider proof soundness for PKENO and put forward new definitions that are stronger than those considered so far. We give a taxonomy of all definitions and demonstrate them to be satisfiable.