-
1
-
-
84951063457
-
Upper Bound on the Communication Complexity of Private Information Retrieval
-
Proceedings of the 24th ICALP
-
A. Ambainis, Upper Bound on the Communication Complexity of Private Information Retrieval, In Proceedings of the 24th ICALP, LNCS 1256, pages 401-407, 1997.
-
(1997)
LNCS
, vol.1256
, pp. 401-407
-
-
Ambainis, A.1
-
2
-
-
0019532104
-
Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms
-
February
-
D. Chaum, Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms, Communications of the ACM, 24(2):84-88, February 1981.
-
(1981)
Communications of the ACM
, vol.24
, Issue.2
, pp. 84-88
-
-
Chaum, D.1
-
3
-
-
0023861309
-
The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability
-
D. Chaum, The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability, Journal of Cryptology 1, pages 65-75, 1988.
-
(1988)
Journal of Cryptology
, vol.1
, pp. 65-75
-
-
Chaum, D.1
-
5
-
-
0029541045
-
Private Information Retrieval
-
October
-
B.Chor, O.Goldreich, E.Kushilevitz, M.Sudan, Private Information Retrieval, In Proceedings of the IEEE Symposium on Foundations on Computer Science, pages 41-51, October 1995.
-
(1995)
Proceedings of the IEEE Symposium on Foundations on Computer Science
, pp. 41-51
-
-
Chor, B.1
Goldreich, O.2
Kushilevitz, E.3
Sudan, M.4
-
6
-
-
0029237418
-
-
David A. Cooper, Kenneth P. Birman Preserving Privacy in a Network of Mobile Computers, 1995 IEEE Symposium on Research in Security and Privacy, IEEE Computer Society Press, Los Alamitos 1995, 26-38.
-
David A. Cooper, Kenneth P. Birman Preserving Privacy in a Network of Mobile Computers, 1995 IEEE Symposium on Research in Security and Privacy, IEEE Computer Society Press, Los Alamitos 1995, 26-38.
-
-
-
-
7
-
-
84867553981
-
A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key Cryptosystem
-
Public Key Cryptography 2001, Springer-Verlag
-
I. Damgard, M. Jurik, A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key Cryptosystem, In Public Key Cryptography 2001, LNCS 1992, pages 119-136, Springer-Verlag, 2001.
-
(1992)
LNCS
, pp. 119-136
-
-
Damgard, I.1
Jurik, M.2
-
10
-
-
84957709438
-
A Practical Mix
-
M. Jakobsson, A Practical Mix, Eurocrypt '98, LNCS 1403, pages 448-461, 1998.
-
(1998)
Eurocrypt '98, LNCS
, vol.1403
, pp. 448-461
-
-
Jakobsson, M.1
-
13
-
-
0032074980
-
Real-Time MIXes: A Bandwidth-Efficient Anonymity Protocol
-
A. Jerichow, J. Mller, A. Pfitzmann, B. Pfitzmann, M. Waidner, Real-Time MIXes: A Bandwidth-Efficient Anonymity Protocol, In IEEE Journal on Selected Areas in Communications 16(4), 1998.
-
(1998)
In IEEE Journal on Selected Areas in Communications
, vol.16
, Issue.4
-
-
Jerichow, A.1
Mller, J.2
Pfitzmann, A.3
Pfitzmann, B.4
Waidner, M.5
-
14
-
-
85087241747
-
Unobservable Surfing on the World Wide Web: Is Private Information Retrieval an alternative to the MIX based Approach?
-
Proceedings of Privacy Enhancing Technologies workshop PET, Springer-Verlag
-
D. Kesdogan, M. Burning, M. Schmeink Unobservable Surfing on the World Wide Web: Is Private Information Retrieval an alternative to the MIX based Approach?, Proceedings of Privacy Enhancing Technologies workshop (PET 2002), Springer-Verlag, LNCS 2482, 2002.
-
(2002)
LNCS
, vol.2482
-
-
Kesdogan, D.1
Burning, M.2
Schmeink, M.3
-
15
-
-
0031378815
-
Replication is not needed: Single Database, Computationally-Private Information Retrieval
-
E. Kushilevitz, R. Ostrovsky, Replication is not needed: Single Database, Computationally-Private Information Retrieval, In Proceedings of the 38th IEEE Symposium on Foundations of Computer Science, pages 364-373, 1997.
-
(1997)
Proceedings of the 38th IEEE Symposium on Foundations of Computer Science
, pp. 364-373
-
-
Kushilevitz, E.1
Ostrovsky, R.2
-
16
-
-
33846288517
-
Timing Attacks in Low-Latency Mix Systems
-
B.N. Levine, M. Reiter, C. Wang, and M. Wright, Timing Attacks in Low-Latency Mix Systems, Financial Cryptography 2004, LNCS 3110, pages 251-265, 2004.
-
(2004)
Financial Cryptography 2004, LNCS
, vol.3110
, pp. 251-265
-
-
Levine, B.N.1
Reiter, M.2
Wang, C.3
Wright, M.4
-
17
-
-
0036312325
-
Hordes: A multicast based protocol for anonymity
-
B. N. Levine, C. Shields, Hordes: a multicast based protocol for anonymity, Journal of Computer Security, Vol. 10(3), pages 213-240, 2002.
-
(2002)
Journal of Computer Security
, vol.10
, Issue.3
, pp. 213-240
-
-
Levine, B.N.1
Shields, C.2
-
20
-
-
84942550998
-
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
-
Eurocrypt'99, Springer-Verlag
-
P. Paillier, Public-Key Cryptosystems Based on Composite Degree Residuosity Classes, In Eurocrypt'99, LNCS 1592, pages 223-238, Springer-Verlag, 1999.
-
(1999)
LNCS
, vol.1592
, pp. 223-238
-
-
Paillier, P.1
-
21
-
-
84937555451
-
Networks without User Observability - Design Options
-
A. Pfitzmann, M. Waidner, Networks without User Observability - Design Options, Eurocrypt '85, Springer-Verlag, LNCS 219, pages 245-253, 1985.
-
(1985)
Eurocrypt '85, Springer-Verlag, LNCS
, vol.219
, pp. 245-253
-
-
Pfitzmann, A.1
Waidner, M.2
-
22
-
-
0002054934
-
Crowds: Anonymity for Web Transactions
-
November
-
M. K. Reiter, A. D. Rubin, Crowds: Anonymity for Web Transactions, ACM Transactions on Information and System Security, Vol.1, No.1, November 1998, pages 66-92.
-
(1998)
ACM Transactions on Information and System Security
, vol.1
, Issue.1
, pp. 66-92
-
-
Reiter, M.K.1
Rubin, A.D.2
-
23
-
-
84947772655
-
A New and Efficient All-Or-Nothing Disclosure of Secrets Protocol
-
J. P. Stern, A New and Efficient All-Or-Nothing Disclosure of Secrets Protocol, Asiacrypt '98, Springer-Verlag, LNCS 1514, pages 357-371, 1998.
-
(1998)
Asiacrypt '98, Springer-Verlag, LNCS
, vol.1514
, pp. 357-371
-
-
Stern, J.P.1
|