Live briefing
Everything about Trapdoor function
One-way cryptographic tool
In theoretical computer science and cryptography, a trapdoor function is a function that is easy to compute in one direction, yet difficult to compute in the opposite direction without special information, called the "trapdoor". Trapdoor functions are a special case of one-way functions and are widely used in public-key cryptography. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Trapdoor functionA 5-minute orientation
- Skim a recent paper: Redactable Blockchain Based on Decentralized Trapdoor Verifiable Delay FunctionsInfluential work since 2022
- Pick up a classic book: Introduction to the theory of computationThe most-reprinted book on the subject
- Read the landmark paper: A composite function model for predicting the ground reaction curve on a trapdoorCited 51 times
- Go sideways: Goldwasser–Micali cryptosystemA closely related topic
- Go sideways: Factor baseA closely related topic
📖 Definitions
Noun A function that is easy to compute in one direction but difficult to compute in the opposite direction (finding its inverse) without special information.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
A composite function model for predicting the ground reaction curve on a trapdoor
Paillier's Trapdoor Function Hides up to O(n) Bits
An Aggregate Signature Scheme Based on a Trapdoor Hash Function for the Internet of Things
Efficient vehicle ownership identification scheme based on triple-trapdoor chameleon hash function
Paillier’s trapdoor function hides Θ(n) bits
A trapdoor one-way function for verifiable secret sharing
An Access Control Protocol for Wireless Sensor Network Using Double Trapdoor Chameleon Hash Function
n -Evasive all-but-many lossy trapdoor function and its constructions
🆕 Influential since 2022
Redactable Blockchain Based on Decentralized Trapdoor Verifiable Delay Functions
CCA Security and Trapdoor Functions via Key-Dependent-Message Security
Corrigendum to “A composite function model for predicting the ground reaction curve on a trapdoor” [Comput. Geotech. 141 (2022) 104496]
A message recovery attack on multivariate polynomial trapdoor function
Communication-friendly threshold trapdoor function from weaker assumption for distributed cryptography
📚 Books worth reading
Introduction to the theory of computationMichael Sipser · 1996
Public-Key Cryptography – PKC 2013Kaoru Kurosawa · 2013
The souterrains of IrelandMark Clinton · 2001
Advances in Cryptology – ASIACRYPT 2012Xiaoyun Wang · 2012
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Goldwasser–Micali cryptosystem The Goldwasser–Micali (GM) cryptosystem is an asymmetric key encryption algorithm developed by Shafi Goldwasser and Silvio Micali in 1982. GM has the distinctio…
- Factor base In computational number theory, a factor base is a small set of prime numbers commonly used as a mathematical tool in algorithms involving extensive sieving…
- Benaloh cryptosystem The Benaloh Cryptosystem is an extension of the Goldwasser-Micali cryptosystem (GM) created in 1985 by Josh (Cohen) Benaloh. The main improvement of the…
- Blum–Goldwasser cryptosystem The Blum–Goldwasser (BG) cryptosystem is an asymmetric key encryption algorithm proposed by Manuel Blum and Shafi Goldwasser in 1984. Blum–Goldwasser is…
- Dixon's factorization method In number theory, Dixon's factorization method (also Dixon's random squares method or Dixon's algorithm) is a general-purpose integer factorization algorithm;…
- ElGamal signature scheme The ElGamal signature scheme is a digital signature scheme which is based on the difficulty of computing discrete logarithms. It was described by Taher…
- Feige–Fiat–Shamir identification scheme In cryptography, the Feige–Fiat–Shamir identification scheme is a type of parallel zero-knowledge proof developed by Uriel Feige, Amos Fiat, and Adi Shamir…
- Lucas primality test In computational number theory, the Lucas test is a primality test for a natural number n; it requires that the prime factors of n − 1 be already known…