Multiparty unconditionally secure protocols

1988 · 1,550 citations · 5 from inside this corpus

David Chaum, Claude Crépeau, Ivan Damgård

The source holds an abstract for this work, but its best open-access copy is under no open licence, which does not permit us to republish the text. Read it at the source below.

10 of 10 neighbouring works in this corpus. Blue is what this paper cites; orange is what cites it, and a dashed line is one neighbour citing another. Only the largest labels are drawn — every node carries its full title on hover.

this paper works it cites works citing it node size = global citations · hover for the full title

What this paper cites, inside the corpus

Paper	Year	Cited
How to share a secret	1979	13,642
The Byzantine Generals Problem	1982	6,037
Protocols for secure computations	1982	3,069
Protocols for secure computations	1982	2,727
Completeness theorems for non-cryptographic fault-tolerant distributed computation	1988	2,542

What cites it, inside the corpus

Paper	Year	Cited
L -diversity	2007	3,628
Completeness theorems for non-cryptographic fault-tolerant distributed computation	1988	2,542
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing	2007	2,450
L-diversity: privacy beyond k-anonymity	2006	2,385
Security and Composition of Multiparty Cryptographic Protocols	2000	1,424

Links

DOI · OpenAlex record

Topics

Cryptography and Data Security	Computer Science
Advanced Authentication Protocols Security	Computer Science
Cryptographic Implementations and Security	Computer Science

Is this record sound?

complete

Nothing in this record contradicts itself and no field we check is missing.

supports3 author record(s) attached.
supports16 reference(s) recorded.
neutralThe DOI carries no year to check against.
supportsA title is present.

Provenance

Everything above was read from one stored OpenAlex payload, fetched 2026-09-04T03:58:57+00:00.

sha256 b3024609427ad450…