Trapdoor function

Known as: Trapdoor (disambiguation), Trapdoor permutation, One-way cipher 
A trapdoor function is a function that is easy to compute in one direction, yet difficult to compute in the opposite direction (finding its inverse… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
In 1992, A. Hiltgen [1] provided the first constructions of provably (slightly) secure cryptographic primitives, namely feebly… (More)
Is this relevant?
Highly Cited
2008
Highly Cited
2007
Highly Cited
2007
We show how to construct a variety of "trapdoor" cryptographic tools assuming the worst-case hardness of standard lattice… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
An aggregate signature scheme (recently proposed by Boneh, Gentry, Lynn and Shacham) is a method for combining n signatures from… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
At Eurocrypt ’02 Cramer and Shoup [7] proposed a general paradigm to construct practical public-key cryptosystems secure against… (More)
Is this relevant?
2002
2002
At EuroCrypt '99 Paillier proposed a new encryption scheme based on higher residuosity classes. The new scheme was proven to be… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We define the primitive of function sharing, a functional analog of secret sharing, and employ it to construct novel… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Much research in theoretical cryptography has been centered around finding the weakest possible cryptographic assumptions… (More)
Is this relevant?
Highly Cited
1978
Highly Cited
1978
Compressibiity of individuai sequences by the ciam of generaihd finite-atate information-losales encoders ia investigated These… (More)
Is this relevant?