 | 2008 |
|---|
| 10 |       | David Chaum,
Richard Carback,
Jeremy Clark,
Aleksander Essex,
Stefan Popoveniuc,
Ronald L. Rivest,
Peter Y. A. Ryan,
Emily Shen,
Alan T. Sherman:
Scantegrity II: End-to-End Verifiability for Optical Scan Election Systems using Invisible Ink Confirmation Codes.
EVT 2008 |
| 9 | | David Chaum,
Aleksander Essex,
Richard Carback,
Jeremy Clark,
Stefan Popoveniuc,
Alan T. Sherman,
Poorvi L. Vora:
Scantegrity: End-to-End Voter-Verifiable Optical-Scan Voting.
IEEE Security & Privacy 6(3): 40-46 (2008) |
| 2003 |
|---|
| 8 | | Alan T. Sherman,
David A. McGrew:
Key Establishment in Large Dynamic Groups Using One-Way Function Trees.
IEEE Trans. Software Eng. 29(5): 444-458 (2003) |
| 1997 |
|---|
| 7 | | Muhammad Rabi,
Alan T. Sherman:
An Observation on Associative One-Way Functions in Complexity Theory.
Inf. Process. Lett. 64(5): 239-244 (1997) |
| 1994 |
|---|
| 6 | | Thomas R. Cain,
Alan T. Sherman:
How to Break Gifford's Cipher (extended abstract).
ACM Conference on Computer and Communications Security 1994: 198-209 |
| 1990 |
|---|
| 5 |  | Robert Y. Levin,
Alan T. Sherman:
A Note on Bennett's Time-Space Tradeoff for Reversible Computation.
SIAM J. Comput. 19(4): 673-677 (1990) |
| 1988 |
|---|
| 4 | | Burton S. Kaliski Jr.,
Ronald L. Rivest,
Alan T. Sherman:
Is the Data Encryption Standard a Group? (Results of Cycling Experiments on DES).
J. Cryptology 1(1): 3-36 (1988) |
| 1985 |
|---|
| 3 | | Burton S. Kaliski Jr.,
Ronald L. Rivest,
Alan T. Sherman:
Is DES a Pure Cipher? (Results of More Cycling Experiments on DES).
CRYPTO 1985: 212-226 |
| 2 | | Burton S. Kaliski Jr.,
Ronald L. Rivest,
Alan T. Sherman:
Is the Data Encryption Standard a Group? (Preliminary Abstract).
EUROCRYPT 1985: 81-95 |
| 1982 |
|---|
| 1 | | Ronald L. Rivest,
Alan T. Sherman:
Randomized Encryption Techniques.
CRYPTO 1982: 145-163 |
