Practical, anonymous, and publicly linkable universally-composable reputation systems

DOI10.1007/978-3-319-76953-0_25MaRDI QIDQ2287547zbMATH OpenOpenAlexFDO

Authors Johannes Blömer, Fabian Eidens, Jakob Juhnke

Publication date 21 January 2020

Full work available at URL https://doi.org/10.1007/978-3-319-76953-0_25

zbMATH Keywords

anonymityreputationtrustuniversal composability

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• An Anonymous Reputation System with Reputation Secrecy for Manager
• Signatures of reputation. (Extended abstract)
• A new approach to modelling centralised reputation systems
• Trust Management
• Fair and efficient secure multiparty computation with reputation systems

Cited in

(16)

• Privacy-preserving and co-utile distributed social credit
• Anonymity and rewards in peer rating systems
• Proof-of-reputation blockchain with Nakamoto fallback
• Fair and efficient secure multiparty computation with reputation systems
• Provably linkable trading
• An Anonymous Reputation System with Reputation Secrecy for Manager
• ARBRA: Anonymous Reputation-Based Revocation with Efficient Authentication
• Uncheatable Reputation for Distributed Computation Markets
• Signatures of reputation. (Extended abstract)
• scientific article; zbMATH DE number 1893215 (Why is no real title available?)
• Trust Management
• Attribute-based signatures for range of inner product and its applications
• Homomorphic signatures for subset and superset mixed predicates and its applications
• A generic construction of an anonymous reputation system and instantiations from lattices
• Anonymous reputation systems with revocation, revisited
• Anonymous reputation systems with revocation, revisited

This page was built for publication: Practical, anonymous, and publicly linkable universally-composable reputation systems

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