Information-theoretic security without an honest majority

Untraceable electronic mail, return addresses, and digital pseudonyms

D. Chaum · 1981

Earlier work this paper cites.

Verifiable secret sharing and achieving simultaneity in the presence of faults

B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch · 1985

Earlier work this paper cites.

Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract)

M. Ben-Or, S. Goldwasser, and A. Wigderson · 1988

Earlier work this paper cites.

Multiparty unconditionally secure protocols (extended abstract)

D. Chaum, C. Crépeau, and I. Damgård · 1988

Earlier work this paper cites.

The dining cryptographers problem: Unconditional sender and recipient untraceability

D. Chaum · 1988

Earlier work this paper cites.

Verifiable secret sharing and multiparty protocols with honest majority

T. Rabin and M. Ben-Or · 1989

Cited alongside, same era.

The dining cryptographers in the disco: Unconditional sender and recipient untraceability with computationally secure serviceability

M. Waidner and B. Pfitzmann · 1989

Cited alongside, same era.

Unconditional sender and recipient untraceability in spite of active attacks — some remarks

M. Waidner and B. Pfitzmann · 1989

Cited alongside, same era.

Receipt-free mix-type voting scheme — a practical solution to the implementation of a voting booth

K. Sako and J. Kilian · 1995

Cited alongside, same era.

Multi-authority secret-ballot elections with linear work

R. Cramer, M. Franklin, B. Schoenmakers, and M. Yung · 1996

Cited alongside, same era.

Designs, codes and cryptography

C. Padró, G. Sáez, and L. Villar J.\lx@bibnewblockDetection of cheaters in vector space secret sharing schemes · 1999

Later among the works it cites.

Simultaneous broadcast revisited

A. Hevia and D. Micciancio · 2005

Later among the works it cites.

Ballot casting assurance

B. Adida and C. A. Neff · 2006

Later among the works it cites.

Combinatorial codes for detection of algebraic manipulation and their applications

R. Cramer, S. Fehr, and C. Padró · 2007

Closest in time.