Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Nicholas Stifter

dblp:202/7551 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
2since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 4 · 1 first-author · 2 since 2021Systems, architecture and hardware · 1 · 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
2 papers
Cryptographic protocols and secure computation · 63% Cryptographic primitives and cryptanalysis · 29% Blockchain and cryptocurrency security · 8%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation
distributed randomness
0.512021
RandRunner: Distributed Randomness from Trapdoor VDFs with Strong Uniqueness · NDSS 2021
Cryptographic primitives and cryptanalysis › timed cryptography
verifiable delay functions
0.512021
RandRunner: Distributed Randomness from Trapdoor VDFs with Strong Uniqueness · NDSS 2021
Cryptographic protocols and secure computation › secret sharing › verifiable secret sharing
publicly verifiable secret sharing
0.412020
HydRand: Efficient Continuous Distributed Randomness · SP 2020
Distributed systems › distributed algorithms
distributed randomness
0.412020
HydRand: Efficient Continuous Distributed Randomness · SP 2020
Distributed systems › distributed algorithms › distributed randomness
distributed randomness beacon
0.412020
HydRand: Efficient Continuous Distributed Randomness · SP 2020
Cryptographic protocols and secure computation › distributed randomness
randomness beacon
0.112021
RandRunner: Distributed Randomness from Trapdoor VDFs with Strong Uniqueness · NDSS 2021
Blockchain and cryptocurrency security › consensus protocol
proof-of-stake
0.112020
HydRand: Efficient Continuous Distributed Randomness · SP 2020

Methods — techniques the papers use, named apart from their topics

protocol design · 0.9complexity analysis · 0.9trapdoor VDF · 0.5
YearPublicationVenuePosition
2022 Opportunistic Algorithmic Double-Spending: - How I Learned to Stop Worrying and Love the Fork
Nicholas Stifter, Aljosha Judmayer, Philipp Schindler, Edgar R. Weippl
ESORICS (1)1
2021 RandRunner: Distributed Randomness from Trapdoor VDFs with Strong Uniqueness
Philipp Schindler, Aljosha Judmayer, Markus Hittmeir, Nicholas Stifter, Edgar R. Weippl
NDSS4
2020 HydRand: Efficient Continuous Distributed Randomness
abstract
A reliable source of randomness is not only an essential building block in various cryptographic, security, and distributed systems protocols, but also plays an integral part in the design of many new blockchain proposals. Consequently, the topic of publicly-verifiable, bias-resistant and unpredictable randomness has recently enjoyed increased attention. In particular random beacon protocols, aimed at continuous operation, can be a vital component for current Proof-of-Stake based distributed ledger proposals. We improve upon previous random beacon approaches with HydRand, a novel distributed protocol based on publicly-verifiable secret sharing (PVSS) to ensure unpredictability, bias-resistance, and public-verifiability of a continuous sequence of random beacon values. Furthermore, HydRand provides guaranteed output delivery of randomness at regular and predictable intervals in the presence of adversarial behavior and does not rely on a trusted dealer for the initial setup. Compared to existing PVSS based approaches that strive to achieve similar properties, our solution improves scalability by lowering the communication complexity from $\mathcal{O}\left( {{n^3}} \right)$ to $\mathcal{O}\left( {{n^2}} \right)$ . Furthermore, we are the first to present a detailed comparison of recently described schemes and protocols that can be used for implementing random beacons.
Philipp Schindler, Aljosha Judmayer, Nicholas Stifter, Edgar R. Weippl
SP3
2019 Avoiding Risky Designs When Using Blockchain Technologies in Cyber-Physical Systems
abstract
Blockchain has been hailed as an emerging technology with the potential to cause significant impact in a variety of fields. One domain is an application in cyber-physical systems (CPSs), e.g., as a building block for the (Industrial) Internet of Things (IIoT) and Industry 4.0. In this regard, various use cases and designs have been proposed that seek to leverage the desirable properties blockchain technologies seem to offer. While many of the principles behind blockchain have actually been studied under the veil of Byzantine fault tolerance for decades, some approaches, such as relying on game-theoretic incentives and proof-of-work (PoW), are not yet fully understood. This knowledge gap can leave both practitioners and researchers in a difficult position regarding a possible application of such technologies, as it is often unclear what guarantees and characteristics a particular blockchain design actually achieves. This work-in-progress paper provides an overview of blockchain security research, outlines system designs that are likely to exhibit vulnerabilities, and provides examples of potentially insecure proposals in the field of CPSs that employ such designs.
Nicholas Stifter, Matthias Eckhart, Bernhard Brenner, Edgar R. Weippl
ETFA1
2018 Proof-of-Blackouts? How Proof-of-Work Cryptocurrencies Could Affect Power Grids
Johanna Ullrich, Nicholas Stifter, Aljosha Judmayer, Adrian Dabrowski, Edgar R. Weippl
RAID2