Multiparty unconditionally secure protocols
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.
this paper
works it cites
works citing it
node size = global citations · hover for the full title
Citation edge evidence
- L -diversity→Multiparty unconditionally secure protocolsLegacy edge — source detail unavailable
- Completeness theorems for non-cryptographic fault-tolerant distributed computation→Multiparty unconditionally secure protocolsLegacy edge — source detail unavailable
- Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing→Multiparty unconditionally secure protocolsLegacy edge — source detail unavailable
- L-diversity: privacy beyond k-anonymity→Multiparty unconditionally secure protocolsLegacy edge — source detail unavailable
- Security and Composition of Multiparty Cryptographic Protocols→Multiparty unconditionally secure protocolsLegacy edge — source detail unavailable
- Multiparty unconditionally secure protocols→How to share a secretLegacy edge — source detail unavailable
- Multiparty unconditionally secure protocols→The Byzantine Generals ProblemLegacy edge — source detail unavailable
- Multiparty unconditionally secure protocols→Protocols for secure computationsLegacy edge — source detail unavailable
- Multiparty unconditionally secure protocols→Protocols for secure computationsLegacy edge — source detail unavailable
- Multiparty unconditionally secure protocols→Completeness theorems for non-cryptographic fault-tolerant distributed computationLegacy edge — source detail unavailable
- Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing→Completeness theorems for non-cryptographic fault-tolerant distributed computationLegacy edge — source detail unavailable
- Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing→How to share a secretLegacy edge — source detail unavailable
- Security and Composition of Multiparty Cryptographic Protocols→Completeness theorems for non-cryptographic fault-tolerant distributed computationLegacy edge — source detail unavailable
- Security and Composition of Multiparty Cryptographic Protocols→Protocols for secure computationsLegacy edge — source detail unavailable
- Completeness theorems for non-cryptographic fault-tolerant distributed computation→How to share a secretLegacy edge — source detail unavailable
- L -diversity→Completeness theorems for non-cryptographic fault-tolerant distributed computationLegacy edge — source detail unavailable
- L -diversity→L-diversity: privacy beyond k-anonymityLegacy edge — source detail unavailable
- L-diversity: privacy beyond k-anonymity→Completeness theorems for non-cryptographic fault-tolerant distributed computationLegacy edge — source detail unavailable
- L-diversity: privacy beyond k-anonymity→L -diversityLegacy edge — source detail unavailable
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
Links
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
sha256 b3024609427ad450…