 | 2011 |
|---|
| 12 |       | Joël Alwen,
Jonathan Katz,
Ueli Maurer,
Vassilis Zikas:
Collusion-Preserving Computation.
IACR Cryptology ePrint Archive 2011: 433 (2011) |
| 11 | | Joël Alwen,
Chris Peikert:
Generating Shorter Bases for Hard Random Lattices.
Theory Comput. Syst. 48(3): 535-553 (2011) |
| 2010 |
|---|
| 10 | | Joël Alwen,
Yevgeniy Dodis,
Moni Naor,
Gil Segev,
Shabsi Walfish,
Daniel Wichs:
Public-Key Encryption in the Bounded-Retrieval Model.
EUROCRYPT 2010: 113-134 |
| 2009 |
|---|
| 9 | | Joël Alwen,
Yevgeniy Dodis,
Daniel Wichs:
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model.
CRYPTO 2009: 36-54 |
| 8 | | Joël Alwen,
Jonathan Katz,
Yehuda Lindell,
Giuseppe Persiano,
Abhi Shelat,
Ivan Visconti:
Collusion-Free Multiparty Computation in the Mediated Model.
CRYPTO 2009: 524-540 |
| 7 | | Joël Alwen,
Yevgeniy Dodis,
Daniel Wichs:
Survey: Leakage Resilience and the Bounded Retrieval Model.
ICITS 2009: 1-18 |
| 6 | | Joël Alwen,
Chris Peikert:
Generating Shorter Bases for Hard Random Lattices.
STACS 2009: 75-86 |
| 5 | | Joël Alwen,
Yevgeniy Dodis,
Daniel Wichs:
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model.
IACR Cryptology ePrint Archive 2009: 160 (2009) |
| 4 | | Joël Alwen,
Yevgeniy Dodis,
Moni Naor,
Gil Segev,
Shabsi Walfish,
Daniel Wichs:
Public-Key Encryption in the Bounded-Retrieval Model.
IACR Cryptology ePrint Archive 2009: 512 (2009) |
| 2008 |
|---|
| 3 | | Joël Alwen,
Abhi Shelat,
Ivan Visconti:
Collusion-Free Protocols in the Mediated Model.
CRYPTO 2008: 497-514 |
| 2 | | Joël Alwen,
Chris Peikert:
Generating Shorter Bases for Hard Random Lattices.
IACR Cryptology ePrint Archive 2008: 521 (2008) |
| 2005 |
|---|
| 1 | | Joël Alwen,
Giuseppe Persiano,
Ivan Visconti:
Impossibility and Feasibility Results for Zero Knowledge with Public Keys.
CRYPTO 2005: 135-151 |
Data released under the ODC-BY 1.0 license — See also our legal information page