Alan T. Sherman

Orcid: 0000-0003-1130-4678

Affiliations:
  • University of Maryland, USA


According to our database1, Alan T. Sherman authored at least 73 papers between 1982 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
BVOT: self-tallying boardroom voting with oblivious transfer.
Inf. Secur. J. A Glob. Perspect., January, 2024

Shadow IT in higher education: survey and case study for cybersecurity.
Cryptologia, January, 2024

Votexx: Extreme Coercion Resistance.
IACR Cryptol. ePrint Arch., 2024

A User Experience Study of MeetingMayhem: A Web-Based Game to Teach Adversarial Thinking.
Proceedings of the 2024 on Innovation and Technology in Computer Science Education V. 1, 2024

2023
Psychometric Evaluation of the Cybersecurity Curriculum Assessment.
Proceedings of the 54th ACM Technical Symposium on Computer Science Education, Volume 1, 2023

2022
Psychometric Evaluation of the Cybersecurity Concept Inventory.
ACM Trans. Comput. Educ., 2022

VoteXX: A Solution to Improper Influence in Voter-Verifiable Elections.
IACR Cryptol. ePrint Arch., 2022

UDM: Private user discovery with minimal information disclosure.
Cryptologia, 2022

Phrase-verified voting: Verifiable low-tech remote boardroom voting: How We Voted on Tenure & Promotion Cases during the Pandemic.
Cryptologia, 2022

2021
AOT: Anonymization by Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2021

Phrase-Verified Voting: Verifiable Low-Tech Remote Boardroom Voting.
CoRR, 2021

2020
Project-based learning continues to inspire cybersecurity students: the 2018-2019 SFS research studies at UMBC.
Inroads, 2020

Phishing in an academic community: A study of user susceptibility and behavior.
Cryptologia, 2020

Boardroom Voting: Verifiable Voting with Ballot Privacy Using Low-Tech Cryptography in a Single Room.
CoRR, 2020

Experiences and Lessons Learned Creating and Validating Concept Inventories for Cybersecurity.
Proceedings of the National Cyber Summit (NCS) Research Track 2020, 2020

Formal Methods Analysis of the Secure Remote Password Protocol.
Proceedings of the Logic, 2020

2019
Project-Based Learning Inspires Cybersecurity Students: A Scholarship-for-Service Research Study.
IEEE Secur. Priv., 2019

On the Origins and Variations of Blockchain Technologies.
IEEE Secur. Priv., 2019

The CATS Hackathon: Creating and Refining Test Items for Cybersecurity Concept Inventories.
IEEE Secur. Priv., 2019

The SFS summer research study at UMBC: Project-based learning inspires cybersecurity students.
Cryptologia, 2019

PPT: New Low Complexity Deterministic Primality Tests Leveraging Explicit and Implicit Non-Residues. A Set of Three Companion Manuscripts.
CoRR, 2019

Investigating Crowdsourcing to Generate Distractors for Multiple-Choice Assessments.
Proceedings of the National Cyber Summit, 2019

Initial Validation of the Cybersecurity Concept Inventory: Pilot Testing and Expert Review.
Proceedings of the IEEE Frontiers in Education Conference, 2019

2018
Identifying Core Concepts of Cybersecurity: Results of Two Delphi Processes.
IEEE Trans. Educ., 2018

Cybersecurity: Exploring core concepts through six scenarios.
Cryptologia, 2018

2017
Mini-MAC: Raising the bar for vehicular security with a lightweight message authentication protocol.
Veh. Commun., 2017

INSuRE: Collaborating Centers of Academic Excellence Engage Students in Cybersecurity Research.
IEEE Secur. Priv., 2017

Chaum's protocol for detecting man-in-the-middle: Explanation, demonstration, and timing studies for a text-messaging scenario.
Cryptologia, 2017

Creating a Cybersecurity Concept Inventory: A Status Report on the CATS Project.
CoRR, 2017

The INSuRE Project: CAE-Rs Collaborate to Engage Students in Cybersecurity Research.
CoRR, 2017

cMix: Mixing with Minimal Real-Time Asymmetric Cryptographic Operations.
Proceedings of the Applied Cryptography and Network Security, 2017

2016
cMix: Anonymization byHigh-Performance Scalable Mixing.
IACR Cryptol. ePrint Arch., 2016

How students reason about Cybersecurity concepts.
Proceedings of the 2016 IEEE Frontiers in Education Conference, 2016

2014
How to Generate Repeatable Keys Using Physical Unclonable Functions Correcting PUF Errors with Iteratively Broadening and Prioritized Search.
IACR Cryptol. ePrint Arch., 2014

DoubleMod and SingleMod: Simple Randomized Secret-Key Encryption with Bounded Homomorphicity.
IACR Cryptol. ePrint Arch., 2014

A Preliminary FPGA Implementation and Analysis of Phatak's Quotient-First Scaling Algorithm in the Reduced-Precision Residue Number System.
IACR Cryptol. ePrint Arch., 2014

SecurityEmpire: Development and Evaluation of a Digital Game to Promote Cybersecurity Education.
Proceedings of the 2014 USENIX Summit on Gaming, 2014

