Demo Data from EDBT 2026 / reviewers in the wild / expert
A. W. Schrift
dblp:57/6356
· DBLP profile ↗
4ranked-venue papers
3as first author
0since 2021 · last 1993
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2 · 2 first-authorTheory of computation · 2 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
3 papers |
Cryptographic primitives and cryptanalysis · 82% Cryptographic protocols and secure computation · 18% | |
| Theoretical computer science
1 paper |
Information theory · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › random number generation
randomness testing |
0.0 | 1 | 1993 | Universal Tests for Nonuniform Distributions · J. Cryptol. 1993 |
Cryptographic protocols and secure computation
commitment schemes |
0.0 | 1 | 1990 | The Discrete Log is Very Discreet · STOC 1990 |
Cryptographic primitives and cryptanalysis
one-way functions |
0.0 | 1 | 1990 | The Discrete Log is Very Discreet · STOC 1990 |
Cryptographic primitives and cryptanalysis
pseudorandom generators |
0.0 | 1 | 1990 | The Discrete Log is Very Discreet · STOC 1990 |
Cryptographic primitives and cryptanalysis
pseudorandomness |
0.0 | 1 | 1990 | On the Universality of the Next Bit Test · CRYPTO 1990 |
Information theory › probability theory
probability distributions |
0.0 | 1 | 1993 | Universal Tests for Nonuniform Distributions · J. Cryptol. 1993 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1993 | The Discrete Logarithm Modulo a Composite Hides O(n) Bits
Johan Håstad, A. W. Schrift, Adi Shamir |
J. Comput. Syst. Sci. | 2 |
| 1993 | Universal Tests for Nonuniform Distributions
A. W. Schrift, Adi Shamir |
J. Cryptol. | 1 |
| 1990 | On the Universality of the Next Bit Test
A. W. Schrift, Adi Shamir |
CRYPTO | 1 |
| 1990 | The Discrete Log is Very DiscreetabstractIn this paper we consider the one-way function fg,N(X) = gX (modN), where N is a Blum integer.We prove that under the commonly assumed intractability of factoring Blum integers, almost all its bits are individually hard, and half of them are simultaneously hard.As a result, fg,N can be used in efficient pseudo-random bit generators and multi-bit commitment schemes, where messages can be drawn according to arbitrary probability distributions. A. W. Schrift, Adi Shamir |
STOC | 1 |