Author:
Asharov Gilad,Lindell Yehuda,Zarosim Hila
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Lecture Notes in Computer Science;Y. Aumann,2007
2. Babaioff, M., Chuang, J., Feldman, M.: Incentives in Peer-to-Peer Systems. In: Algorithmic Game Theory, ch. 23. Cambridge University Press (2007)
3. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In: 20th STOC, pp. 1–10 (1988)
4. Lecture Notes in Computer Science;P. Bogetoft,2009
5. Lecture Notes in Computer Science;D. Bogdanov,2008
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Secure Multiparty Computation with Identifiable Abort and Fairness;2023 7th International Conference on Cryptography, Security and Privacy (CSP);2023-04
2. Reputation at Stake! A Trust Layer over Decentralized Ledger for Multiparty Computation and Reputation-Fair Lottery;Lecture Notes in Computer Science;2023
3. Data Cooperatives for Trusted News Sharing in Social Media;Blockchain Technology and Emerging Technologies;2023
4. Multi-Tier Reputation for Data Cooperatives;Mathematical Research for Blockchain Economy;2023
5. Reputation-based state machine replication;2022 IEEE 21st International Symposium on Network Computing and Applications (NCA);2022-12-14