Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts

DOI10.1007/978-3-662-53644-5_6zbMath1397.94071OpenAlexW2535223219MaRDI QIDQ3181025

Andy Rupp, Dennis Hofheinz, Tibor Jager

Publication date: 22 December 2016

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53644-5_6

zbMATH Keywords

public-key encryptionselective-opening securitylossy encryptionmatrix assumptions

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (11)

SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions ⋮ One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model ⋮ Simulation-based selective opening security for receivers under chosen-ciphertext attacks ⋮ Selective Opening Security from Simulatable Data Encapsulation ⋮ New and improved constructions for partially equivocable public key encryption ⋮ Compact and tightly selective-opening secure public-key encryption schemes ⋮ Anonymous public key encryption under corruptions ⋮ Practical public key encryption with selective opening security for receivers ⋮ Simulation-based receiver selective opening CCA secure PKE from standard computational assumptions ⋮ New constructions of statistical NIZKs: dual-mode DV-NIZKs and more ⋮ IBE with tight security against selective opening and chosen-ciphertext attacks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• More constructions of lossy and correlation-secure trapdoor functions
• An Algebraic Framework for Diffie-Hellman Assumptions
• All-But-Many Lossy Trapdoor Functions
• Standard Security Does Not Imply Security against Selective-Opening
• On Definitions of Selective Opening Security
• All-But-Many Encryption
• Identity-Based Encryption Secure against Selective Opening Attack
• Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security
• Standard Security Does Not Imply Indistinguishability Under Selective Opening
• Lossy trapdoor functions and their applications
• Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
• Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks
• Shrinking the Keys of Discrete-Log-Type Lossy Trapdoor Functions
• A Framework for Efficient and Composable Oblivious Transfer
• Secure Hybrid Encryption from Weakened Key Encapsulation
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Revisiting Lower and Upper Bounds for Selective Decommitments
• Sender-Equivocable Encryption Schemes Secure against Chosen-Ciphertext Attacks Revisited
• Candidate Multilinear Maps from Ideal Lattices
• Advances in Cryptology – CRYPTO 2004
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Public-Key Cryptosystems Resilient to Key Leakage

This page was built for publication: Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts