Demo Data from EDBT 2026 / reviewers in the wild / expert
Stanislav Smyshlyaev
dblp:06/10309 · also Stanislav V. Smyshlyaev
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2020
0000-0001-8586-5959ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 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
1 paper |
Cryptographic primitives and cryptanalysis · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis
boolean functions |
0.1 | 1 | 2012 | Perfectly Balanced Boolean Functions and Golić Conjecture · J. Cryptol. 2012 |
Cryptographic primitives and cryptanalysis
stream cipher |
0.0 | 1 | 2012 | Perfectly Balanced Boolean Functions and Golić Conjecture · J. Cryptol. 2012 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Limiting the impact of unreliable randomness in deployed security protocolsabstractMany cryptographic mechanisms depend upon the availability of securely generated random numbers. In practice, the sources of random numbers can be unreliable for many reasons, including bugs, compromise or subversion of standards. While there exist ways to significantly reduce the impact of unreliable randomness, these typically do not work well with practical constraints, such as long-term keys stored in hardware security modules. In practice, even modern protocols like TLS 1.3 lack such mechanisms and are therefore highly vulnerable to unreliable randomness. We propose a wrapper construction that reduces the impact of untrusted randomness, and which is is compatible with, and effective in, existing deployments of protocols such as TLS. We provide a security analysis of the construction and elaborate on design choices and practical interpretations. Our findings show that it is possible to effectively harden deployed protocols against unreliable randomness. Liliya R. Akhmetzyanova, Cas Cremers, Luke Garratt, Stanislav Smyshlyaev, Nick Sullivan |
CSF | 4 |
| 2012 | Perfectly Balanced Boolean Functions and Golić Conjecture
Stanislav Smyshlyaev |
J. Cryptol. | 1 |