| 2013 | ||
|---|---|---|
| j13 | Dhananjay S. Phatak, Alan T. Sherman, Nikhil Joshi, Bhushan Sonawane, Vivek G. Relan, Amol Dawalbhakta: Spread Identity: A new dynamic address remapping mechanism for anonymity and DDoS defense. Journal of Computer Security 21(2): 233-281 (2013) | |
| 2012 | ||
| j12 | Alan T. Sherman, Dhananjay S. Phatak, Vivek G. Relan, Bhushan Sonawane: Location Authentication, Tracking, and Emergency Signaling through Power Line Communication: Designs and Protocols for New Out-of-Band Strategies. Cryptologia 36(2): 129-148 (2012) | |
| 2011 | ||
| c10 | Dhananjay S. Phatak, Alan T. Sherman, J. Pinkston: A New Paradigm to Approximate Oblivious Data Processing (ODP) for Data Confidentiality in Cloud Computing. SERVICES 2011: 391-398 | |
| c9 | Russell A. Fink, Alan T. Sherman, Alexander O. Mitchell, David C. Challener: Catching the Cuckoo: Verifying TPM Proximity Using a Quote Timing Side-Channel - (Short Paper). TRUST 2011: 294-301 | |
| 2010 | ||
| j11 | David Chaum, Richard Carback, Jeremy Clark, Aleksander Essex, Stefan Popoveniuc, Ronald L. Rivest, Peter Y. A. Ryan, Emily Shen, Alan T. Sherman, Poorvi L. Vora: Corrections to scantegrity II: end-to-end verifiability by voters of optical scan elections through confirmation codes. IEEE Transactions on Information Forensics and Security 5(1): 194 (2010) | |
| j10 | Russell A. Fink, Alan T. Sherman, Richard Carback: Corrections to TPM meets DRE: reducing the trust base for electronic voting using trusted platform modules. IEEE Transactions on Information Forensics and Security 5(1): 194 (2010) | |
| c8 | Alan T. Sherman, Richard Carback, David Chaum, Jeremy Clark, Aleksander Essex, Paul S. Herrnson, Travis Mayberry, Stefan Popoveniuc, Ronald L. Rivest, Emily Shen, Bimal Sinha, Poorvi L. Vora: Scantegrity Mock Election at Takoma Park. Electronic Voting 2010: 45-61 | |
| c7 | F. John Krautheim, Dhananjay S. Phatak, Alan T. Sherman: Introducing the Trusted Virtual Environment Module: A New Mechanism for Rooting Trust in Cloud Computing. TRUST 2010: 211-227 | |
| c6 | Richard Carback, David Chaum, Jeremy Clark, John Conway, Aleksander Essex, Paul S. Herrnson, Travis Mayberry, Stefan Popoveniuc, Ronald L. Rivest, Emily Shen, Alan T. Sherman, Poorvi L. Vora: Scantegrity II Municipal Election at Takoma Park: The First E2E Binding Governmental Election with Ballot Privacy. USENIX Security Symposium 2010: 291-306 | |
| 2009 | ||
| j9 | David Chaum, Richard Carback, Jeremy Clark, Aleksander Essex, Stefan Popoveniuc, Ronald L. Rivest, Peter Y. A. Ryan, Emily Shen, Alan T. Sherman, Poorvi L. Vora: Scantegrity II: end-to-end verifiability by voters of optical scan elections through confirmation codes. IEEE Transactions on Information Forensics and Security 4(4): 611-627 (2009) | |
| j8 | Russell A. Fink, Alan T. Sherman, Richard Carback: TPM meets DRE: reducing the trust base for electronic voting using trusted platform modules. IEEE Transactions on Information Forensics and Security 4(4): 628-637 (2009) | |
| 2008 | ||
| j7 | 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) | |
| c5 | 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 | |
| 2003 | ||
| j6 | 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 | ||
| j5 | Muhammad Rabi, Alan T. Sherman: An Observation on Associative One-Way Functions in Complexity Theory. Inf. Process. Lett. 64(5): 239-244 (1997) | |
| 1994 | ||
| j4 | Konstantinos Kalpakis, Alan T. Sherman: Probabilistic analysis of an enhanced partitioning algorithm for the steiner tree problem in Rd. Networks 24(3): 147-159 (1994) | |
| j3 | Sivakumar Ravada, Alan T. Sherman: Experimental evaluation of a partitioning algorithm for the steiner tree problem in R2 and R3. Networks 24(8): 409-415 (1994) | |
| c4 | 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 | ||
| j2 | 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) | |
| 1989 | ||
| b1 | Alan T. Sherman: VLSI placement and routing - the PI project. Texts and monographs in computer science, Springer 1989, isbn 978-3-540-97077-4, pp. I-XII, 1-189 | |
| 1988 | ||
| j1 | 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 | ||
| c3 | 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 | |
| c2 | Burton S. Kaliski Jr., Ronald L. Rivest, Alan T. Sherman: Is the Data Encryption Standard a Group? (Preliminary Abstract). EUROCRYPT 1985: 81-95 | |
| 1983 | ||
| e1 | David Chaum, Ronald L. Rivest, Alan T. Sherman (Eds.): Advances in Cryptology: Proceedings of CRYPTO '82, Santa Barbara, California, USA, August 23-25, 1982. Plenum Press, New York 1983 | |
| 1982 | ||
| c1 | ||
Colors in the list of coauthors
Last update Sun May 19 19:15:52 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page