Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds

Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti

Published Jan 1, 2017• 26 citations
Publisher
DOI
10.1007/978-3-319-70500-2_24

Related papers

Multi-party Coin-Tossing and Non-malleable-Zero-Knowledge

Michele Ciampi, Luisa Siniscalchi

Information security and cryptography•Aug 21, 2025•0 citations

Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation

Yehuda Lindell

Lecture notes in computer science•Jan 1, 2001•75 citations

Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation

Yehuda Lindell

Journal of Cryptology•Jun 1, 2003•153 citations

Concurrent Non-Malleable Zero Knowledge with Adaptive Inputs

Huijia Lin, Rafael Pass

Lecture notes in computer science•Jan 1, 2011•12 citations

Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model

Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti

Lecture notes in computer science•Aug 12, 2008•28 citations

Game Theory Does Not Always Help: The Case of Statistical Multi-party Coin Tossing

Chen-Da Liu-Zhang, Elisaweta Masserova, João Ribeiro +1 more

Lecture notes in computer science•Jan 1, 2026•0 citations