scientific article
From MaRDI portal
zbMath0672.94004MaRDI QIDQ3826475
Jeroen van de Graaf, David Chaum, Ivan B. Damgård
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
protocolencryptionmultiparty computationbit commitment schemescommunicating probabilistic Turing machineszero knowledge proof systems
Cryptography (94A60) Parallel numerical computation (65Y05) Software, source code, etc. for problems pertaining to information and communication theory (94-04)
Related Items
ATLAS: efficient and scalable MPC in the honest majority setting, Protocols for collusion-secure asymmetric fingerprinting, The Cost of Fault Tolerance in Multi-Party Communication Complexity, Minimum disclosure proofs of knowledge, Secure multi-party computation in large networks, Secure multiparty computations without computers, Cryptographic protocols and voting, Best of both worlds. Revisiting the spymasters double agent problem, On the exact round complexity of best-of-both-worlds multi-party computation, Communication-efficient distributed oblivious transfer, Secure circuit evaluation. A protocol based on hiding information from an oracle, A discrete logarithm implementation of perfect zero-knowledge blobs, Computations with a deck of cards, Beyond honest majority: the round complexity of fair and robust multi-party computation, On the exact round complexity of secure three-party computation, On the communication complexity of zero-knowledge proofs, How to fairly reconstruct a shared secret, Guaranteed output delivery comes free in honest majority MPC, Constant-round perfect zero-knowledge computationally convincing protocols, Bit commitment using pseudorandomness
