 | 2012 |
| 36 |  | Zvika Brakerski,
Craig Gentry,
Vinod Vaikuntanathan:
(Leveled) fully homomorphic encryption without bootstrapping.
ITCS 2012: 309-325 |
| 35 |  | Zvika Brakerski,
Yael Tauman Kalai:
A Parallel Repetition Theorem for Leakage Resilience.
TCC 2012: 248-265 |
| 34 |  | Zvika Brakerski,
Yael Tauman Kalai:
Efficient Interactive Coding Against Adversarial Noise.
Electronic Colloquium on Computational Complexity (ECCC) 19: 43 (2012) |
| 33 |  | Mihir Bellare,
Zvika Brakerski,
Moni Naor,
Thomas Ristenpart,
Gil Segev,
Hovav Shacham,
Scott Yilek:
Hedged Public-key Encryption: How to Protect against Bad Randomness.
IACR Cryptology ePrint Archive 2012: 220 (2012) |
| 32 |  | Zvika Brakerski:
When Homomorphism Becomes a Liability.
IACR Cryptology ePrint Archive 2012: 225 (2012) |
| 31 |  | Zvika Brakerski:
Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP.
IACR Cryptology ePrint Archive 2012: 78 (2012) |
| 2011 |
| 30 |  | Zvika Brakerski,
Vinod Vaikuntanathan:
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages.
CRYPTO 2011: 505-524 |
| 29 |  | Zvika Brakerski,
Gil Segev:
Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting.
CRYPTO 2011: 543-560 |
| 28 |  | Zvika Brakerski,
Vinod Vaikuntanathan:
Efficient Fully Homomorphic Encryption from (Standard) LWE.
FOCS 2011: 97-106 |
| 27 |  | Zvika Brakerski,
Shafi Goldwasser,
Yael Tauman Kalai:
Black-Box Circular-Secure Encryption beyond Affine Functions.
TCC 2011: 201-218 |
| 26 |  | Zvika Brakerski,
Jonathan Katz,
Gil Segev,
Arkady Yerukhimovich:
Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions.
TCC 2011: 559-578 |
| 25 |  | Zvika Brakerski,
Oded Goldreich:
From Absolute Distinguishability to Positive Distinguishability.
Studies in Complexity and Cryptography 2011: 141-155 |
| 24 |  | Zvika Brakerski,
Boaz Patt-Shamir:
Distributed discovery of large near-cliques.
Distributed Computing 24(2): 79-89 (2011) |
| 23 |  | Zvika Brakerski,
Vinod Vaikuntanathan:
Efficient Fully Homomorphic Encryption from (Standard) LWE.
Electronic Colloquium on Computational Complexity (ECCC) 18: 109 (2011) |
| 22 |  | Zvika Brakerski,
Craig Gentry,
Vinod Vaikuntanathan:
Fully Homomorphic Encryption without Bootstrapping.
Electronic Colloquium on Computational Complexity (ECCC) 18: 111 (2011) |
| 21 |  | Zvika Brakerski,
Gil Segev:
Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting.
IACR Cryptology ePrint Archive 2011: 209 (2011) |
| 20 |  | Zvika Brakerski,
Yael Tauman Kalai:
A Parallel Repetition Theorem for Leakage Resilience.
IACR Cryptology ePrint Archive 2011: 250 (2011) |
| 19 |  | Zvika Brakerski,
Craig Gentry,
Vinod Vaikuntanathan:
Fully Homomorphic Encryption without Bootstrapping.
IACR Cryptology ePrint Archive 2011: 277 (2011) |
| 18 |  | Zvika Brakerski,
Vinod Vaikuntanathan:
Efficient Fully Homomorphic Encryption from (Standard) LWE.
IACR Cryptology ePrint Archive 2011: 344 (2011) |
| 2010 |
| 17 |  | Zvika Brakerski,
Shafi Goldwasser:
Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability - (or: Quadratic Residuosity Strikes Back).
CRYPTO 2010: 1-20 |
| 16 |  | Zvika Brakerski,
Yael Tauman Kalai,
Jonathan Katz,
Vinod Vaikuntanathan:
Overcoming the Hole in the Bucket: Public-Key Cryptography Resilient to Continual Memory Leakage.
FOCS 2010: 501-510 |
| 15 |  | Zvika Brakerski,
Shafi Goldwasser:
Circular and Leakage Resilient Public-Key Encryption Under Subgroup Indistinguishability (or: Quadratic Residuosity Strikes Back).
IACR Cryptology ePrint Archive 2010: 226 (2010) |
| 14 |  | Zvika Brakerski,
Yael Tauman Kalai,
Jonathan Katz,
Vinod Vaikuntanathan:
Overcoming the Hole In The Bucket: Public-Key Cryptography Resilient to Continual Memory Leakage.
IACR Cryptology ePrint Archive 2010: 278 (2010) |
| 13 |  | Zvika Brakerski,
Yael Tauman Kalai:
A Framework for Efficient Signatures, Ring Signatures and Identity Based Encryption in the Standard Model.
IACR Cryptology ePrint Archive 2010: 86 (2010) |
| 2009 |
| 12 |  | Mihir Bellare,
Zvika Brakerski,
Moni Naor,
Thomas Ristenpart,
Gil Segev,
Hovav Shacham,
Scott Yilek:
Hedged Public-Key Encryption: How to Protect against Bad Randomness.
ASIACRYPT 2009: 232-249 |
| 11 |  | Zvika Brakerski,
Boaz Patt-Shamir:
Distributed Discovery of Large Near-Cliques.
DISC 2009: 206-220 |
| 10 |  | Zvika Brakerski,
Boaz Patt-Shamir:
Distributed discovery of large near-cliques.
PODC 2009: 324-325 |
| 9 |  | Zvika Brakerski,
Shafi Goldwasser,
Guy N. Rothblum,
Vinod Vaikuntanathan:
Weak Verifiable Random Functions.
TCC 2009: 558-576 |
| 8 |  | Zvika Brakerski,
Boaz Patt-Shamir:
Distributed Discovery of Large Near-Cliques
CoRR abs/0905.4147: (2009) |
| 7 |  | Zvika Brakerski,
Oded Goldreich:
From absolute distinguishability to positive distinguishability.
Electronic Colloquium on Computational Complexity (ECCC) 16: 31 (2009) |
| 6 |  | Zvika Brakerski,
Shafi Goldwasser,
Yael Tauman Kalai:
Black-Box Circular-Secure Encryption Beyond Affine Functions.
IACR Cryptology ePrint Archive 2009: 485 (2009) |
| 2006 |
| 5 |  | Zvika Brakerski,
Aviv Nisgav,
Boaz Patt-Shamir:
General Perfectly Periodic Scheduling.
Algorithmica 45(2): 183-208 (2006) |
| 4 |  | Zvika Brakerski,
Boaz Patt-Shamir:
Jitter-approximation tradeoff for periodic scheduling.
Wireless Networks 12(6): 723-731 (2006) |
| 2004 |
| 3 |  | Zvika Brakerski,
Boaz Patt-Shamir:
Jitter-Approximation Tradeoff for Periodic Scheduling.
IPDPS 2004 |
| 2003 |
| 2 |  | Zvika Brakerski,
Vladimir Dreizin,
Boaz Patt-Shamir:
Dispatching in perfectly-periodic schedules.
J. Algorithms 49(2): 219-239 (2003) |
| 2002 |
| 1 |  | Zvika Brakerski,
Aviv Nisgav,
Boaz Patt-Shamir:
General perfectly periodic scheduling.
PODC 2002: 163-172 |