How to build a trapdoor function from an encryption scheme

DOI10.1007/978-3-030-92078-4_8zbMATH Open1514.94086OpenAlexW3215495595MaRDI QIDQ6157550FDOQ6157550

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

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

zbMATH Keywords

collusion-resistant attribute-based TDFtrapdoor garbling scheme

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

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

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)