Resource Fairness and Composability of Cryptographic Protocols-Reference-Cited by-同舟云学术

Resource Fairness and Composability of Cryptographic Protocols

Published:2010-09-21 Issue:4 Volume:24 Page:615-658
ISSN:0933-2790
Container-title:Journal of Cryptology
language:en
Short-container-title:J Cryptol

Author:

Garay Juan A.,MacKenzie Philip,Prabhakaran Manoj,Yang Ke

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,Software

Link

http://link.springer.com/content/pdf/10.1007/s00145-010-9080-z.pdf

Reference58 articles.

1. L. Adleman, K. Kompella, Using smoothness to achieve parallelism, in Proceedings of the 20th ACM Symposium on the Theory of Computing (1988), pp. 528–538

2. N. Asokan, V. Shoup, M. Waidner, Optimistic fair exchange of digital signatures (extended abstract), in EUROCRYPT 1998 (1998), pp. 591–606

3. LNCS;M. Backes,2004

4. D. Beaver, S. Goldwasser, Multiparty computation with faulty majority, in 30th FOCS (1990), pp. 503–513

5. LNCS;J. Benaloh,1994

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

1. Proof-of-Work-Based Consensus in Expected-Constant Time;Lecture Notes in Computer Science;2024

2. Synchronizable Fair Exchange;Theory of Cryptography;2023

3. Optimally Efficient Multi-party Fair Exchange and Fair Secure Multi-party Computation;ACM Transactions on Privacy and Security;2022-02-28

4. Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes;Lecture Notes in Computer Science;2022

5. Cryptographic and Financial Fairness;IEEE Transactions on Information Forensics and Security;2022