Detection of Disrupters in the DC Protocol

Bos, Jurjen; Boer, Bert den

doi:10.1007/3-540-46885-4_33

Cited by 33 publications

(28 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It was shown in [25] how to set up a PSS using global broadcast channels, where the dining-cryptographers protocol [5,4] was used. Obtaining a PSS from a common random source was considered in [15,16], but only with respect to three players and one particular probability distribution.…”

Section: Pseudo-signature Schemes (Pss)mentioning

confidence: 99%

Pseudo-signatures, Broadcast, and Multi-party Computation from Correlated Randomness

Fitzi

Wolf

Wullschleger

2004

Advances in Cryptology – CRYPTO 2004

View full text Add to dashboard Cite

Abstract. Unconditionally secure multi-party computations in general, and broadcast in particular, are impossible if any third of the players can be actively corrupted and if no additional information-theoretic primitive is given. In this paper, we relativize this pessimistic result by showing that such a primitive can be as simple as noisy communication channels between the players or weakly correlated pieces of information. We consider the scenario where three players have access to random variables X, Y , and Z, respectively, and give the exact condition on the joint distribution PXY Z under which unconditional broadcast is possible. More precisely, we show that this condition characterizes the possibility of realizing so-called pseudo-signatures between the players. As a consequence of our results, we can give conditions for the possibility of achieving unconditional broadcast between n players and any minority of cheaters and, hence, general multi-party computation under the same condition.

show abstract

Section: Pseudo-signature Schemes (Pss)mentioning

confidence: 99%

Pseudo-signatures, Broadcast, and Multi-party Computation from Correlated Randomness

Fitzi

Wolf

Wullschleger

2004

Advances in Cryptology – CRYPTO 2004

View full text Add to dashboard Cite

show abstract

“…We make use of an Untraceable Sending protocol as introduced by [Cha88] and further elaborated by [BB89] and [pfi891.…”

Section: Introductionmentioning

confidence: 99%

Unconditionally-Secure Digital Signatures

Chaum

Roijakkers

Advances in Cryptology-Crypt0’ 90

View full text Add to dashboard Cite

Abstract. All known digital signature schemes can be forged by anyone having enough computing power. For a finite set of participants, we can overcome this Wealaress.We present a polynomial time protocol in which a participant can convince (with an exponentially small error probability) any other participant that his signature is valid. Moreover, such a convinced participant can convince any other participant of the signature's validity, without inreraction with the original signer.An extension allows. in most cases, a participant who receives a signature from any source to convince each other participant of its validity. If a participant cannot use the signahue to convince others, he knows so when he receives it

show abstract

“…(See [14] for a good bibliography.) DC-nets, by contrast, have remained relatively neglected, apart from a small scattering of papers, e.g., [1,2,11,21,22]. One reason for this is perhaps that DC-nets, unlike mixnets, cannot operate by proxy; in particular, the players operating a DC-net must be identical with those providing input.…”

Section: Introductionmentioning

confidence: 99%

Dining Cryptographers Revisited

Golle

Juels²

2004

Lecture Notes in Computer Science

123

142

View full text Add to dashboard Cite

Abstract. Dining cryptographers networks (or DC-nets) are a privacypreserving primitive devised by Chaum for anonymous message publication. A very attractive feature of the basic DC-net is its non-interactivity. Subsequent to key establishment, players may publish their messages in a single broadcast round, with no player-to-player communication. This feature is not possible in other privacy-preserving tools like mixnets. A drawback to DC-nets, however, is that malicious players can easily jam them, i.e., corrupt or block the transmission of messages from honest parties, and may do so without being traced. Several researchers have proposed valuable methods of detecting cheating players in DC-nets. This is usually at the cost, however, of multiple broadcast rounds, even in the optimistic case, and often of high computational and/or communications overhead, particularly for fault recovery. We present new DC-net constructions that simultaneously achieve noninteractivity and high-probability detection and identification of cheating players. Our proposals are quite efficient, imposing a basic cost that is linear in the number of participating players. Moreover, even in the case of cheating in our proposed system, just one additional broadcast round suffices for full fault recovery. Among other tools, our constructions employ bilinear maps, a recently popular cryptographic technique for reducing communication complexity.

show abstract

Detection of Disrupters in the DC Protocol

Cited by 33 publications

References 2 publications

Pseudo-signatures, Broadcast, and Multi-party Computation from Correlated Randomness

Pseudo-signatures, Broadcast, and Multi-party Computation from Correlated Randomness

Unconditionally-Secure Digital Signatures

Dining Cryptographers Revisited

Contact Info

Product

Resources

About