 | 2011 |
| 43 |  | Michael J. Fischer,
Michaela Iorga,
René Peralta:
A Public Randomness Service.
SECRYPT 2011: 434-438 |
| 42 |  | Joan Boyar,
René Peralta:
A depth-16 circuit for the AES S-box.
IACR Cryptology ePrint Archive 2011: 332 (2011) |
| 2010 |
| 41 |  | Joan Boyar,
René Peralta:
A New Combinational Logic Minimization Technique with Applications to Cryptology.
SEA 2010: 178-189 |
| 2009 |
| 40 |  | Joan Boyar,
René Peralta:
New logic minimization techniques with applications to cryptology.
IACR Cryptology ePrint Archive 2009: 191 (2009) |
| 2008 |
| 39 |  | Joan Boyar,
Philip Matthews,
René Peralta:
On the Shortest Linear Straight-Line Program for Computing Linear Forms.
MFCS 2008: 168-179 |
| 38 |  | Joan Boyar,
René Peralta:
Tight bounds for the multiplicative complexity of symmetric functions.
Theor. Comput. Sci. 396(1-3): 223-246 (2008) |
| 2007 |
| 37 |  | Juan A. Garay,
Arjen K. Lenstra,
Masahiro Mambo,
René Peralta:
Information Security, 10th International Conference, ISC 2007, Valparaíso, Chile, October 9-12, 2007, Proceedings
Springer 2007 |
| 2006 |
| 36 |  | Joan Boyar,
René Peralta:
Concrete Multiplicative Complexity of Symmetric Functions.
MFCS 2006: 179-189 |
| 35 |  | Dana Angluin,
James Aspnes,
Zoë Diamadi,
Michael J. Fischer,
René Peralta:
Computation in networks of passively mobile finite-state sensors.
Distributed Computing 18(4): 235-253 (2006) |
| 2005 |
| 34 |  | James Aspnes,
Zoë Diamadi,
Kristian Gjøsteen,
René Peralta,
Aleksandr Yampolskiy:
Spreading Alerts Quietly and the Subgroup Escape Problem.
ASIACRYPT 2005: 253-272 |
| 33 |  | Dana Angluin,
James Aspnes,
Melody Chan,
Michael J. Fischer,
Hong Jiang,
René Peralta:
Stably Computable Properties of Network Graphs.
DCOSS 2005: 63-74 |
| 32 |  | René Peralta:
Dark Encounter Computations.
MADNES 2005: 182-185 |
| 31 |  | René Peralta:
Cryptographic Primitives Can Be Fragile.
VISSAS 2005: 143-148 |
| 30 |  | Joan Boyar,
René Peralta:
The Exact Multiplicative Complexity of the Hamming Weight Function
Electronic Colloquium on Computational Complexity (ECCC)(049): (2005) |
| 29 |  | James Aspnes,
Zoë Diamadi,
Kristian Gjøsteen,
René Peralta,
Aleksandr Yampolskiy:
Spreading Alerts Quietly and the Subgroup Escape Problem.
IACR Cryptology ePrint Archive 2005: 282 (2005) |
| 2004 |
| 28 |  | Dana Angluin,
James Aspnes,
Zoë Diamadi,
Michael J. Fischer,
René Peralta:
Computation in networks of passively mobile finite-state sensors.
PODC 2004: 290-299 |
| 2003 |
| 27 |  | René Peralta:
Issues, Non-Issues, and Cryptographic Tools for Internet-Based Voting.
Secure Electronic Voting 2003: 153-164 |
| 26 |  | Sigrid Gürgens,
Javier Lopez,
René Peralta:
Analysis of e-commerce protocols: Adapting a traditional technique.
Int. J. Inf. Sec. 2(1): 21-36 (2003) |
| 2000 |
| 25 |  | Sigrid Gürgens,
René Peralta:
Validation of Cryptographic Protocols by Efficient Automated Testing.
FLAIRS Conference 2000: 7-12 |
| 24 |  | Joan Boyar,
Ivan Damgård,
René Peralta:
Short Non-Interactive Cryptographic Proofs.
J. Cryptology 13(4): 449-472 (2000) |
| 23 |  | Joan Boyar,
René Peralta,
Denis Pochuev:
On the multiplicative complexity of Boolean functions over the basis (cap, +, 1).
Theor. Comput. Sci. 235(1): 43-57 (2000) |
| 1999 |
| 22 |  | Sigrid Gürgens,
Javier Lopez,
René Peralta:
Efficient Detection of Failure Modes in Electronic Commerce Protocols.
DEXA Workshop 1999: 850-857 |
| 21 |  | Jorge Davila,
Javier Lopez,
René Peralta:
Implementation of Virtual Private Networks at the Transport Layer.
ISW 1999: 85-102 |
| 1997 |
| 20 |  | George I. Davida,
René Peralta:
High-Speed Cryptography.
ISW 1997: 116-120 |
| 1996 |
| 19 |  | Joan Boyar,
René Peralta:
Short Discrete Proofs.
EUROCRYPT 1996: 131-142 |
| 18 |  | Eric Bach,
René Peralta:
Asymptotic semismoothness probabilities.
Math. Comput. 65(216): 1701-1715 (1996) |
| 1995 |
| 17 |  | Joan Boyar,
Gilles Brassard,
René Peralta:
Subquadratic Zero-Knowledge.
J. ACM 42(6): 1169-1193 (1995) |
| 1993 |
| 16 |  | René Peralta,
Victor Shoup:
Primality Testing with Fewer Random Bits.
Computational Complexity 3: 355-367 (1993) |
| 15 |  | Joan Boyar,
Carsten Lund,
René Peralta:
On the Communication Complexity of Zero-Knowledge Proofs.
J. Cryptology 6(2): 65-85 (1993) |
| 14 |  | Noga Alon,
Oded Goldreich,
Johan Håstad,
René Peralta:
Addendum to "Simple Construction of Almost k-wise Independent Random Variables".
Random Struct. Algorithms 4(1): 119-120 (1993) |
| 1992 |
| 13 |  | René Peralta:
A Quadratic Sieve on the n-Dimensional Cube.
CRYPTO 1992: 324-332 |
| 12 |  | Noga Alon,
Oded Goldreich,
Johan Håstad,
René Peralta:
Simple Construction of Almost k-wise Independent Random Variables.
Random Struct. Algorithms 3(3): 289-304 (1992) |
| 1991 |
| 11 |  | Joan Boyar,
Gilles Brassard,
René Peralta:
Subquadratic Zero-Knowledge
FOCS 1991: 69-78 |
| 1990 |
| 10 |  | George I. Davida,
Yvo Desmedt,
René Peralta:
On the Importance of Memory Resources in the Security of Key Exchange Protocols.
EUROCRYPT 1990: 11-15 |
| 9 |  | Noga Alon,
Oded Goldreich,
Johan Håstad,
René Peralta:
Simple Constructions of Almost k-Wise Independent Random Variables
FOCS 1990: 544-553 |
| 1989 |
| 8 |  | Joan Boyar,
René Peralta:
On the Concrete Complexity of Zero-Knowledge Proofs.
CRYPTO 1989: 507-525 |
| 7 |  | George I. Davida,
Yvo Desmedt,
René Peralta:
A Key Distribution System Based On Any One-Way Function (Extended Abstract).
EUROCRYPT 1989: 75-79 |
| 1987 |
| 6 |  | Jeroen van de Graaf,
René Peralta:
A Simple and Secure Way to Show the Validity of Your Public Key.
CRYPTO 1987: 128-134 |
| 1986 |
| 5 |  | David Chaum,
Jan-Hendrik Evertse,
Jeroen van de Graaf,
René Peralta:
Demonstrating Possession of a Discrete Logarithm Without Revealing It.
CRYPTO 1986: 200-212 |
| 4 |  | René Peralta,
Jeroen van de Graaf:
A Simple an Fast Probabilistic Algorithm for Computing Square Roots Modulo a Prime Number.
EUROCRYPT 1986: 15 |
| 1985 |
| 3 |  | Richard Berger,
Sampath Kannan,
René Peralta:
A Framework for the Study of Cryptographic Protocols.
CRYPTO 1985: 87-103 |
| 2 |  | René Peralta:
Simultaneous Security of Bits in the Discrete Log.
EUROCRYPT 1985: 62-72 |
| 1984 |
| 1 |  | Richard Berger,
René Peralta,
Tom Tedrick:
A Provably Secure Oblivious Transfer Protocol.
EUROCRYPT 1984: 379-386 |