All-but-many lossy trapdoor functions

DOI10.1007/978-3-642-29011-4_14MaRDI QIDQ2894409zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• All-but-many lossy trapdoor functions from lattices and applications
• CCA-security from adaptive all-but-one lossy trapdoor functions
• SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions
• All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE
• Chameleon all-but-one TDFs and their application to chosen-ciphertext security

Cited in

(39)

• Paillier's trapdoor function hides up to O(n) bits
• Lossy Trapdoor Functions and Their Applications
• SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions
• Tightly CCA-secure identity-based encryption with ciphertext pseudorandomness
• Practical public key encryption with selective opening security for receivers
• All-but-many encryption
• Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
• All-but-many lossy trapdoor functions from lattices and applications
• Deterministic Public-Key Encryption Under Continual Leakage
• Tightly secure signatures and public-key encryption
• Regular lossy functions and their applications in leakage-resilient cryptography
• Targeted lossy functions and applications
• Lossy algebraic filters with short tags
• Simulation-based selective opening security for receivers under chosen-ciphertext attacks
• Sender-equivocable encryption schemes secure against chosen-ciphertext attacks revisited
• Algebraic partitioning: fully compact and (almost) tightly secure cryptography
• Efficient chameleon hash functions in the enhanced collision resistant model
• Chameleon all-but-one TDFs and their application to chosen-ciphertext security
• Simulation-based bi-selective opening security for public key encryption
• Compact and tightly selective-opening secure public-key encryption schemes
• CCA-security from adaptive all-but-one lossy trapdoor functions
• Compact selective opening security from LWE
• Selective opening security in the quantum random oracle model, revisited
• Insight of the protection for data security under selective opening attacks
• IBE with tight security against selective opening and chosen-ciphertext attacks
• Sender-equivocable encryption schemes secure against chosen-ciphertext attacks revisited
• Toward RSA-OAEP without random oracles
• Lossy cryptography from code-based assumptions
• Compact Lossy and All-but-One Trapdoor Functions from Lattice
• Possibility and impossibility results for receiver selective opening secure PKE in the multi-challenge setting
• All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE
• Receiver selective opening security for identity-based encryption in the multi-challenge setting
• Cumulatively all-lossy-but-one trapdoor functions from standard assumptions
• Non-malleability under selective opening attacks: implication and separation
• Standard security does not imply indistinguishability under selective opening
• Public-key encryption with simulation-based selective-opening security and compact ciphertexts
• General construction of chameleon all-but-one trapdoor functions
• Identity-based lossy trapdoor functions: new definitions, hierarchical extensions, and implications
• Regularly lossy functions and applications

This page was built for publication: All-but-many lossy trapdoor functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2894409)