Security without identification: transaction systems to make big brother obsolete
Communications of the ACM
Networks without user observability—design options
Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Unconditional sender and recipient untraceability in spite of active attacks
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Detection of disrupters in the DC protocol
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
Xor-trees for efficient anonymous multicast and reception
ACM Transactions on Information and System Security (TISSEC)
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Tarzan: a peer-to-peer anonymizing network layer
Proceedings of the 9th ACM conference on Computer and communications security
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
P5: A Protocol for Scalable Anonymous Communication
SP '02 Proceedings of the 2002 IEEE Symposium on Security and Privacy
Preserving privacy in a network of mobile computers
SP '95 Proceedings of the 1995 IEEE Symposium on Security and Privacy
Local anonymity in the internet
Local anonymity in the internet
k-anonymous message transmission
Proceedings of the 10th ACM conference on Computer and communications security
pMIX: Untraceability for Small Hiding Groups.
NCA '05 Proceedings of the Fourth IEEE International Symposium on Network Computing and Applications
The pynchon gate: a secure method of pseudonymous mail retrieval
Proceedings of the 2005 ACM workshop on Privacy in the electronic society
From DC-Nets to pMIXes: Multiple Variants for Anonymous Communications
NCA '06 Proceedings of the Fifth IEEE International Symposium on Network Computing and Applications
Tor: the second-generation onion router
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)
Journal of Cryptology
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Computationally private information retrieval with polylogarithmic communication
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Single-database private information retrieval with constant communication rate
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A new k-anonymous message transmission protocol
WISA'04 Proceedings of the 5th international conference on Information Security Applications
An oblivious transfer protocol with log-squared communication
ISC'05 Proceedings of the 8th international conference on Information Security
SP 800-56A. Recommendation for Pair-Wise Key Establishment Schemes Using Discrete Logarithm Cryptography (Revised)
Real-time mixes: a bandwidth-efficient anonymity protocol
IEEE Journal on Selected Areas in Communications
Optimal configurations for peer-to-peer user-private information retrieval
Computers & Mathematics with Applications
MDAI'10 Proceedings of the 7th international conference on Modeling decisions for artificial intelligence
Computer Networks: The International Journal of Computer and Telecommunications Networking
Rational behavior in peer-to-peer profile obfuscation for anonymous keyword search
Information Sciences: an International Journal
Information Sciences: an International Journal
| Hi-index | 0.00 |
Current systems providing anonymous interactive communication are based on networks of anonymity-providing relays called MIXes. An important issue with such systems is that a MIX is able to betray its users, and thus it is necessary to use several MIXes sequentially for each communication, which distributes the trust among them. This increases the complexity of the protocols as well as the latency. On the other side, such distributed systems are resilient and scalable, and they provide good enough performance for web browsing. An ideal relay should be unable to betray its users (we will say in this case that the relay is trustable). In such a setting, using multiple relays to distribute trust is not necessary, which simplifies design and reduces costs. Superposed sending provides an approach to construct trustable relays, the DC-net relays. Straightforward usage of classic protocols leads to other approaches and recently we proposed a set of trustable relays, based on Private Information Retrieval protocols, that provide new alternatives. Independently of their practical applications, these relays are interesting from a theoretic point of view. In this paper, we present a survey that gathers the different trustable relays we have been able to identify and gives a unified view of their construction.