scientific article; zbMATH DE number 4101088

MaRDI QIDQ3826475zbMATH OpenFDO

Authors David Chaum, Jeroen van de Graaf, Ivan B. Damgård

Publication date 1988

zbMATH Keywords

bit commitment schemescommunicating probabilistic Turing machinesencryptionmultiparty computationprotocolzero knowledge proof systems

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Software, source code, etc. for problems pertaining to information and communication theory (94-04) Cryptography (94A60)

Recommendations

• Publication:3210140
• Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
• On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
• Multiparty computation, an introduction
• Secure multiparty computation and secret sharing

Cited in

(25)

• Minimum disclosure proofs of knowledge
• Secure multiparty computations without computers
• On the communication complexity of zero-knowledge proofs
• Guaranteed output delivery comes free in honest majority MPC
• ATLAS: efficient and scalable MPC in the honest majority setting
• Improved signature schemes for secure multi-party computation with certified inputs
• Secure multi-party computation in large networks
• On the exact round complexity of best-of-both-worlds multi-party computation
• The cost of fault tolerance in multi-party communication complexity
• Communication-efficient distributed oblivious transfer
• Protocols for collusion-secure asymmetric fingerprinting (extended abstract)
• How to fairly reconstruct a shared secret
• On the exact round complexity of secure three-party computation
• Computations with a deck of cards
• Beyond honest majority: the round complexity of fair and robust multi-party computation
• Cryptographic protocols and voting
• Best of both worlds. Revisiting the spymasters double agent problem
• Threshold secret sharing with geometric algebras
• Broadcast-optimal four-round MPC in the plain model
• Broadcast-optimal secure computation from black-box oblivious transfer
• On achieving ``best-in-the-multiverse MPC
• Constant-round perfect zero-knowledge computationally convincing protocols
• Bit commitment using pseudorandomness
• Secure circuit evaluation. A protocol based on hiding information from an oracle
• A discrete logarithm implementation of perfect zero-knowledge blobs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3826475)