2013
Spread Identity: A new dynamic address remapping mechanism for anonymity and DDoS defense.
J. Comput. Secur., 2013

Design and implementation of FROST: Digital forensic tools for the OpenStack cloud computing platform.
Digit. Investig., 2013

2012
Acquiring forensic evidence from infrastructure-as-a-service cloud computing: Exploring and evaluating tools, trust, and techniques.
Digit. Investig., 2012

Location Authentication, Tracking, and Emergency Signaling through Power Line Communication: Designs and Protocols for New Out-of-Band Strategies.
Cryptologia, 2012

Change-Link: a digital forensic tool for visualizing changes to directory trees.
Proceedings of the 9th International Symposium on Visualization for Cyber Security, 2012

2011
Scantegrity III: Automatic Trustworthy Receipts, Highlighting Over/Under Votes, and Full Voter Verifiability.
Proceedings of the 2011 Electronic Voting Technology Workshop / Workshop on Trustworthy Elections, 2011

Catching the Cuckoo: Verifying TPM Proximity Using a Quote Timing Side-Channel - (Short Paper).
Proceedings of the Trust and Trustworthy Computing - 4th International Conference, 2011

A New Paradigm to Approximate Oblivious Data Processing (ODP) for Data Confidentiality in Cloud Computing.
Proceedings of the World Congress on Services, 2011

2010
Corrections to TPM meets DRE: reducing the trust base for electronic voting using trusted platform modules.
IEEE Trans. Inf. Forensics Secur., 2010

Corrections to scantegrity II: end-to-end verifiability by voters of optical scan elections through confirmation codes.
IEEE Trans. Inf. Forensics Secur., 2010

Scantegrity II Municipal Election at Takoma Park: The First E2E Binding Governmental Election with Ballot Privacy.
Proceedings of the 19th USENIX Security Symposium, 2010

Introducing the Trusted Virtual Environment Module: A New Mechanism for Rooting Trust in Cloud Computing.
Proceedings of the Trust and Trustworthy Computing, Third International Conference, 2010


2009
TPM meets DRE: reducing the trust base for electronic voting using trusted platform modules.
IEEE Trans. Inf. Forensics Secur., 2009

Scantegrity II: end-to-end verifiability by voters of optical scan elections through confirmation codes.
IEEE Trans. Inf. Forensics Secur., 2009

2008
Scantegrity: End-to-End Voter-Verifiable Optical-Scan Voting.
IEEE Secur. Priv., 2008

Scantegrity II: End-to-End Verifiability for Optical Scan Election Systems using Invisible Ink Confirmation Codes.
Proceedings of the 2008 USENIX/ACCURATE Electronic Voting Workshop, 2008

2006
An Examination of Vote Verification Technologies: Findings and Experiences from the Maryland Study.
Proceedings of the 2006 USENIX/ACCURATE Electronic Voting Technology Workshop, 2006

2003
Key Establishment in Large Dynamic Groups Using One-Way Function Trees.
IEEE Trans. Software Eng., 2003

1997
An Observation on Associative One-Way Functions in Complexity Theory.
Inf. Process. Lett., 1997

How to Break Gifford's Cipher.
Cryptologia, 1997

1995
Expected Wire Length between Two Randomly Chosen Terminals.
SIAM Rev., 1995

*Socrates 2.0 Beats Grandmaster Sagalchik.
J. Int. Comput. Games Assoc., 1995

1994
Experimental evaluation of a partitioning algorithm for the steiner tree problem in <i>R</i><sup>2</sup> and <i>R</i><sup>3</sup>.
Networks, 1994

Probabilistic analysis of an enhanced partitioning algorithm for the steiner tree problem in <i>R<sup>d</sup></i>.
Networks, 1994

Statistical Techniques for Language Recognition: an Empirical Study Using Real and Simulated English.
Cryptologia, 1994

How to Break Gifford's Cipher (extended abstract).
Proceedings of the CCS '94, 1994

1993
Statistical Techniques for Language Recognition: an Introduction and Guide for Cryptanalysts.
Cryptologia, 1993

1991
On Superpolylogarithlnic Subexponential Functions (Part I).
SIGACT News, 1991

1990
A Note on Bennett's Time-Space Tradeoff for Reversible Computation.
SIAM J. Comput., 1990

How we Solved the $100, 000 Decipher Puzzle (16 Hours too late).
Cryptologia, 1990

1989
VLSI Placement and Routing - The PI Project.
Texts and Monographs in Computer Science, Springer, ISBN: 978-1-4613-9658-1, 1989

1988
Is the Data Encryption Standard a Group? (Results of Cycling Experiments on DES).
J. Cryptol., 1988

1985
Is the Data Encryption Standard a Group? (Preliminary Abstract).
Proceedings of the Advances in Cryptology, 1985

Is DES a Pure Cipher? (Results of More Cycling Experiments on DES).
Proceedings of the Advances in Cryptology, 1985

1982
Randomized Encryption Techniques.
Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982


  Loading...