Adaptively-secure, non-interactive public-key encryption

DOI10.1007/978-3-540-30576-7_9MaRDI QIDQ5711672zbMATH OpenOpenAlexFDO

Authors Ran Canetti, Shai Halevi, Jonathan Katz

Publication date 7 December 2005

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

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

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Public-Key Encryptions Tolerating Adaptive and Composable Adversaries
• A forward-secure public-key encryption scheme
• Adaptive security with quasi-optimal rate
• Threshold Public-Key Encryption with Adaptive Security and Short Ciphertexts
• Adaptively secure non-interactive threshold cryptosystems

Cited in

(37)

• Deterministic public-key encryption for adaptively-chosen plaintext distributions
• Practical public key encryption with selective opening security for receivers
• On selective-opening security of deterministic primitives
• Handling adaptive compromise for practical encryption schemes
• Tightness subtleties for multi-user PKE notions
• A unified and composable take on ratcheting
• Efficient hybrid encryption from ID-based encryption
• Simulation-based selective opening security for receivers under chosen-ciphertext attacks
• A new approach for UC security concurrent deniable authentication
• Possibility and impossibility results for receiver selective opening secure PKE in the multi-challenge setting
• Towards tight adaptive security of non-interactive key exchange
• Bi-deniable public-key encryption protocol which is secure against active coercive adversary
• Interactive encryption and message authentication
• Adaptive Witness Encryption and Asymmetric Password-Based Cryptography
• Universal composition with responsive environments
• Constructions secure against receiver selective opening and chosen ciphertext attacks
• Public-Key Encryptions Tolerating Adaptive and Composable Adversaries
• Receiver Selective Opening Security from Indistinguishability Obfuscation
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• Adaptively-secure optimal-resilience proactive RSA
• Possibility and impossibility results for selective decommitments
• Feasibility and infeasibility of adaptively secure fully homomorphic encryption
• Efficient one-sided adaptively secure computation
• Towards Key-Dependent Message Security in the Standard Model
• Public-Key Encryption with Non-interactive Opening
• Simulation-based receiver selective opening CCA secure PKE from standard computational assumptions
• Bounded Collusion ABE for TMs from IBE
• Anonymous public key encryption under corruptions
• Quantum encryption with certified deletion, revisited: public key, attribute-based, and classical communication
• Simulation-based bi-selective opening security for public key encryption
• Synchronizable fair exchange
• Non-committing identity based encryption: constructions and applications
• Robust combiners and universal constructions for quantum cryptography
• Untelegraphable encryption and its applications
• Certified everlasting secure collusion-resistant functional encryption, and more
• Post-quantum secure non-committing registered functional encryption
• SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions

This page was built for publication: Adaptively-secure, non-interactive public-key encryption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5711672)