All-But-Many Lossy Trapdoor Functions

DOI10.1007/978-3-642-29011-4_14zbMath1279.94086OpenAlexW104181891MaRDI QIDQ2894409

Dennis Hofheinz

Publication date: 29 June 2012

Published in: Advances in Cryptology – EUROCRYPT 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29011-4_14

zbMATH Keywords

public-key encryptionlossy trapdoor functionsselective opening attacks

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (26)

Toward RSA-OAEP Without Random Oracles ⋮ SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions ⋮ Tightly secure signatures and public-key encryption ⋮ Targeted lossy functions and applications ⋮ Standard Security Does Not Imply Indistinguishability Under Selective Opening ⋮ Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts ⋮ Regular lossy functions and their applications in leakage-resilient cryptography ⋮ Efficient chameleon hash functions in the enhanced collision resistant model ⋮ Tightly CCA-secure identity-based encryption with ciphertext pseudorandomness ⋮ Simulation-based selective opening security for receivers under chosen-ciphertext attacks ⋮ Cumulatively all-lossy-but-one trapdoor functions from standard assumptions ⋮ Compact and tightly selective-opening secure public-key encryption schemes ⋮ Simulation-based bi-selective opening security for public key encryption ⋮ Possibility and impossibility results for receiver selective opening secure PKE in the multi-challenge setting ⋮ Receiver selective opening security for identity-based encryption in the multi-challenge setting ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ All-but-many encryption ⋮ Sender-Equivocable Encryption Schemes Secure against Chosen-Ciphertext Attacks Revisited ⋮ Practical public key encryption with selective opening security for receivers ⋮ Non-malleability Under Selective Opening Attacks: Implication and Separation ⋮ Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography ⋮ CCA-security from adaptive all-but-one lossy trapdoor functions ⋮ Sender-equivocable encryption schemes secure against chosen-ciphertext attacks revisited ⋮ Deterministic Public-Key Encryption Under Continual Leakage ⋮ Insight of the protection for data security under selective opening attacks ⋮ IBE with tight security against selective opening and chosen-ciphertext attacks

This page was built for publication: All-But-Many Lossy Trapdoor Functions