SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions
type: Item
instance of: scholarly article
title: SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions
zbMATH Open document ID: 1462.94040
author: Dingding Jia
author: Benoît Libert
published in: Designs, Codes and Cryptography
publication date: 2021-05-10T00:00:00Z
full work available at URL: pub-DCC21.pdf
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 7346961
zbMATH Keywords: public key encryption
zbMATH Keywords: all-but-many lossy trapdoor functions
zbMATH Keywords: selective-opening security
zbMATH Keywords: chosen-ciphertext secure
zbMATH Keywords: tight security
MaRDI profile type: Publication
OpenAlex ID: W3133838614
cites work: Efficient Lattice (H)IBE in the Standard Model
cites work: Standard Security Does Not Imply Security against Selective-Opening
cites work: Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
cites work: Q4365732
cites work: Identity-Based Encryption Secure against Selective Opening Attack
cites work: (Hierarchical) Identity-Based Encryption from Affine Message Authentication
cites work: On Definitions of Selective Opening Security
cites work: Short signatures without random oracles and the SDH assumption in bilinear groups
cites work: All-but-many lossy trapdoor functions from lattices and applications
cites work: Shrinking the Keys of Discrete-Log-Type Lossy Trapdoor Functions
cites work: Classical hardness of learning with errors
cites work: Theory of Cryptography
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Magic Functions
cites work: An Algebraic Framework for Diffie-Hellman Assumptions
cites work: Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks
cites work: All-But-Many Encryption
cites work: Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
cites work: Probabilistic encryption
cites work: Simulation-based receiver selective opening CCA secure PKE from standard computational assumptions
cites work: Selective Opening Security for Receivers
cites work: Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security
cites work: On the Selective Opening Security of Practical Public-Key Encryption Schemes
cites work: Selective Opening Security from Simulatable Data Encapsulation
cites work: Selective-Opening Security in the Presence of Randomness Failures
cites work: All-But-Many Lossy Trapdoor Functions
cites work: Circular Chosen-Ciphertext Security with Compact Ciphertexts
cites work: Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts
cites work: Identity-based encryption tightly secure under chosen-ciphertext attacks
cites work: Programmable Hash Functions and Their Applications
cites work: Standard Security Does Not Imply Indistinguishability Under Selective Opening
cites work: Simulation-based selective opening security for receivers under chosen-ciphertext attacks
cites work: Sender-Equivocable Encryption Schemes Secure against Chosen-Ciphertext Attacks Revisited
cites work: Q3374910
cites work: Receiver Selective Opening Security from Indistinguishability Obfuscation
cites work: Constructions Secure Against Receiver Selective Opening and Chosen Ciphertext Attacks
cites work: About the Security of MTI/C0 and MQV
cites work: Identity-Based Encryption Secure against Selective Opening Chosen-Ciphertext Attack
cites work: Lossy algebraic filters with short tags
cites work: All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE
cites work: Simulation-Based Selective Opening CCA Security for PKE from Key Encapsulation Mechanisms
cites work: Tightly SIM-SO-CCA secure public key encryption from standard assumptions
cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
cites work: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
cites work: Lossy trapdoor functions and their applications
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: Efficient Identity-Based Encryption Without Random Oracles
DOI: 10.1007/S10623-021-00849-9
description: scientific article; zbMATH DE number 7346961