A robust and verifiable cryptographically secure election scheme
- 1 January 1985
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02725428,p. 372-382
- https://doi.org/10.1109/sfcs.1985.2
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- The knowledge complexity of interactive proof-systemsPublished by Association for Computing Machinery (ACM) ,1985
- On Distinguishing Prime Numbers from Composite NumbersAnnals of Mathematics, 1983
- An application of higher reciprocity to computational number theoryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Why and how to establish a private code on a public networkPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Cryptographic protocolsPublished by Association for Computing Machinery (ACM) ,1982
- Probabilistic encryption & how to play mental poker keeping secret all partial informationPublished by Association for Computing Machinery (ACM) ,1982
- Probabilistic algorithms in finite fieldsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Untraceable electronic mail, return addresses, and digital pseudonymsCommunications of the ACM, 1981
- Probabilistic Algorithms in Finite FieldsSIAM Journal on Computing, 1980
- An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)IEEE Transactions on Information Theory, 1978