Cryptographic Soundness
Cryptographic Soundness is a property of interactive proof systems in which the probability that a computationally bounded verifier accepts a false statement is negligible, under the assumption that certain cryptographic primitives are secure.
38
Publications
2.1K
Citations
77
Authors
64
Institutions
Publications per year
2017–2026
5
Parents
38
An elementary introduction to hyperelliptic curves
Alfred Menezes, Yihong Wu, Robert Zuccherato · 1996 · 137 citations
Protocol failures in cryptosystems
Judy Moore · Proceedings of the IEEE · 1988 · 126 citations
1–5 of 38
77
8
h-index
4
h-index
3
h-index
3
h-index
2
h-index
1–5 of 77
64

Saarland University
Saarbrücken, Germany
8 h-index
11 publications
360 citations
Max Planck Institute for Software Systems
Saarbrücken, Germany
5 h-index
5 publications
135 citations
University of Tartu
Tartu, Estonia
3 h-index
3 publications
78 citations
IBM Research - Zurich
Rüschlikon, Switzerland
3 h-index
4 publications
197 citations
University of California, Davis
Davis, United States
2 h-index
2 publications
166 citations

University of Bristol
Bristol, United Kingdom
2 h-index
2 publications
30 citations
Sandia National Laboratories California
Livermore, United States
2 h-index
2 publications
138 citations
California University of Pennsylvania
California, United States
2 h-index
3 publications
128 citations
1–8 of 64
2 publications · 163 citations
2
h-index
2 publications · 38 citations
2
h-index
JISA · 1 publications · 34 citations
1
h-index
1 publications · 38 citations
1
h-index
1 publications · 21 citations
1
h-index
1–5