| Cryptography miracles, secure auctions, matching problem verification | 2 | 0.36 | 2014 |
| Strictly-black-box zero-knowledge and efficient validation of financial transactions | 5 | 0.46 | 2012 |
| Never too early to begin: computer science for high-school students | 0 | 0.34 | 2012 |
| An interview with Michael Rabin | 0 | 0.34 | 2010 |
| Cryptographic Combinatorial Clock-Proxy Auctions | 1 | 0.37 | 2009 |
| DISC 20th Anniversary: Invited Talk Provably Unbreakable Hyper-Encryption Using Distributed Systems | 0 | 0.34 | 2007 |
| Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications | 8 | 0.50 | 2007 |
| How To Exchange Secrets with Oblivious Transfer. | 161 | 34.76 | 2005 |
| Provably unbreakable hyper-encryption in the limited access model | 7 | 0.67 | 2005 |
| Identity-based zero-knowledge | 1 | 0.35 | 2004 |
| Zero-knowledge sets | 89 | 3.07 | 2003 |
| Online Scheduling of Parallel Programs on Heterogeneous Systems with Applications to Cilk | 36 | 1.87 | 2002 |
| Hyper Encryption and Everlasting Secrets | 1 | 0.38 | 2002 |
| Everlasting security in the bounded storage model | 69 | 4.51 | 2002 |
| Scheduling Cilk multithreaded parallel programs on processors of different speeds | 16 | 1.67 | 2000 |
| Verifiable random functions | 133 | 5.24 | 1999 |
| Linear-consistency testing | 7 | 0.89 | 1999 |
| Information Theoretically Secure Communication in the Limited Storage Space Model | 38 | 2.18 | 1999 |
| Lower Bounds for Randomized Mutual Exclusion | 7 | 0.87 | 1998 |
| Authentication, Enhanced Security and Error Correcting Codes (Extended Abstract) | 19 | 2.23 | 1998 |
| Simplified VSS and fast-track multiparty computations with applications to threshold cryptography | 201 | 10.63 | 1998 |
| Hashing on Strings, Cryptography, and Protection of Privacy | 1 | 0.40 | 1997 |
| Correctness of Programs and Protocols through Randomization (Extended Abstract) | 0 | 0.34 | 1997 |
| Computationally Hard Algebraic Problems (extended abstract) | 0 | 0.34 | 1996 |
| Parallel processing on networks of workstations: a fault-tolerant, high performance approach | 25 | 3.80 | 1995 |
| On Lotteries with Unique Winners | 2 | 0.86 | 1995 |
| Clock construction in fully asynchronous parallel systems and PRAM simulation | 27 | 1.72 | 1994 |
| Highly efficient asynchronous execution of large-grained parallel programs | 25 | 4.86 | 1993 |
| Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation (Extended Abstract) | 10 | 1.04 | 1992 |
| Efficient program transformations for resilient parallel computation via randomization (preliminary version) | 20 | 1.08 | 1992 |
| Randomized mutual exclusion algorithms revisited | 20 | 2.58 | 1992 |
| Dependable Parallel Computing by Randomization (Abstract) | 0 | 0.34 | 1992 |
| Set systems with no union of cardinality 0 modulo<Emphasis Type="Italic">m</Emphasis> | 3 | 0.66 | 1991 |
| Biased coins and randomized algorithms | 6 | 1.50 | 1989 |
| Efficient dispersal of information for security, load balancing, and fault tolerance | 423 | 138.88 | 1989 |
| ITOSS: an integrated toolkit for operating systems security | 4 | 4.06 | 1989 |
| Maximum matchings in general graphs through randomization | 53 | 12.83 | 1989 |
| Achieving independence in logarithmic number of rounds | 23 | 9.18 | 1987 |
| A logic to reason about likelihood | 40 | 17.86 | 1987 |
| Efficient randomized pattern-matching algorithms | 388 | 58.80 | 1987 |
| Randomized byzantine generals | 188 | 67.18 | 1983 |
| Transaction protection by beacons | 61 | 19.99 | 1983 |
| N-Process mutual exclusion with bounded waiting by 4 · Log2 N-valued shared variable | 25 | 3.56 | 1982 |
| The choice coordination problem | 61 | 25.92 | 1982 |
| On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem | 110 | 39.17 | 1981 |
| N-Process Synchronization by 4 log _2 N-Valued Shared Variables | 7 | 20.48 | 1980 |
| PROBABILISTIC ALGORITHM IN FINITE FIELDS | 81 | 52.27 | 1980 |
| A characterization of the power of vector machines | 26 | 36.44 | 1974 |
| Theoretical Impediments to Artificial Intelligence | 19 | 14.96 | 1974 |
| Solving linear equations by means of scalar products | 2 | 19.77 | 1972 |
