Cryptographic Reductions
Cryptographic Reductions is a proof technique in computational complexity theory that establishes the relative security of cryptographic primitives by demonstrating that breaking one primitive can be efficiently transformed into breaking another, thereby equating their hardness assumptions.
74
Publications
6.5K
Citations
158
Authors
91
Institutions
Publications per year
2017–2026
10
Parents
74
A concrete security treatment of symmetric encryption
Mihir Bellare, Anand Desai, E. Jokipii et al. · 2002 · 925 citations
On the concrete hardness of Learning with Errors
M. Albrecht, Rachel Player, Sam Scott · Journal of Mathematical Cryptology · 2015 · 789 citations · Full text
Classical hardness of learning with errors
Zvika Brakerski, Adeline Roux-Langlois, Chris Peikert et al. · 2013 · 597 citations
RSA and Rabin Functions: Certain Parts are as Hard as the Whole
Werner Alexi, Benny Chor, Oded Goldreich et al. · SIAM Journal on Computing · 1988 · 342 citations
1–5 of 74
158
4
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 158
91
Stanford University
Stanford, United States
4 h-index
4 publications
1.2K citations
KU Leuven
Leuven, Belgium
4 h-index
8 publications
247 citations

University of Waterloo
Waterloo, Canada
3 h-index
4 publications
109 citations
University of California, Davis
Davis, United States
3 h-index
3 publications
981 citations
The University of Texas at Austin
Austin, United States
3 h-index
4 publications
200 citations

Weizmann Institute of Science
Rehovot, Israel
3 h-index
3 publications
392 citations
University of Washington
Seattle, United States
3 h-index
3 publications
77 citations

Tel Aviv University
Tel Aviv, Israel
3 h-index
3 publications
460 citations
1–8 of 91
Repository · 13 publications · 265 citations
11
h-index
6 publications · 959 citations
6
h-index
4 publications · 210 citations
4
h-index
JMC · 3 publications · 842 citations
3
h-index
2 publications · 21 citations
2
h-index
1–5