Efficient generation of shared RSA keys
Journal of the ACM (JACM)
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Robust and Efficient Sharing of RSA Functions
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Supporting Trust in Virtual Communities
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 6 - Volume 6
Untraceable Secret Credentials: Trust Establishment with Privacy
PERCOMW '04 Proceedings of the Second IEEE Annual Conference on Pervasive Computing and Communications Workshops
STRUDEL: supporting trust in the dynamic establishment of peering coalitions
Proceedings of the 2006 ACM symposium on Applied computing
Using Trust for Secure Collaboration in Uncertain Environments
IEEE Pervasive Computing
Practical threshold signatures
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
B-Trust: bayesian trust framework for pervasive computing
iTrust'06 Proceedings of the 4th international conference on Trust Management
Trust transfer: encouraging self-recommendations without sybil attack
iTrust'05 Proceedings of the Third international conference on Trust Management
Design and implementation of S-MARKS: A secure middleware for pervasive computing applications
Journal of Systems and Software
Journal of Systems and Software
B-Trust: bayesian trust framework for pervasive computing
iTrust'06 Proceedings of the 4th international conference on Trust Management
| Hi-index | 0.00 |
Mobile devices may share resources even in the presence of untrustworthy devices. To do so, each device may use a computational model that on input of reputation information produces trust assessments. Based on such assessments, the device then decides with whom to share: it will likely end up sharing only with the most trustworthy devices, thus isolating the untrustworthy ones. All of this is, however, theoretical in the absence of a general and distributed authentication mechanism. Currently, distributed trust frameworks do not offer an authentication mechanism that supports user privacy, whilst being resistant to “Sybil attacks”. To fill the gap, we first analyze the general attack space that relates to anonymous authentication as it applies to distributed trust models. We then put forward a scheme that is based on blinded threshold signature: collections of devices certify pseudonyms without seeing them and without relying on a central authority. We finally discuss how the scheme tackles the authentication attacks.