-
2
-
-
0019532104
-
Untraceable electronic mail, return addresses, and digital pseudonyms
-
Chaum, D.: Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms, CACM 24(2) (1981), 84-88
-
(1981)
CACM
, vol.24
, Issue.2
, pp. 84-88
-
-
Chaum, D.1
-
3
-
-
0023861309
-
The dining cryptographers problem: Unconditional sender and recipient untraceability
-
Chaum, D.: The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability, Journal of Cryptology 1.1 (1988), 65-75
-
(1988)
Journal of Cryptology 1.1
, pp. 65-75
-
-
Chaum, D.1
-
5
-
-
24944546872
-
An improved construction for universal re-encryption
-
LNCS, Springer-Verlag
-
Fairbrother, P.: An Improved Construction for Universal Re-encryption, Privacy Enhancing Technologies'2004, LNCS, Springer-Verlag.
-
Privacy Enhancing Technologies'2004
-
-
Fairbrother, P.1
-
6
-
-
0002992068
-
Joint encryption and message-efficient secure computation
-
Frankling, M., Haber, S.: Joint Encryption and Message-Efficient Secure Computation, Journal of Cryptology 9.4 (1996), 217-232.
-
(1996)
Journal of Cryptology 9.4
, pp. 217-232
-
-
Frankling, M.1
Haber, S.2
-
7
-
-
84955557456
-
Hiding routing information
-
Information Hiding '1996, Springer-Verlag
-
Goldschlag, D.M., Reed, M.G., Syverson, P.F.: Hiding Routing Information. Information Hiding '1996, LNCS 1174, Springer-Verlag, 137-150.
-
LNCS
, vol.1174
, pp. 137-150
-
-
Goldschlag, D.M.1
Reed, M.G.2
Syverson, P.F.3
-
9
-
-
35048899238
-
Universal re-encryption for mixnets
-
Golle, P., Jakobsson, M., Juels, A., Syverson, P.: Universal Re-encryption for Mixnets, RSACT2004, 163-178.
-
RSACT2004
, pp. 163-178
-
-
Golle, P.1
Jakobsson, M.2
Juels, A.3
Syverson, P.4
-
10
-
-
84860984551
-
Anonymous communication immune against repetitive attack
-
LNCS, Springer-Verlag, to appear
-
Gomulłkiewicz, M., Klonowski, M., Kutytowski, M.: Anonymous Communication Immune against Repetitive Attack, Workshop on Information Security Applications (WISA)'2004, LNCS, Springer-Verlag, to appear.
-
Workshop on Information Security Applications (WISA)'2004
-
-
Gomulłkiewicz, M.1
Klonowski, M.2
Kutytowski, M.3
-
11
-
-
35048849599
-
Provable unlinkability against traffic analysis already after ο(log(n)) steps!
-
Information Security Conference (ISC)'2004, Springer-Verlag
-
Gomulłkiewicz, M., Klonowski, M., Kutylowski, M.: Provable Unlinkability Against Traffic Analysis already after ο(log(n)) Steps!, Information Security Conference (ISC)'2004, LNCS 3225, Springer-Verlag, 354-366.
-
LNCS
, vol.3225
, pp. 354-366
-
-
Gomulłkiewicz, M.1
Klonowski, M.2
Kutylowski, M.3
-
13
-
-
84890010554
-
Stop-and-go-MIXes providing probabilistic anonymity in an open system
-
Information Hiding '98, Springer-Verlag
-
Kesdogan D., Egner J., Büschkes R.: Stop-and-Go-MIXes Providing Probabilistic Anonymity in an Open System, Information Hiding '98, LNCS 1525, Springer-Verlag, 83-98.
-
LNCS
, vol.1525
, pp. 83-98
-
-
Kesdogan, D.1
Egner, J.2
Büschkes, R.3
-
14
-
-
0027224328
-
Cryptographic defense against traffic analysis
-
Rackoff, C., Simon, D.R.: Cryptographic Defense Against Traffic Analysis, ACM STOC25 (1993), 672-681.
-
(1993)
ACM STOC25
, pp. 672-681
-
-
Rackoff, C.1
Simon, D.R.2
|