Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarElette Boyle
Person information
- affiliation: IDC Herzliya, Herzliya, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c35]Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Cryptography from Information Loss. ITCS 2020: 81:1-81:27- [i32]Elette Boyle, Ran Cohen, Aarushi Goel:
Succinctly Reconstructed Distributed Signatures and Balanced Byzantine Agreement. CoRR abs/2002.02516 (2020) - [i31]Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Cryptography from Information Loss. Electronic Colloquium on Computational Complexity (ECCC) 27: 44 (2020) - [i30]Elette Boyle, Ran Cohen, Aarushi Goel:
Succinctly Reconstructed Distributed Signatures and Balanced Byzantine Agreement. IACR Cryptol. ePrint Arch. 2020: 130 (2020) - [i29]Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Cryptography from Information Loss. IACR Cryptol. ePrint Arch. 2020: 395 (2020)
2010 – 2019
- 2019
- [c34]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Rindal, Peter Scholl:
Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation. ACM Conference on Computer and Communications Security 2019: 291-308 - [c33]Elette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof:
Practical Fully Secure Three-Party Computation via Sublinear Distributed Zero-Knowledge Proofs. ACM Conference on Computer and Communications Security 2019: 869-886 - [c32]Dan Boneh, Elette Boyle, Henry Corrigan-Gibbs, Niv Gilboa, Yuval Ishai:
Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs. CRYPTO (3) 2019: 67-97 - [c31]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl:
Efficient Pseudorandom Correlation Generators: Silent OT Extension and More. CRYPTO (3) 2019: 489-518 - [c30]Elette Boyle, Lisa Kohl, Peter Scholl:
Homomorphic Secret Sharing from Lattices Without FHE. EUROCRYPT (2) 2019: 3-33 - [c29]Elette Boyle, Rio LaVigne, Vinod Vaikuntanathan:
Adversarially Robust Property-Preserving Hash Functions. ITCS 2019: 16:1-16:20 - [c28]Elette Boyle, Niv Gilboa, Yuval Ishai:
Secure Computation with Preprocessing via Function Secret Sharing. TCC (1) 2019: 341-371 - [c27]Elette Boyle, Justin Holmgren, Mor Weiss:
Permuted Puzzles and Cryptographic Hardness. TCC (2) 2019: 465-493 - [c26]Marshall Ball, Elette Boyle, Ran Cohen, Tal Malkin, Tal Moran:
Is Information-Theoretic Topology-Hiding Computation Possible? TCC (1) 2019: 502-530 - [i28]Elette Boyle, Lisa Kohl, Peter Scholl:
Homomorphic Secret Sharing from Lattices Without FHE. IACR Cryptol. ePrint Arch. 2019: 129 (2019) - [i27]Dan Boneh, Elette Boyle, Henry Corrigan-Gibbs, Niv Gilboa, Yuval Ishai:
How to Prove a Secret: Zero-Knowledge Proofs on Distributed Data via Fully Linear PCPs. IACR Cryptol. ePrint Arch. 2019: 188 (2019) - [i26]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai:
Compressing Vector OLE. IACR Cryptol. ePrint Arch. 2019: 273 (2019) - [i25]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl:
Efficient Pseudorandom Correlation Generators: Silent OT Extension and More. IACR Cryptol. ePrint Arch. 2019: 448 (2019) - [i24]Marshall Ball, Elette Boyle, Ran Cohen, Tal Malkin, Tal Moran:
Is Information-Theoretic Topology-Hiding Computation Possible? IACR Cryptol. ePrint Arch. 2019: 1094 (2019) - [i23]Elette Boyle, Niv Gilboa, Yuval Ishai:
Secure Computation with Preprocessing via Function Secret Sharing. IACR Cryptol. ePrint Arch. 2019: 1095 (2019) - [i22]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Rindal, Peter Scholl:
Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation. IACR Cryptol. ePrint Arch. 2019: 1159 (2019) - [i21]Elette Boyle, Justin Holmgren, Mor Weiss:
Permuted Puzzles and Cryptographic Hardness. IACR Cryptol. ePrint Arch. 2019: 1256 (2019) - [i20]Elette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof:
Practical Fully Secure Three-Party Computation via Sublinear Distributed Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. 2019: 1390 (2019) - 2018
- [c25]Elette Boyle, Geoffroy Couteau, Niv Gilboa
, Yuval Ishai:
Compressing Vector OLE. ACM Conference on Computer and Communications Security 2018: 896-912 - [c24]Elette Boyle, Ran Cohen, Deepesh Data, Pavel Hubácek:
Must the Communication Graph of MPC Protocols be an Expander? CRYPTO (3) 2018: 243-272 - [c23]Elette Boyle, Yuval Ishai, Antigoni Polychroniadou:
Limits of Practical Sublinear Secure Computation. CRYPTO (3) 2018: 302-332 - [c22]Marshall Ball, Elette Boyle, Tal Malkin, Tal Moran:
Exploring the Boundaries of Topology-Hiding Computation. EUROCRYPT (3) 2018: 294-325 - [c21]Elette Boyle, Abhishek Jain, Manoj Prabhakaran, Ching-Hua Yu:
The Bottleneck Complexity of Secure Multiparty Computation. ICALP 2018: 24:1-24:16 - [c20]Elette Boyle, Niv Gilboa, Yuval Ishai, Huijia Lin, Stefano Tessaro:
Foundations of Homomorphic Secret Sharing. ITCS 2018: 21:1-21:21 - [c19]Elette Boyle, Saleet Klein, Alon Rosen, Gil Segev:
Securing Abe's Mix-Net Against Malicious Verifiers via Witness Indistinguishability. SCN 2018: 274-291 - [i19]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Michele Orrù:
Homomorphic Secret Sharing: Optimizations and Applications. IACR Cryptol. ePrint Arch. 2018: 419 (2018) - [i18]Elette Boyle, Ran Cohen, Deepesh Data, Pavel Hubácek:
Must the Communication Graph of MPC Protocols be an Expander? IACR Cryptol. ePrint Arch. 2018: 540 (2018) - [i17]Elette Boyle, Yuval Ishai, Antigoni Polychroniadou:
Limits of Practical Sublinear Secure Computation. IACR Cryptol. ePrint Arch. 2018: 571 (2018) - [i16]Elette Boyle, Niv Gilboa, Yuval Ishai:
Function Secret Sharing: Improvements and Extensions. IACR Cryptol. ePrint Arch. 2018: 707 (2018) - [i15]Elette Boyle, Rio LaVigne, Vinod Vaikuntanathan:
Adversarially Robust Property Preserving Hash Functions. IACR Cryptol. ePrint Arch. 2018: 1158 (2018) - 2017
- [c18]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Michele Orrù:
Homomorphic Secret Sharing: Optimizations and Applications. ACM Conference on Computer and Communications Security 2017: 2105-2122 - [c17]Elette Boyle, Niv Gilboa, Yuval Ishai:
Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation. EUROCRYPT (2) 2017: 163-193 - [c16]Elette Boyle:
Recent Advances in Function and Homomorphic Secret Sharing - (Invited Talk). INDOCRYPT 2017: 1-26 - [c15]Elette Boyle, Yuval Ishai, Rafael Pass, Mary Wootters:
Can We Access a Database Both Locally and Privately? TCC (2) 2017: 662-693 - [i14]Elette Boyle, Niv Gilboa, Yuval Ishai:
Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation. IACR Cryptol. ePrint Arch. 2017: 150 (2017) - [i13]Elette Boyle, Saleet Klein, Alon Rosen, Gil Segev:
Securing Abe's Mix-net Against Malicious Verifiers via Witness Indistinguishability. IACR Cryptol. ePrint Arch. 2017: 544 (2017) - [i12]Elette Boyle, Yuval Ishai, Rafael Pass, Mary Wootters:
Can We Access a Database Both Locally and Privately? IACR Cryptol. ePrint Arch. 2017: 567 (2017) - [i11]Elette Boyle, Niv Gilboa, Yuval Ishai, Huijia Lin, Stefano Tessaro:
Foundations of Homomorphic Secret Sharing. IACR Cryptol. ePrint Arch. 2017: 1248 (2017) - 2016
- [c14]Elette Boyle, Niv Gilboa, Yuval Ishai:
Function Secret Sharing: Improvements and Extensions. ACM Conference on Computer and Communications Security 2016: 1292-1303 - [c13]Elette Boyle, Niv Gilboa, Yuval Ishai:
Breaking the Circuit Size Barrier for Secure Computation Under DDH. CRYPTO (1) 2016: 509-539 - [c12]Elette Boyle, Moni Naor:
Is There an Oblivious RAM Lower Bound? ITCS 2016: 357-368 - [c11]Elette Boyle, Kai-Min Chung, Rafael Pass:
Oblivious Parallel RAM and Applications. TCC (A2) 2016: 175-204 - [i10]Elette Boyle, Niv Gilboa, Yuval Ishai:
Breaking the Circuit Size Barrier for Secure Computation Under DDH. IACR Cryptol. ePrint Arch. 2016: 585 (2016) - 2015
- [c10]Elette Boyle, Rafael Pass:
Limits of Extractability Assumptions with Distributional Auxiliary Input. ASIACRYPT (2) 2015: 236-261 - [c9]Elette Boyle, Kai-Min Chung, Rafael Pass:
Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs. CRYPTO (2) 2015: 742-762 - [c8]Elette Boyle, Niv Gilboa, Yuval Ishai:
Function Secret Sharing. EUROCRYPT (2) 2015: 337-367 - [i9]Elette Boyle, Moni Naor:
Is There an Oblivious RAM Lower Bound? Electronic Colloquium on Computational Complexity (ECCC) 22: 146 (2015) - [i8]Elette Boyle, Moni Naor:
Is There an Oblivious RAM Lower Bound? IACR Cryptol. ePrint Arch. 2015: 863 (2015) - 2014
- [j3]Elette Boyle, Shafi Goldwasser, Yael Tauman Kalai:
Leakage-resilient coin tossing. Distributed Comput. 27(3): 147-164 (2014) - [c7]Elette Boyle, Shafi Goldwasser, Ioana Ivan:
Functional Signatures and Pseudorandom Functions. Public Key Cryptography 2014: 501-519 - [c6]Elette Boyle, Kai-Min Chung, Rafael Pass:
On Extractability Obfuscation. TCC 2014: 52-73 - [i7]Elette Boyle, Kai-Min Chung, Rafael Pass:
Large-Scale Secure Computation. IACR Cryptol. ePrint Arch. 2014: 404 (2014) - [i6]Elette Boyle, Kai-Min Chung, Rafael Pass:
Oblivious Parallel RAM. IACR Cryptol. ePrint Arch. 2014: 594 (2014) - 2013
- [j2]Elette Boyle, Gil Segev, Daniel Wichs:
Fully Leakage-Resilient Signatures. J. Cryptology 26(3): 513-558 (2013) - [c5]Elette Boyle, Sanjam Garg, Abhishek Jain, Yael Tauman Kalai, Amit Sahai:
Secure Computation against Adaptive Auxiliary Information. CRYPTO (1) 2013: 316-334 - [c4]Elette Boyle, Shafi Goldwasser, Stefano Tessaro:
Communication Locality in Secure Multi-party Computation - How to Run Sublinear Algorithms in a Distributed Setting. TCC 2013: 356-376 - [i5]Elette Boyle, Shafi Goldwasser, Ioana Ivan:
Functional Signatures and Pseudorandom Functions. IACR Cryptol. ePrint Arch. 2013: 401 (2013) - [i4]Elette Boyle, Kai-Min Chung, Rafael Pass:
On Extractability Obfuscation. IACR Cryptol. ePrint Arch. 2013: 650 (2013) - [i3]Elette Boyle, Rafael Pass:
Limits of Extractability Assumptions with Distributional Auxiliary Input. IACR Cryptol. ePrint Arch. 2013: 703 (2013) - 2012
- [c3]Elette Boyle, Shafi Goldwasser, Abhishek Jain, Yael Tauman Kalai:
Multiparty computation secure against continual memory leakage. STOC 2012: 1235-1254 - 2011
- [c2]Elette Boyle, Gil Segev, Daniel Wichs:
Fully Leakage-Resilient Signatures. EUROCRYPT 2011: 89-108 - [c1]Elette Boyle, Shafi Goldwasser, Yael Tauman Kalai:
Leakage-Resilient Coin Tossing. DISC 2011: 181-196 - [i2]Elette Boyle, Shafi Goldwasser, Yael Tauman Kalai:
Leakage-Resilient Coin Tossing. IACR Cryptol. ePrint Arch. 2011: 291 (2011) - 2010
- [i1]Elette Boyle, Gil Segev, Daniel Wichs:
Fully Leakage-Resilient Signatures. IACR Cryptol. ePrint Arch. 2010: 488 (2010)
2000 – 2009
- 2009
- [j1]Elette Boyle, Federico Echenique:
Sequential entry in many-to-one matching markets. Social Choice and Welfare 33(1): 87-99 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org and opencitations.net to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy.
Citation data
Add a list of citing articles from to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter accout. At the same time, Twitter will persitently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2020-06-11 00:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
