-
2
-
-
0005098316
-
Relations among notions of security for public-key encryption schemes
-
Mihir Bellare, Anand Desai, David Pointcheval, and Phillip Rogaway. Relations among notions of security for public-key encryption schemes. Advances in Cryptology -CRYPTO '98, pages 549-570, 1998.
-
(1998)
Advances in Cryptology -CRYPTO '98
, pp. 549-570
-
-
Bellare, M.1
Desai, A.2
Pointcheval, D.3
Rogaway, P.4
-
5
-
-
56649105529
-
Denial of service or denial of security? How attacks on reliability can compromise anonymity
-
October
-
Nikita Borisov, George Danezis, Prateek Mittal, and Parisa Tabriz. Denial of service or denial of security? How attacks on reliability can compromise anonymity. In 14th ACM CCS, October 2007.
-
(2007)
14th ACM CCS
-
-
Borisov, N.1
Danezis, G.2
Mittal, P.3
Tabriz, P.4
-
6
-
-
20444490057
-
Off-the-record communication, or, why not to use PGP
-
October
-
Nikita Borisov, Ian Goldberg, and Eric Brewer. Off-the-record communication, or, why not to use PGP. In WPES, pages 77-84, October 2004.
-
(2004)
WPES
, pp. 77-84
-
-
Borisov, N.1
Goldberg, I.2
Brewer, E.3
-
7
-
-
33749576326
-
Efficient anonymity-preserving data collection
-
Tina Eliassi-Rad, Lyle H. Ungar, Mark Craven, and Dimitrios Gunopulos, editors, ACM
-
Justin Brickell and Vitaly Shmatikov. Efficient anonymity-preserving data collection. In Tina Eliassi-Rad, Lyle H. Ungar, Mark Craven, and Dimitrios Gunopulos, editors, KDD, pages 76-85. ACM, 2006.
-
(2006)
KDD
, pp. 76-85
-
-
Brickell, J.1
Shmatikov, V.2
-
8
-
-
70350244177
-
Practical byzantine fault tolerance
-
February
-
Miguel Castro and Barbara Liskov. Practical byzantine fault tolerance. In 3rd OSDI, pages 173-186, February 1999.
-
(1999)
3rd OSDI
, pp. 173-186
-
-
Castro, M.1
Liskov, B.2
-
9
-
-
0019532104
-
Untraceable electronic mail, return addresses, and digital pseudonyms
-
February
-
David Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2), February 1981.
-
(1981)
Communications of the ACM
, vol.24
, Issue.2
-
-
Chaum, D.1
-
10
-
-
0023861309
-
The dining cryptographers problem: Unconditional sender and recipient untraceability
-
January
-
David Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1(1):65-75, January 1988.
-
(1988)
Journal of Cryptology
, vol.1
, Issue.1
, pp. 65-75
-
-
Chaum, D.1
-
13
-
-
0042878512
-
Anonymity on the Internet: Why the price may be too high
-
April
-
David Davenport. Anonymity on the Internet: why the price may be too high. Communications of the ACM, 45(4):33-35, April 2002.
-
(2002)
Communications of the ACM
, vol.45
, Issue.4
, pp. 33-35
-
-
Davenport, D.1
-
14
-
-
85084161366
-
Tor: The second-generation onion router
-
Berkeley, CA, USA, .USENIX Association
-
Roger Dingledine, Nick Mathewson, and Paul Syverson. Tor: the second-generation onion router. In SSYM'04: Proceedings of the 13th conference on USENIX Security Symposium, pages 21-21, Berkeley, CA, USA, 2004.USENIX Association.
-
(2004)
SSYM'04: Proceedings of the 13th Conference on USENIX Security Symposium
, pp. 21-21
-
-
Dingledine, R.1
Mathewson, N.2
Syverson, P.3
-
15
-
-
27944505056
-
Synchronous batching: From cascades to free routes
-
May
-
Roger Dingledine, Vitaly Shmatikov, and Paul Syverson. Synchronous batching: From cascades to free routes. In WPET, May 2004.
-
(2004)
WPET
-
-
Dingledine, R.1
Shmatikov, V.2
Syverson, P.3
-
16
-
-
33646756818
-
Reliable MIX cascade networks through reputation
-
March
-
Roger Dingledine and Paul Syverson. Reliable MIX cascade networks through reputation. In Financial Cryptography, March 2002.
-
(2002)
Financial Cryptography
-
-
Dingledine, R.1
Syverson, P.2
-
19
-
-
4344662082
-
RSA-OAEP is secure under the RSA assumption
-
03
-
Eiichiro Fujisaki, Tatsuaki Okamoto, David Pointcheval, and Jacques Stern. RSA-OAEP is secure under the RSA assumption. Journal of Cryptology, 17(2):81-104, 03 2004.
-
(2004)
Journal of Cryptology
, vol.17
, Issue.2
, pp. 81-104
-
-
Fujisaki, E.1
Okamoto, T.2
Pointcheval, D.3
Stern, J.4
-
20
-
-
35048813315
-
An efficient scheme for proving a shuffle
-
August
-
Jun Furukawa and Kazue Sako. An efficient scheme for proving a shuffle. In CRYPTO, August 2001.
-
(2001)
CRYPTO
-
-
Furukawa, J.1
Sako, K.2
-
21
-
-
0005063385
-
Onion routing for anonymous and private internet connections
-
February
-
David Goldschlag, Michael Reed, and Paul Syverson. Onion routing for anonymous and private internet connections. Communications of the ACM, 42(2):39-41, February 1999.
-
(1999)
Communications of the ACM
, vol.42
, Issue.2
, pp. 39-41
-
-
Goldschlag, D.1
Reed, M.2
Syverson, P.3
-
22
-
-
32344447491
-
Dining cryptographers revisited
-
May
-
Philippe Golle and Ari Juels. Dining cryptographers revisited. Eurocrypt, May 2004.
-
(2004)
Eurocrypt
-
-
Golle, P.1
Juels, A.2
-
23
-
-
58049120018
-
PeerReview: Practical accountability for distributed systems
-
October
-
Andreas Haeberlen, Petr Kouznetsov, and Peter Druschel. PeerReview: Practical accountability for distributed systems. In 21st SOSP, October 2007.
-
(2007)
21st SOSP
-
-
Haeberlen, A.1
Kouznetsov, P.2
Druschel, P.3
-
24
-
-
78650004926
-
DUO-Onions and Hydra-Onions - Failure and adversary resistant onion protocols
-
September
-
Jan Iwanik, Marek Klonowski, and Miroslaw Kutylowski. DUO-Onions and Hydra-Onions - failure and adversary resistant onion protocols. In IFIP CMS, September 2004.
-
(2004)
IFIP CMS
-
-
Iwanik, J.1
Klonowski, M.2
Kutylowski, M.3
-
25
-
-
0032058184
-
The part-time parliament
-
Leslie Lamport. The part-time parliament. TOCS, 16(2):133-169, 1998.
-
(1998)
TOCS
, vol.16
, Issue.2
, pp. 133-169
-
-
Lamport, L.1
-
26
-
-
0035754862
-
A verifiable secret shuffle and its application to e-voting
-
November
-
C. Andrew Neff. A verifiable secret shuffle and its application to e-voting. In 8th CCS, pages 116-125, November 2001.
-
(2001)
8th CCS
, pp. 116-125
-
-
Andrew Neff, C.1
-
27
-
-
33947710012
-
M2: Multicasting mixes for efficient and anonymous communication
-
G. Perng, M.K. Reiter, and Chenxi Wang. M2: Multicasting mixes for efficient and anonymous communication. In 26th ICDCS, pages 59-59, 2006.
-
(2006)
26th ICDCS
, pp. 59-59
-
-
Perng, G.1
Reiter, M.K.2
Wang, C.3
-
29
-
-
0001777423
-
Anonymous web transactions with crowds
-
Michael K. Reiter and Aviel D. Rubin. Anonymous web transactions with crowds. Communications of the ACM, 42(2):32-48, 1999.
-
(1999)
Communications of the ACM
, vol.42
, Issue.2
, pp. 32-48
-
-
Reiter, M.K.1
Rubin, A.D.2
-
31
-
-
35248841429
-
From a trickle to a flood: Active attacks on several mix types
-
Andrei Serjantov, Roger Dingledine, and Paul Syverson. From a trickle to a flood: Active attacks on several mix types. Information Hiding, pages 36-52, 2003.
-
(2003)
Information Hiding
, pp. 36-52
-
-
Serjantov, A.1
Dingledine, R.2
Syverson, P.3
-
32
-
-
77951431567
-
Eluding carnivores: File sharing with strong anonymity
-
September
-
Emin Gün Sirer et al. Eluding carnivores: File sharing with strong anonymity. In 11th SIGOPS European Workshop, September 2004.
-
(2004)
11th SIGOPS European Workshop
-
-
Gün Sirer, E.1
-
33
-
-
78650018760
-
The cocaine auction protocol: On the power of anonymous broadcast
-
September
-
Frank Stajano and Ross Anderson. The cocaine auction protocol: On the power of anonymous broadcast. In 3rd Information Hiding Workshop, September 1999.
-
(1999)
3rd Information Hiding Workshop
-
-
Stajano, F.1
Anderson, R.2
-
34
-
-
0037412590
-
Queers anonymous: Lesbians, gay men, free speech, and cyberspace
-
Edward Stein. Queers anonymous: Lesbians, gay men, free speech, and cyberspace. Harvard Civil Rights-Civil Liberties Law Review, 38(1), 2003.
-
(2003)
Harvard Civil Rights-Civil Liberties Law Review
, vol.38
, Issue.1
-
-
Stein, E.1
-
36
-
-
62949151268
-
The hand that controls the sock puppet could get slapped
-
July
-
Brad Stone and Matt Richtel. The hand that controls the sock puppet could get slapped. New York Times, July 2007.
-
(2007)
New York Times
-
-
Stone, B.1
Richtel, M.2
-
37
-
-
0033244305
-
Anonymous communication policies for the Internet: Results and recommendations of the AAAS conference
-
May
-
Al Teich, Mark S. Frankel, Rob Kling, and Ya-ching Lee. Anonymous communication policies for the Internet: Results and recommendations of the AAAS conference. Information Society, May 1999.
-
(1999)
Information Society
-
-
Teich, A.1
Frankel, M.S.2
Kling, R.3
Lee, Y.-C.4
-
38
-
-
74049098547
-
Membership-concealing overlay networks
-
November
-
Eugene Vasserman, Rob Jansen, James Tyra, Nicholas Hopper, and Yongdae Kim. Membership-concealing overlay networks. In 16th ACM CCS, November 2009.
-
(2009)
16th ACM CCS
-
-
Vasserman, E.1
Jansen, R.2
Tyra, J.3
Hopper, N.4
Kim, Y.5
-
39
-
-
14844282596
-
K-anonymous message transmission
-
New York, NY, USA, ACM
-
Luis von Ahn, Andrew Bortz, and Nicholas J. Hopper. k-anonymous message transmission. In 10th CCS, pages 122-130, New York, NY, USA, 2003. ACM.
-
(2003)
10th CCS
, pp. 122-130
-
-
Von Ahn, L.1
Bortz, A.2
Hopper, N.J.3
-
40
-
-
85032863028
-
The dining cryptographers in the disco: Unconditional sender and recipient untraceability with computationally secure serviceability
-
April
-
Michael Waidner and Birgit Pfitzmann. The dining cryptographers in the disco: Unconditional sender and recipient untraceability with computationally secure serviceability. In Eurocrypt, page 690, April 1989.
-
(1989)
Eurocrypt
, pp. 690
-
-
Waidner, M.1
Pfitzmann, B.2
-
42
-
-
78650025003
-
-
Wikileaks. http://wikileaks.org/.
-
-
-
-
43
-
-
0009297186
-
The constitutional right to anonymity: Free speech, disclosure and the devil
-
June
-
The constitutional right to anonymity: Free speech, disclosure and the devil. Yale Law Journal, 70(7):1084-1128, June 1961
-
(1961)
Yale Law Journal
, vol.70
, Issue.7
, pp. 1084-1128
-
-
|