- Full text PDF available (45)
- This year (2)
- Last 5 years (7)
- Last 10 years (25)
Journals and Conferences
A technique based on public key cryptography is presented that allows an electronic mail system to hide who a participant communicates with as well as the content of the communication--in spite of an unsecured underlying telecommunication system. The technique does not require a universally trusted authority. One correspondent can remain anonymous to a… (More)
Keeping confidential who sends which messages, in a world where any physical transmission can be traced to its origin, seems impossible. The solution presented here is unconditionally or cryptographically secure, depending on whether it is based on one-time-use keys or on public keys, respectively. It can be adapted to address efficiently a wide variety of… (More)
The large-scale automated transaction systems of the near future can be designed to protect the privacy and maintain the security of both individuals and organizations.
Previously there have been essentially on!? t\vo models for computers t h a t people can use to handle ordinary consumer transactions: <i:i :he tamper-proof module, such as a smart card, that the person cannot modify or probe; and ( 2 ) the personal workstation whose inner working is totally under control of the individual. The first par t of this article… (More)
We present an election scheme designed to allow voters to verify that their vote is accurately included in the tabulation. The scheme provides a high degree of transparency whilst ensuring the secrecy of votes. Assurance is derived from close auditing of all the steps of the vote recording and counting process with minimal dependence on the system… (More)
A new kind of receipt sets a far higher standard of security by letting voters verify the election outcome - even if all election computers and records were compromised. The system preserves ballot secrecy, while improving access, robustness, and adjucation, all at lower cost.
Protocols are given for allowing a “prover” to convince a “verifier” that the prover knows some verifiable secret information, without allowing the verifier to learn anything about the secret. The secret can be probabilistically or deterministically verifiable, and only one of the prover or the verifier need have constrained resources. This paper unifies… (More)