• Publications
  • Influence
Generalized Secret Sharing and Monotone Functions
This paper will present general methods for constructing secret sharing schemes for any given secret sharing function using the set of monotone functions and tools developed for simplifying the latter set can be applied equally well to the former set.
Secret sharing homomorphisms: keeping shares of a secret secret
A homomorphism property attained by these and several other secret sharing schemes which allows multiple secrets to be combined by direct computation on shares is described which reduces the need for trust among agents and allows secret sharing to be applied to many new problems.
Verifiable secret-ballot elections
This thesis describes a practical scheme for conducting secret-ballot elections in which the outcome of an election is verifiable by all participants and even by non-participating observers.
One-Way Accumulators: A Decentralized Alternative to Digital Sinatures (Extended Abstract)
A simple candidate one-way hash function which satisfies a quasi-commutative property that allows it to be used as an accumulator is described, which allows protocols to be developed in which the need for a trusted central authority can be eliminated.
Patient controlled encryption: ensuring privacy of electronic medical records
It is shown that an efficient system that allows patients both to share partial access rights with others, and to perform searches over their records is built, based on existing cryptographic primitives and protocols, each achieving a different set of properties.
Receipt-Free Secret-Ballot Elections
Dense Probabilistic Encryption
A method of probabilistic encryption in which the ratio of ciphertext text size to plain text size and the proportion of random bits to plaintext can both be made arbitrarily close to one is developed.
Receipt-free secret-ballot elections (extended abstract)
This paper presents the first verifiable secret-ballot election protocols in which participants are unable to prove to others how they voted, and describes how this defect is embedded within prior election protocols.
A robust and verifiable cryptographically secure election scheme
  • Josh Benaloh, M. Fischer
  • Computer Science, Mathematics
    26th Annual Symposium on Foundations of Computer…
  • 21 October 1985
A cryptographic scheme for holding a secure secret ballot election in which all communication is public is described, which introduces a new form of "interactive proof" by which one participant gives passive observers high confidence that certain claims are true without releasing related private information.
Simple Verifiable Elections
This paper describes a relatively simple but still effective approach to cryptographic elections, not as computationally efficient as previously proposed cryptographic approaches, but intended to be more accessible and therefore more suitable for comparison with other voting systems.