This paper describes a simple candidate one-way hash function which satisfies a quasi-commutative property that allows it to be used as an accumulator. This property allows protocols to be developed in which the need for a trusted central authority can be eliminated. Space-efficient distributed protocols are given for document time stamping and for membership testing, and many other applications are possible. 1
|
2079
|
A method for obtaining digital signatures and public-key cryptosystems
– Rivest, Shamir, et al.
- 1978
|
|
494
|
Completeness theorems for non-cryptographic fault-tolerant distributed computation
– Ben-Or, Goldwasser, et al.
- 1988
|
|
490
|
Construction of Pseudorandom Generator from any One-Way Function", manuscript
– Hastad, Impagliazzo, et al.
- 1993
|
|
419
|
Cryptography and Data Security
– Denning
- 1982
|
|
352
|
How to play any mental game — a completeness theorem for protocols with honest majority
– Goldreich, Micali, et al.
- 1987
|
|
316
|
Multiparty unconditionally secure protocols
– Chaum, Crepeau, et al.
- 1988
|
|
254
|
Universal One-way Hash Functions and their Cryptographic Applications. 21st STOC
– Naor, Yung
- 1989
|
|
177
|
Protocols for Public Key Cryptosystems
– Merkle
- 1980
|
|
166
|
Verifiable Secret Sharing and Multi-party Protocols with Honest Majority. [STOC
– Rabin, Ben-Or
- 1989
|
|
156
|
One-way functions are necessary and sufficient for secure signatures
– Rompel
|
|
154
|
Another advantage of free choice: Completely asynchronous agreement protocols (extended abstract
– Ben-Or
- 1983
|
|
145
|
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
– Goldreich, Wigderson
- 1986
|
|
143
|
Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract
– Chor, Goldwasser, et al.
- 1985
|
|
131
|
Randomized Byzantine generals
– Rabin
- 1983
|
|
95
|
The consensus problem in unreliable distributed systems (a brief survey
– Fischer
- 1983
|
|
80
|
Fair Computation of General Functions
– Goldwasser, Levin
- 1990
|
|
68
|
Fair computation of general functions in presence of immoral majority
– Goldwasser, Levin
- 1990
|
|
62
|
On the generation of cryptographically strong pseudo random sequences
– Shamir
- 1981
|
|
59
|
Multiparty computation with faulty majority
– Beaver, Goldwasser
- 1989
|
|
27
|
Multiparty protocols tolerating half faulty processors
– Beaver
|
|
26
|
M.: Efficient Broadcast time-stamping
– Benaloh, Mare
- 1991
|
|
25
|
Efficient Multiparty Protocols Using Circuit Randomization.” Advances an Cryptology - Crypto ’91
– Beaver
- 1992
|
|
11
|
On the Numerical Solution of a Differential-Difference Equation Arising in Analytic Number Theory.” Mathematics of Computation 29
– Lune, Wattel
- 1969
|
|
8
|
Collective coin tossing without assumptions nor broadcasting
– Micali, Rabin
- 1990
|
|
5
|
The asymptotic behaviour of a function occurring in the theory of primes
– Bruijn
- 1951
|
|
5
|
Analysis of a simple factorization algorithm, Theoretical Computer Science 3
– Knuth, Pardo
- 1976
|
|
2
|
An Evaluation of Golomb's Constant
– Mitchell
- 1968
|
|
1
|
How to Time-Stamp a Digital Document." Jounal of Cryptology 3
– Haber, Stornetta
- 1991
|
|
1
|
Analysis of a Simple Factorization Algorithm. " Theoretical Computer Science 3
– Knuth, Pardo, et al.
- 1976
|
|
1
|
The Asymptotic Behaviour of a Function Occurring
– BruUn
- 1951
|
|
1
|
How to Time-Stamp a Digital Document.” Jounol of Cryptology 9
– Haber, Stornetta
- 1991
|
|
1
|
Universal One-way Hash Functions aud their Cryptographic Applications
– Naor, Yung
- 1989
|
|
