| Asymptotic distribution for the birthday problem with multiple coincidences, via an embedding of the collision process. | 0 | 0.34 | 2016 |
| Efficient identification schemes using two prover interactive proofs | 8 | 1.66 | 1989 |
| Founding crytpography on oblivious transfer | 480 | 33.02 | 1988 |
| Multi-prover interactive proofs: how to remove intractability assumptions | 219 | 53.90 | 1988 |
