In 1981, David Chaum proposed a cryptographic primitive for privacy called mix network (Mixnet). A mixnet is cryptographic construction that establishes anonymous communication channel through a set of servers. In 2004, Golle et al. proposed a new cryptographic primitiv... View more
Chaum, D. L.. Untraceable electronic mail, return addresses, and digital pseudonyms.
Communications of the ACM. 1981; 24 (2): 84-88
Choonsik, P., Kouichi, I., Kurosawa, K.. Efficient anonymous channel and all/nothing election scheme. : 185-194
Shamir, A.. How to share a secret.
Communications of the ACM. 1979; 22 (11): 612-613
Golle, P., Jakobsson, M., Juels, A., Syverson, P.. Universal re-encryption for mixnets.
Topics in Cryptology—CT-RSA 2004: Proceedings of the Cryptographers' Track at the RSA Conference 2004, San Francisco, CA, USA, February 23–27, 2004. 2004; 2964: 163-178
Shor, P. W.. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer.
SIAM Journal on Computing. 1997; 26 (5): 1484-1509
Ajtai, M.. Generating hard instances of lattice problems (extended abstract). : 99-108
A fully homomorphic encryption scheme [Ph.D. thesis]. 2009
Garg, S., Gentry, C., Halevi, S.. Candidate multilinear maps from ideal lattices.
Advances in Cryptology—EUROCRYPT 2013: Proceedings of the 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26–30, 2013. 2013; 7881: 1-17
Regev, O.. On lattices, learning with errors, random linear codes, and cryptography. : 84-93
Beresford, A. R., Stajano, F.. Location privacy in pervasive computing.
IEEE Pervasive Computing. 2003; 2 (1): 46-55