CCA-security from adaptive all-but-one lossy trapdoor functions

DOI10.1016/j.tcs.2021.06.014OpenAlexW3177521104WikidataQ115036470 ScholiaQ115036470MaRDI QIDQ2049981

Qinyi Li, Xavier Boyen, Ernest Foo

Publication date: 27 August 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.06.014

zbMATH Keywords

lossy trapdoor functionsdeterministic encryptionkey encapsulationCCA securityadaptive ABO-LTFs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Direct chosen-ciphertext secure identity-based key encapsulation without random oracles
• Almost tight multi-instance multi-ciphertext identity-based encryption on lattices
• Kurosawa-Desmedt meets tight security
• All-but-many lossy trapdoor functions from lattices and applications
• All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE
• Incremental deterministic public-key encryption
• More constructions of lossy and correlation-secure trapdoor functions
• Practical chosen ciphertext secure encryption from factoring
• Secure integration of asymmetric and symmetric encryption schemes
• A generic construction of CCA-secure deterministic encryption
• Direct CCA-secure KEM and deterministic PKE from plain LWE
• A unified approach to deterministic encryption: new constructions and a connection to computational entropy
• A Decade of Lattice Cryptography
• Learning with Rounding, Revisited
• All-But-Many Lossy Trapdoor Functions
• Identity-Based (Lossy) Trapdoor Functions and Applications
• Dual Projective Hashing and Its Applications — Lossy Trapdoor Functions and More
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Chameleon All-But-One TDFs and Their Application to Chosen-Ciphertext Security
• Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security
• Lossy Trapdoor Functions and Their Applications
• A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems
• Simpler CCA-Secure Public Key Encryption from Lossy Trapdoor Functions
• Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions
• A Simple BGN-Type Cryptosystem from LWE
• Efficient Lattice (H)IBE in the Standard Model
• Adaptive Trapdoor Functions and Chosen-Ciphertext Security
• On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
• Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
• A Framework for Efficient and Composable Oblivious Transfer
• Chosen-Ciphertext Security via Correlated Products
• Deterministic and Efficiently Searchable Encryption
• Secure Hybrid Encryption from Weakened Key Encapsulation
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
• Nonmalleable Cryptography
• Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions
• Efficient CCA-Secure PKE from Identity-Based Techniques
• Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting
• Advances in Cryptology – CRYPTO 2004
• Simple Chosen-Ciphertext Security from Low-Noise LPN
• Identity-Based Lossy Trapdoor Functions: New Definitions, Hierarchical Extensions, and Implications
• Chosen‐Ciphertext Security from Identity‐Based Encryption
• Theory of Cryptography
• On lattices, learning with errors, random linear codes, and cryptography
• Tighter security proofs for GPV-IBE in the quantum random oracle model

This page was built for publication: CCA-security from adaptive all-but-one lossy trapdoor functions