Security Reductions
Security Reductions is a formal method in cryptography that belongs to the class of proof techniques used to establish the security of cryptographic schemes, distinguished by its demonstration that breaking the scheme’s security implies solving a computationally hard mathematical problem, thereby linking the scheme’s security to the assumed hardness of the underlying problem.
95
Publications
5.8K
Citations
209
Authors
122
Institutions
Publications per year
2017–2026
21
95
A concrete security treatment of symmetric encryption
Mihir Bellare, Anand Desai, E. Jokipii et al. · 2002 · 925 citations
The Learning with Errors Problem (Invited Survey)
Oded Regev · 2010 · 252 citations
The relationship between public key encryption and oblivious transfer
Yael Gertner, Senthil Kannan, Tal Malkin et al. · 2002 · 206 citations
1–5 of 95
209
4
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 209
122

Weizmann Institute of Science
Rehovot, Israel
6 h-index
9 publications
694 citations
University of Luxembourg
Luxembourg, Luxembourg
4 h-index
9 publications
144 citations
University of Maryland, College Park
College Park, United States
4 h-index
8 publications
886 citations
NTT (Japan)
Tokyo, Japan
3 h-index
4 publications
202 citations
IBM (United States)
Armonk, United States
3 h-index
3 publications
895 citations
University of Washington
Seattle, United States
3 h-index
3 publications
77 citations
The University of Texas at Austin
Austin, United States
3 h-index
4 publications
200 citations
Northeastern University
Boston, United States
3 h-index
4 publications
320 citations
1–8 of 122
Repository · 19 publications · 594 citations
14
h-index
11 publications · 1.4K citations
11
h-index
ToSC · 3 publications · 53 citations
3
h-index
JMC · 2 publications · 53 citations
2
h-index
2 publications · 21 citations
2
h-index
1–5