Analysis of a Subset Sum Randomizer. | 0 | 0.34 | 2001 |
Efficient and Fresh Cerification | 33 | 2.60 | 2000 |
On the Cryptographic Value of The qth Root Problem | 2 | 0.61 | 1999 |
Checking Properties of Polynomials (Extended Abstract) | 0 | 0.34 | 1997 |
On the Amount of Randomness Needed in Distributed Computations | 1 | 0.35 | 1997 |
Proactive RSA. | 79 | 9.72 | 1997 |
Witness-based cryptographic program checking and applications (an announcement) | 5 | 2.97 | 1996 |
Witness-based cryptographic program checking and robust function sharing | 41 | 7.05 | 1996 |
Symmetry Breaking in Anonymous Networks: Characterizations | 59 | 2.38 | 1996 |
Average Circuit Depth and Average Communication Complexity | 2 | 0.52 | 1995 |
Self-Correcting for Function Fields Transcendental Degree | 0 | 0.34 | 1995 |
Trustee-based tracing extensions to anonymous cash and the making of anonymous change | 90 | 10.54 | 1995 |
Tight bounds on expected time to add correctly and add mostly correctly | 3 | 0.51 | 1994 |
Selection in the presence of noise: the design of playoff systems | 10 | 2.12 | 1994 |
Checking the Correctness of Memories | 171 | 28.56 | 1994 |
Highly resilient correctors for polynomials | 77 | 16.53 | 1992 |
Self-testing/correcting for polynomials and for approximate functions | 102 | 23.39 | 1991 |