![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Securing Proof-of-Stake Blockchain Protocols
Proof-of-Stake (PoS) protocols have been actively researched for the past five years. PoS finds direct applicability in open blockchain platforms and has been seen as a strong candidate to replace the largely ...
-
Chapter and Conference Paper
Assisting Server for Secure Multi-Party Computation
Distributed threats like botnets are among the most serious threats in the Internet. Due to their distributed nature, these attacks are difficult to detect in an early stage without the collaboration of severa...
-
Chapter and Conference Paper
Relations Among Privacy Notions
This paper presents a hierarchy of privacy notions that covers multiple anonymity and unlinkability variants. The underlying definitions, which are based on the idea of indistinguishability between two worlds,...
-
Article
Key-Substitution-Angriffe und das Signaturgesetz
Der vorliegende Beitrag widerlegt die gängige Annahme, nahezu jedes kryptographische Signaturverfahren erfülle die Anforderungen an fortgeschrittene elektronische Signaturen. Auch Algorithmen, die nach übliche...
-
Article
Secure group key establishment revisited
We examine the popular proof models for group key establishment of Bresson et al. (LNCS 2248: 290–309, 2001; Proceedings of the 8th ACM conference on computer and communications security (CCS-8), 2001) and poi...
-
Chapter and Conference Paper
A Subliminal-Free Variant of ECDSA
A mode of operation of the Elliptic Curve Digital Signature Algorithm (ECDSA) is presented which provably excludes subliminal communication through ECDSA signatures. For this, the notion of a signature scheme ...
-
Chapter and Conference Paper
Bingo Voting: Secure and Coercion-Free Voting Using a Trusted Random Number Generator
It is debatable if current direct-recording electronic voting machines can sufficiently be trusted for a use in elections. Reports about malfunctions and possible ways of manipulation abound. Voting schemes ha...
-
Chapter and Conference Paper
(Password) Authenticated Key Establishment: From 2-Party to Group
A protocol compiler is described, that transforms any provably secure authenticated 2-party key establishment into a provably secure authenticated group key establishment with 2 more rounds of communication. T...
-
Article
Key substitution attacks revisited: Taking into account malicious signers
Given a signature sfor some message malong with a corresponding public verification key yin a key substitution attack an attacker derives another verification key \(\overline{y}\) ...
-
Chapter and Conference Paper
A Framework for Robust Group Key Agreement
Considering a protocol of Tseng, we show that a group key agreement protocol that resists attacks by malicious insiders in the authenticated broadcast model, loses this security when it is transfered into an u...
-
Chapter and Conference Paper
Deniable Group Key Agreement
Especially for key establishment protocols to be used in internet applications, the (privacy) concern of deniability arises: Can a protocol transcript be used—possibly by a participant—to prove the involvement of...
-
Chapter and Conference Paper
Towards Provably Secure Group Key Agreement Building on Group Theory
Known proposals for key establishment schemes based on combinatorial group theory are often formulated in a rather informal manner. Typically, issues like the choice of a session identifier and parallel protoc...
-
Article
Weak Keys in MST1
The public key cryptosystem MST1 has been introduced by Magliveras et al. [12] (Public Key Cryptosystems from Group Factorizations. Jatra Mountain Mathematical Publications). Its security relies on the hardness o...
-
Chapter and Conference Paper
Fairness and Correctness in Case of a Premature Abort
When using cryptographic protocols for security critical applications premature abort is a serious threat. We define two important properties called quit fairness and quit correctness for protocols to resist a...
-
Chapter and Conference Paper
On Subliminal Channels in Deterministic Signature Schemes
Subliminal channels in randomized signature algorithms like the DSA are well-known. However, much less seems to be known about this issue when dealing with deterministic schemes. Using some known signature sch...