-
3
-
-
0001604533
-
Blind signatures for untraceable payments
-
Ch82 D. Chaum, R. Rivest, and A. Sherman, eds., Plenum Press
-
[Ch82] D. Chaum. Blind signatures for untraceable payments. In Blind Signatures for Untraceable Payments, D. Chaum, R. Rivest, and A. Sherman, eds., pages 199-203, Plenum Press, 1982.
-
(1982)
Blind Signatures for Untraceable Payments
, pp. 199-203
-
-
Chaum, D.1
-
4
-
-
0019532104
-
Untraceable electronic mail, return addresses, and digital pseudonyms
-
Ch81
-
[Ch81] D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communication of the ACM, 24(1981), pp. 84-88.
-
(1981)
Communication of The ACM
, vol.24
, pp. 84-88
-
-
Chaum, D.1
-
5
-
-
0023861309
-
The dinning cryptographers problem: Unconditional sender and recipient untraceability
-
Ch88a
-
[Ch88a] D. Chaum. The dinning cryptographers problem: unconditional sender and recipient untraceability. Journal of Cryptography, 1(1988), pp. 65-75.
-
(1988)
Journal of Cryptography
, vol.1
, pp. 65-75
-
-
Chaum, D.1
-
6
-
-
85034632918
-
Elections with unconditionally secret ballots and disruption equivalent to breaking RSA
-
Ch88b of Lecture Notes in Computer Science, Springer-Verlag
-
[Ch88b] D. Chaum. Elections with unconditionally secret ballots and disruption equivalent to breaking RSA. In Proceedings of Advances in Cryptology (EUROCRYPT'88), vol. 330 of Lecture Notes in Computer Science, pages 177-182, Springer-Verlag, 1988.
-
(1988)
Proceedings of Advances in Cryptology (EUROCRYPT'88)
, vol.330
, pp. 177-182
-
-
Chaum, D.1
-
9
-
-
77951106449
-
Multi-authority secret ballot elections with linear work
-
C+96 of Lecture Notes in Computer Science, Springer-Verlag
-
[C+96] R. Cramer, M. Frankin, B. Schoenmakers, and M. Yung. Multi-authority secret ballot elections with linear work. In Proceedings of Advances in Cryptology (EUROCRYPT'96), vol. 1070 of Lecture Notes in Computer Science, pages 72-83, Springer-Verlag, 1996.
-
(1996)
Proceedings of Advances in Cryptology (EUROCRYPT'96)
, vol.1070
, pp. 72-83
-
-
Cramer, R.1
Frankin, M.2
Schoenmakers, B.3
Yung, M.4
-
11
-
-
12344322107
-
Electronic voting: Computerized polls may save money, protect privacy
-
Cr96
-
[Cr96] L. Cranor. Electronic voting: computerized polls may save money, protect privacy. ACM Crossroads (Electronic Journal), 1996.
-
(1996)
ACM Crossroads (Electronic Journal)
-
-
Cranor, L.1
-
13
-
-
77954124943
-
A practical secret voting scheme for large-scale elections
-
F+93 of Lecture Notes in Computer Science, Springer-Verlag
-
[F+93] A. Fujioka, T. Okamoto. and K. Ohta. A practical secret voting scheme for large-scale elections. In Proceedings of Advances in Cryptology (AUSCRYPT'92), vol. 718 of Lecture Notes in Computer Science, pages 244-251, Springer-Verlag, 1993.
-
(1993)
Proceedings of Advances in Cryptology (AUSCRYPT'92)
, vol.718
, pp. 244-251
-
-
Fujioka, A.1
Okamoto, T.2
Ohta, K.3
-
14
-
-
85001871295
-
A cryptographic scheme for computerized general elections
-
Iv91 of Lecture Notes in Computer Science, Springer-Verlag
-
[Iv91] K. Iversen. A cryptographic scheme for computerized general elections. In Proceedings of Advances in Cryptography (CRYPTO'91), vol. 576 of Lecture Notes in Computer Science, pages 405-419, Springer-Verlag, 1991.
-
(1991)
Proceedings of Advances in Cryptography (CRYPTO'91)
, vol.576
, pp. 405-419
-
-
Iversen, K.1
-
16
-
-
85053900753
-
Bit commitment using pseudo-randomness
-
Na90 of Lecture Notes in Computer Science, Springer-Verlag
-
[Na90] M. Naor. Bit commitment using pseudo-randomness. In Proceedings of Advances in Cryptology (CRYPTO'90), vol. 435 of Lecture Notes in Computer Science, pages 218-229, Springer-Verlag, 1990.
-
(1990)
Proceedings of Advances in Cryptology (CRYPTO'90)
, vol.435
, pp. 218-229
-
-
Naor, M.1
-
18
-
-
84982059773
-
A cryptographic approach to the secret ballot
-
NS91
-
[NS91] H. Nurmi and A. Salomaa. A cryptographic approach to the secret ballot. Behavioral_Science. 36(1991), pp. 34-40.
-
(1991)
Behavioral_Science
, vol.36
, pp. 34-40
-
-
Nurmi, H.1
Salomaa, A.2
-
20
-
-
0026237211
-
Secret ballot elections in computer networks
-
N+91
-
[N+91] H. Nurmi, A. Salomaa, and L. Santean. Secret ballot elections in computer networks. Computers & Security, 10(1991), pp. 553-560.
-
(1991)
Computers & Security
, vol.10
, pp. 553-560
-
-
Nurmi, H.1
Salomaa, A.2
Santean, L.3
-
22
-
-
84955615815
-
Secure voting using partially compatible homomorphisms
-
SK94 of Lecture Notes in Computer Science, Springer-Verlag
-
[SK94] K. Sako and J. Kilian. Secure voting using partially compatible homomorphisms. In Proceedings of Advances in Cryptology (CRYPTO'94), vol. 839 of Lecture Notes in Computer Science, pages 411-424, Springer-Verlag. 1994.
-
(1994)
Proceedings of Advances in Cryptology (CRYPTO'94)
, vol.839
, pp. 411-424
-
-
Sako, K.1
Kilian, J.2
|