CCA-security from adaptive all-but-one lossy trapdoor functions
type: Item
instance of: scholarly article
title: CCA-security from adaptive all-but-one lossy trapdoor functions
author: Qinyi Li
author: Xavier Boyen
author: Ernest Foo
published in: Theoretical Computer Science
publication date: 2021-08-27T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7387695
zbMATH Keywords: lossy trapdoor functions
zbMATH Keywords: adaptive ABO-LTFs
zbMATH Keywords: CCA security
zbMATH Keywords: key encapsulation
zbMATH Keywords: deterministic encryption
Wikidata QID: Q115036470
MaRDI profile type: Publication
full work available at URL: j.tcs.2021.06.014
OpenAlex ID: W3177521104
cites work: Secure integration of asymmetric and symmetric encryption schemes
cites work: Nonmalleable Cryptography
cites work: Q4434879
cites work: A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems
cites work: Q4249317
cites work: Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
cites work: Advances in Cryptology – CRYPTO 2004
cites work: Kurosawa-Desmedt meets tight security
cites work: Secure Hybrid Encryption from Weakened Key Encapsulation
cites work: Dual Projective Hashing and Its Applications — Lossy Trapdoor Functions and More
cites work: Practical chosen ciphertext secure encryption from factoring
cites work: Chosen‐Ciphertext Security from Identity‐Based Encryption
cites work: Theory of Cryptography
cites work: Direct chosen-ciphertext secure identity-based key encapsulation without random oracles
cites work: Adaptive Trapdoor Functions and Chosen-Ciphertext Security
cites work: Efficient CCA-Secure PKE from Identity-Based Techniques
cites work: Simple Chosen-Ciphertext Security from Low-Noise LPN
cites work: A Framework for Efficient and Composable Oblivious Transfer
cites work: Chosen-Ciphertext Security via Correlated Products
cites work: Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions
cites work: Lossy Trapdoor Functions and Their Applications
cites work: On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
cites work: Simpler CCA-Secure Public Key Encryption from Lossy Trapdoor Functions
cites work: Chameleon All-But-One TDFs and Their Application to Chosen-Ciphertext Security
cites work: Direct CCA-secure KEM and deterministic PKE from plain LWE
cites work: A generic construction of CCA-secure deterministic encryption
cites work: Deterministic and Efficiently Searchable Encryption
cites work: Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
cites work: A unified approach to deterministic encryption: new constructions and a connection to computational entropy
cites work: Incremental deterministic public-key encryption
cites work: Identity-Based (Lossy) Trapdoor Functions and Applications
cites work: More constructions of lossy and correlation-secure trapdoor functions
cites work: Learning with Rounding, Revisited
cites work: Identity-Based Lossy Trapdoor Functions: New Definitions, Hierarchical Extensions, and Implications
cites work: Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security
cites work: All-But-Many Lossy Trapdoor Functions
cites work: All-but-many lossy trapdoor functions from lattices and applications
cites work: All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE
cites work: Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
cites work: A public key cryptosystem and a signature scheme based on discrete logarithms
cites work: A Simple BGN-Type Cryptosystem from LWE
cites work: Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting
cites work: Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions
cites work: Q4228459
cites work: Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
cites work: Tighter security proofs for GPV-IBE in the quantum random oracle model
cites work: Efficient Lattice (H)IBE in the Standard Model
cites work: Almost tight multi-instance multi-ciphertext identity-based encryption on lattices
cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: A decade of lattice cryptography
DOI: 10.1016/J.TCS.2021.06.014
description: scientific article; zbMATH DE number 7387695