How to build a trapdoor function from an encryption scheme

DOI10.1007/978-3-030-92078-4_8MaRDI QIDQ6157550zbMATH OpenOpenAlexFDO

Authors Sanjam Garg, Mohammad Hajiabadi, Giulio Malavolta, Rafail Ostrovsky

Publication date 12 May 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-92078-4_8

zbMATH Keywords

collusion-resistant attribute-based TDFtrapdoor garbling scheme

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Trapdoor functions from the computational Diffie-Hellman assumption
• New techniques for efficient trapdoor functions and applications
• Rate-1 trapdoor functions from the Diffie-Hellman problem
• Adaptive trapdoor functions and chosen-ciphertext security
• General construction of chameleon all-but-one trapdoor functions

Cites work

• scientific article; zbMATH DE number 1842494 (Why is no real title available?)
• A Provable-Security Treatment of the Key-Wrap Problem
• A method for obtaining digital signatures and public-key cryptosystems
• A note on perfect correctness by derandomization
• A proof of security of Yao's protocol for two-party computation
• Anonymous IBE, leakage resilience and circular security from new assumptions
• CCA security and trapdoor functions via key-dependent-message security
• Chosen ciphertext security from injective trapdoor functions
• Circular-Secure Encryption from Decision Diffie-Hellman
• Deterministic and Efficiently Searchable Encryption
• From selective IBE to full IBE and selective HIBE
• Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
• Functional encryption: definitions and challenges
• Hedged public-key encryption: how to protect against bad randomness
• Identity-based (lossy) trapdoor functions and applications
• Identity-based encryption from the Diffie-Hellman assumption
• Laconic oblivious transfer and its applications
• Learning with rounding, revisited. New reduction, properties and applications
• Lossy trapdoor functions and their applications
• More constructions of lossy and correlation-secure trapdoor functions
• New constructions of identity-based and key-dependent message secure encryption schemes
• New constructions of reusable designated-verifier NIZKs
• New directions in cryptography
• New techniques for efficient trapdoor functions and applications
• On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
• On lattices, learning with errors, random linear codes, and cryptography
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• Predicate encryption for circuits from LWE
• Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption
• Simple chosen-ciphertext security from low-noise LPN
• Trapdoor functions from the computational Diffie-Hellman assumption
• Trapdoor hash functions and their applications
• Trapdoors for hard lattices and new cryptographic constructions

Cited in

(5)

• Use of trapdoor structures in cryptography
• Cryptographic primitives with hinting property
• Rate-1 trapdoor functions from the Diffie-Hellman problem
• Randomness recoverable secret sharing schemes
• Cryptographic primitives with hinting property

This page was built for publication: How to build a trapdoor function from an encryption scheme

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