Search results for "Zvika Brakerski"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Zvika Brakerski, Yael Tauman Kalai	Efficient Interactive Coding Against Adversarial Noise.	Electronic Colloquium on Computational Complexity (ECCC)	2012	DBLP BibTeX RDF
1	Zvika Brakerski	When Homomorphism Becomes a Liability.	IACR Cryptology ePrint Archive	2012	DBLP BibTeX RDF
1	Zvika Brakerski	Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP.	IACR Cryptology ePrint Archive	2012	DBLP BibTeX RDF
1	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	DBLP BibTeX RDF
1	Zvika Brakerski, Yael Tauman Kalai	A Parallel Repetition Theorem for Leakage Resilience.	TCC	2012	DBLP DOI BibTeX RDF
1	Zvika Brakerski, Craig Gentry, Vinod Vaikuntanathan	(Leveled) fully homomorphic encryption without bootstrapping.	ITCS	2012	DBLP DOI BibTeX RDF
1	Zvika Brakerski, Vinod Vaikuntanathan	Efficient Fully Homomorphic Encryption from (Standard) LWE.	Electronic Colloquium on Computational Complexity (ECCC)	2011	DBLP BibTeX RDF
1	Zvika Brakerski, Craig Gentry, Vinod Vaikuntanathan	Fully Homomorphic Encryption without Bootstrapping.	Electronic Colloquium on Computational Complexity (ECCC)	2011	DBLP BibTeX RDF
1	Zvika Brakerski, Yael Tauman Kalai	A Parallel Repetition Theorem for Leakage Resilience.	IACR Cryptology ePrint Archive	2011	DBLP BibTeX RDF
1	Zvika Brakerski, Gil Segev	Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting.	IACR Cryptology ePrint Archive	2011	DBLP BibTeX RDF
1	Zvika Brakerski, Vinod Vaikuntanathan	Efficient Fully Homomorphic Encryption from (Standard) LWE.	IACR Cryptology ePrint Archive	2011	DBLP BibTeX RDF
1	Zvika Brakerski, Craig Gentry, Vinod Vaikuntanathan	Fully Homomorphic Encryption without Bootstrapping.	IACR Cryptology ePrint Archive	2011	DBLP BibTeX RDF
1	Zvika Brakerski, Boaz Patt-Shamir	Distributed discovery of large near-cliques.	Distributed Computing	2011	DBLP DOI BibTeX RDF
1	Zvika Brakerski, Oded Goldreich	From Absolute Distinguishability to Positive Distinguishability.	Studies in Complexity and Cryptography	2011	DBLP DOI BibTeX RDF
1	Zvika Brakerski, Jonathan Katz, Gil Segev, Arkady Yerukhimovich	Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions.	TCC	2011	DBLP DOI BibTeX RDF
1	Zvika Brakerski, Shafi Goldwasser, Yael Tauman Kalai	Black-Box Circular-Secure Encryption beyond Affine Functions.	TCC	2011	DBLP DOI BibTeX RDF
1	Zvika Brakerski, Gil Segev	Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting.	CRYPTO	2011	DBLP DOI BibTeX RDF
1	Zvika Brakerski, Vinod Vaikuntanathan	Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages.	CRYPTO	2011	DBLP DOI BibTeX RDF
1	Zvika Brakerski, Vinod Vaikuntanathan	Efficient Fully Homomorphic Encryption from (Standard) LWE.	FOCS	2011	DBLP DOI BibTeX RDF
1	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	DBLP BibTeX RDF
1	Zvika Brakerski, Shafi Goldwasser	Circular and Leakage Resilient Public-Key Encryption Under Subgroup Indistinguishability (or: Quadratic Residuosity Strikes Back).	IACR Cryptology ePrint Archive	2010	DBLP BibTeX RDF
1	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	DBLP BibTeX RDF
1	Zvika Brakerski, Shafi Goldwasser	Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability - (or: Quadratic Residuosity Strikes Back).	CRYPTO	2010	DBLP DOI BibTeX RDF
1	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	DBLP DOI BibTeX RDF
1	Zvika Brakerski, Oded Goldreich	From absolute distinguishability to positive distinguishability.	Electronic Colloquium on Computational Complexity (ECCC)	2009	DBLP BibTeX RDF
1	Zvika Brakerski, Shafi Goldwasser, Yael Tauman Kalai	Black-Box Circular-Secure Encryption Beyond Affine Functions.	IACR Cryptology ePrint Archive	2009	DBLP BibTeX RDF
1	Zvika Brakerski, Boaz Patt-Shamir	Distributed Discovery of Large Near-Cliques	CoRR	2009	DBLP BibTeX RDF
1	Zvika Brakerski, Boaz Patt-Shamir	Distributed Discovery of Large Near-Cliques.	DISC	2009	DBLP DOI BibTeX RDF
1	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	DBLP DOI BibTeX RDF
1	Zvika Brakerski, Boaz Patt-Shamir	Distributed discovery of large near-cliques.	PODC	2009	DBLP DOI BibTeX RDF	randomized algorithms, communication networks, property testing, clique
1	Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum, Vinod Vaikuntanathan	Weak Verifiable Random Functions.	TCC	2009	DBLP DOI BibTeX RDF
1	Zvika Brakerski, Aviv Nisgav, Boaz Patt-Shamir	General Perfectly Periodic Scheduling.	Algorithmica	2006	DBLP DOI BibTeX RDF	Approximation algorithms, Periodic scheduling
1	Zvika Brakerski, Boaz Patt-Shamir	Jitter-approximation tradeoff for periodic scheduling.	Wireless Networks	2006	DBLP DOI BibTeX RDF	Jitter minimization, Perfect periodicity, Asymmetric communication, Periodic scheduling
1	Zvika Brakerski, Boaz Patt-Shamir	Jitter-Approximation Tradeoff for Periodic Scheduling.	IPDPS	2004	DBLP DOI BibTeX RDF
1	Zvika Brakerski, Vladimir Dreizin, Boaz Patt-Shamir	Dispatching in perfectly-periodic schedules.	J. Algorithms	2003	DBLP DOI BibTeX RDF
1	Zvika Brakerski, Aviv Nisgav, Boaz Patt-Shamir	General perfectly periodic scheduling.	PODC	2002	DBLP DOI BibTeX RDF

Publications of "Zvika Brakerski" ( http://dblp.L3S.de/Authors/Zvika_Brakerski )