Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds-Reference-Cited by-同舟云学术

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

Published:2017 Issue: Volume: Page:711-742
ISSN:0302-9743
Container-title:Theory of Cryptography
language:
Short-container-title:

Author:

Ciampi Michele,Ostrovsky Rafail,Siniscalchi Luisa,Visconti Ivan

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-70500-2_24

Reference39 articles.

1. Lecture Notes in Computer Science;P Ananth,2017

2. Barak, B.: Constant-round coin-tossing with a man in the middle or realizing the shared random string model. In: Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), Vancouver, BC, Canada, pp. 345–355, 16–19 November 2002

3. Lecture Notes in Computer Science;M Bellare,1997

4. Blum, M.: How to prove a theorem so no one else can claim it. In: Proceedings of the International Congress of Mathematicians, pp. 1444–1454 (1986)

5. Lecture Notes in Computer Science;K-M Chung,2014

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Multiparty Strict Coin-Tossing Protocols Based on the Eigenvalue;Security and Communication Networks;2022-05-29

2. Two-Round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattices;Journal of Cryptology;2022-04

3. Round-Optimal Multi-party Computation with Identifiable Abort;Advances in Cryptology – EUROCRYPT 2022;2022

4. Round-Optimal Secure Multi-party Computation;Journal of Cryptology;2021-05-13

5. Targeted Advertising That Protects the Privacy of Social Networks Users;HUM-CENT COMPUT INFO;2021