Fair and efficient secure multiparty computation with reputation systems

DOI10.1007/978-3-642-42045-0_11zbMATH Open1314.94052OpenAlexW128784951MaRDI QIDQ2867153FDOQ2867153

Authors: Gilad Asharov, Yehuda Lindell, Hila Zarosim 

Publication date: 10 December 2013

Published in: Advances in Cryptology - ASIACRYPT 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-42045-0_11

Recommendations

• Practical, anonymous, and publicly linkable universally-composable reputation systems
• Uncheatable Reputation for Distributed Computation Markets
• Privacy-preserving and co-utile distributed social credit
• A new approach to modelling centralised reputation systems
• Signatures of reputation. (Extended abstract)

zbMATH Keywords

reputation systemssecure multiparty computationnew models

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cited In (5)

• Privacy-preserving and co-utile distributed social credit
• Reputation at stake! A trust layer over decentralized ledger for multiparty computation and reputation-fair lottery
• Uncheatable Reputation for Distributed Computation Markets
• Proof-of-reputation blockchain with Nakamoto fallback
• Practical, anonymous, and publicly linkable universally-composable reputation systems

This page was built for publication: Fair and efficient secure multiparty computation with reputation systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867153)