Theory of Cryptography

DOI10.1007/B95566zbMath1197.94193OpenAlexW2498336418MaRDI QIDQ5901771

Ke Yang, Michael K. Reiter, Philip D. MacKenzie

Publication date: 14 May 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b95566

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (19)

Constructions of dynamic and non-dynamic threshold public-key encryption schemes with decryption consistency ⋮ Public-Key Puncturable Encryption: Modular and Compact Constructions ⋮ Dynamic Threshold Public-Key Encryption with Decryption Consistency from Static Assumptions ⋮ Puncturable identity-based and attribute-based encryption from lattices ⋮ Reconciling non-malleability with homomorphic encryption ⋮ Sender-binding key encapsulation ⋮ A new security notion for PKC in the standard model: weaker, simpler, and still realizing secure channels ⋮ Strongly anonymous ratcheted key exchange ⋮ Traceable receipt-free encryption ⋮ Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions ⋮ Fully Anonymous Group Signatures Without Random Oracles ⋮ Two Efficient Tag-Based Encryption Schemes on Lattices ⋮ All-but-many encryption ⋮ Tag-KEM/DEM: A new framework for hybrid encryption ⋮ CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions ⋮ Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption ⋮ An Efficient Encapsulation Scheme from Near Collision Resistant Pseudorandom Generators and Its Application to IBE-to-PKE Transformations ⋮ A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks ⋮ Improving Practical UC-Secure Commitments Based on the DDH Assumption

This page was built for publication: Theory of Cryptography