-
1
-
-
0000155710
-
A new multiple key ciphers and an improved voting scheme
-
C. A. Boyd A new multiple key ciphers and an improved voting scheme Advances in Cryptology-EUROCRYPT'89 434 617 625 Advances in Cryptology-EUROCRYPT'89 1990
-
(1990)
, vol.434
, pp. 617-625
-
-
Boyd, C.A.1
-
2
-
-
0028087488
-
Receipt-free secret-ballot elections
-
J. C. Benaloh D. Tuinstra Receipt-free secret-ballot elections Proc. 26th ACM Symp. on the Theory of Computing 544 553 Proc. 26th ACM Symp. on the Theory of Computing 1994
-
(1994)
, pp. 544-553
-
-
Benaloh, J.C.1
Tuinstra, D.2
-
3
-
-
0019532104
-
Untraceable electronic mail, return addresses, and digital pseudonyms
-
D. Chaum Untraceable electronic mail, return addresses, and digital pseudonyms Communications of the ACM 24 2 84 88 Communications of the ACM 1981
-
(1981)
, vol.24
, Issue.2
, pp. 84-88
-
-
Chaum, D.1
-
4
-
-
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 65 75 1988
-
(1988)
Journal of Cryptology
, vol.1
, pp. 65-75
-
-
Chaum, D.1
-
5
-
-
84929273746
-
Untraceable electronic cash
-
D. Chaum A. Fiat M. Naor Untraceable electronic cash Advances in Cryptology-CRYPTO'88 403 319 327 Advances in Cryptology-CRYPTO'88 1990
-
(1990)
, vol.403
, pp. 319-327
-
-
Chaum, D.1
Fiat, A.2
Naor, M.3
-
6
-
-
0022188127
-
A robust and verifiable cryptographically secure election scheme
-
J. D. Cohen M. J. Fisher A robust and verifiable cryptographically secure election scheme Proc. 26th IEEE Symp. on Foundations of Computer Science 372 382 Proc. 26th IEEE Symp. on Foundations of Computer Science 1985
-
(1985)
, pp. 372-382
-
-
Cohen, J.D.1
Fisher, M.J.2
-
7
-
-
0030123246
-
Efficient blind signature scheme based on quadratic residues
-
C. I. Fan C. L. Lei Efficient blind signature scheme based on quadratic residues Electronics Letters 32 9 811 813 1996
-
(1996)
Electronics Letters
, vol.32
, Issue.9
, pp. 811-813
-
-
Fan, C.I.1
Lei, C.L.2
-
8
-
-
0030216713
-
Low-computation blind signature schemes based on quadratic residues
-
C. I. Fan C. L. Lei Low-computation blind signature schemes based on quadratic residues Electronics Letters 32 17 1569 1570 1996
-
(1996)
Electronics Letters
, vol.32
, Issue.17
, pp. 1569-1570
-
-
Fan, C.I.1
Lei, C.L.2
-
9
-
-
85176680891
-
A multi-recastable ticket scheme for electronic elections
-
C. I. Fan C. L. Lei A multi-recastable ticket scheme for electronic elections Advances in Cryptology-AISACRYPT'96 Advances in Cryptology-AISACRYPT'96 1996
-
(1996)
-
-
Fan, C.I.1
Lei, C.L.2
-
10
-
-
0001292443
-
A practical secret voting scheme for large scale elections
-
A. Fujioka T. Okamoto K. Ohta A practical secret voting scheme for large scale elections Advances in Cryptology-AUSCRYPT'92 718 244 251 Advances in Cryptology-AUSCRYPT'92 1992
-
(1992)
, vol.718
, pp. 244-251
-
-
Fujioka, A.1
Okamoto, T.2
Ohta, K.3
-
11
-
-
85001871295
-
A cryptographic scheme for computerized general elections
-
K. R. Iversen A cryptographic scheme for computerized general elections Advances in Cryptology-CRYPTO'91 576 405 419 Advances in Cryptology-CRYPTO'91 1991
-
(1991)
, vol.576
, pp. 405-419
-
-
Iversen, K.R.1
-
12
-
-
85176689070
-
A collision free secret ballot protocol for computerized general elections
-
W. S. Juang C. L. Lei C. I. Fan R. O.C. Taiwan A collision free secret ballot protocol for computerized general elections International Computer Symposium International Computer Symposium 1994
-
(1994)
-
-
Juang, W.S.1
Lei, C.L.2
Fan, C.I.3
Taiwan, R.O.C.4
-
13
-
-
0003980023
-
Fundamentals of Number Theory
-
Addison-Wesley Mass., Reading
-
W. J. LeVeque Fundamentals of Number Theory 1977 Addison-Wesley Mass., Reading
-
(1977)
-
-
LeVeque, W.J.1
-
15
-
-
85024576592
-
Universal electronic cash
-
T. Okamoto K. Ohta Universal electronic cash Advances in Cryptology-CRYPTO'91 324 337 Advances in Cryptology-CRYPTO'91 1992
-
(1992)
, pp. 324-337
-
-
Okamoto, T.1
Ohta, K.2
-
16
-
-
0022807029
-
A simple and fast probabilistic algorithm for computing square roots modulo a prime number
-
R. C. Peralta A simple and fast probabilistic algorithm for computing square roots modulo a prime number IEEE Trans. Inform. Theory 32 6 846 847 1986
-
(1986)
IEEE Trans. Inform. Theory
, vol.32
, Issue.6
, pp. 846-847
-
-
Peralta, R.C.1
-
17
-
-
84919085619
-
An improved algorithm for computing logarithms over GF(p) and its cryptographic significance
-
S. Pohlig M. E. Hellman An improved algorithm for computing logarithms over GF(p) and its cryptographic significance IEEE Trans. on Inform. Theory 24 106 110 1978
-
(1978)
IEEE Trans. on Inform. Theory
, vol.24
, pp. 106-110
-
-
Pohlig, S.1
Hellman, M.E.2
-
18
-
-
0000900573
-
All/nothing election scheme and anonymous channel
-
C. Park K. Itoh K. Kurosawa All/nothing election scheme and anonymous channel Advances in Cryptology-EUROCRYPT'93 765 248 259 Advances in Cryptology-EUROCRYPT'93 1993
-
(1993)
, vol.765
, pp. 248-259
-
-
Park, C.1
Itoh, K.2
Kurosawa, K.3
-
19
-
-
0023420534
-
An efficient solution of the congruence x2 + ky2 = m (mod n)
-
J. M. Pollard C. P. Sclinorr An efficient solution of the congruence x2 + ky2 = m (mod n) IEEE Trans. Inform. Theory 33 5 702 709 1987
-
(1987)
IEEE Trans. Inform. Theory
, vol.33
, Issue.5
, pp. 702-709
-
-
Pollard, J.M.1
Sclinorr, C.P.2
-
20
-
-
0003614758
-
Digitalized signatures and public-key functions as intractable as factorization
-
Mass, Cambridge
-
M. O. Rabin Digitalized signatures and public-key functions as intractable as factorization Jan. 1979 Mass, Cambridge MIT/LCS/TR212, MIT Lab., Computer Science
-
(1979)
-
-
Rabin, M.O.1
-
21
-
-
0017930809
-
A method for obtaining digital signatures and public key cryptosystems
-
R. L. Rivest A. Shamir L. Adleman A method for obtaining digital signatures and public key cryptosystems Communications of the ACM 21 2 120 126 1978
-
(1978)
Communications of the ACM
, vol.21
, Issue.2
, pp. 120-126
-
-
Rivest, R.L.1
Shamir, A.2
Adleman, L.3
-
22
-
-
84955615815
-
Secure voting using partially compatible homomorphisms
-
K. Sako J. Kilian Secure voting using partially compatible homomorphisms Advances in Cryptology-CRYPTO'94 839 411 424 Advances in Cryptology-CRYPTO'94 1994
-
(1994)
, vol.839
, pp. 411-424
-
-
Sako, K.1
Kilian, J.2
-
23
-
-
0026152658
-
Socially secure cryptographic election scheme
-
P. H. Slessenger Socially secure cryptographic election scheme Electronics Letters 27 11 955 957 1991
-
(1991)
Electronics Letters
, vol.27
, Issue.11
, pp. 955-957
-
-
Slessenger, P.H.1
-
24
-
-
0004212439
-
An Introduction to the Theory of Numbers
-
Pergamon Press N.Y., Elmsford
-
I. M. Vinogradov An Introduction to the Theory of Numbers 1955 Pergamon Press N.Y., Elmsford
-
(1955)
-
-
Vinogradov, I.M.1
|