default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElette 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
showing all ?? records
2020 – today
- 2024
[j7]Elette Boyle, Ran Cohen, Aarushi Goel:
Breaking the $O(\sqrt{n})$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party. J. Cryptol. 37(1): 2 (2024)- [c60]D'or Banoun, Elette Boyle, Ran Cohen:
Information-Theoretic Topology-Hiding Broadcast: Wheels, Stars, Friendship, and Beyond. ITC 2024: 1:1-1:13 - [c59]Amit Agarwal, Elette Boyle, Niv Gilboa, Yuval Ishai, Mahimna Kelkar, Yiping Ma:
Compressing Unit-Vector Correlations via Sparse Pseudorandom Generators. CRYPTO (8) 2024: 346-383 - [c58]Elette Boyle
, Ilan Komargodski, Neekon Vafa:
Memory Checking Requires Logarithmic Overhead. STOC 2024: 1712-1723 - [i59]Elette Boyle, Ilan Komargodski, Neekon Vafa:
Memory Checking Requires Logarithmic Overhead. Electron. Colloquium Comput. Complex. TR24 (2024) - [i58]Elette Boyle, Ilan Komargodski, Neekon Vafa:
Memory Checking Requires Logarithmic Overhead. IACR Cryptol. ePrint Arch. 2024: 123 (2024) - [i57]Elette Boyle, Lisa Kohl, Zhe Li, Peter Scholl:
Direct FSS Constructions for Branching Programs and More from PRGs with Encoded-Output Homomorphism. IACR Cryptol. ePrint Arch. 2024: 192 (2024) - [i56]D'or Banoun, Elette Boyle, Ran Cohen:
Information-Theoretic Topology-Hiding Broadcast: Wheels, Stars, Friendship, and Beyond. IACR Cryptol. ePrint Arch. 2024: 1266 (2024) - [i55]Eden Aldema Tshuva, Elette Boyle, Ran Cohen, Tal Moran, Rotem Oshman:
Locally Verifiable Distributed SNARGs. IACR Cryptol. ePrint Arch. 2024: 1385 (2024) - 2023
- [j6]Elette Boyle, Ran Cohen, Deepesh Data, Pavel Hubácek:
Must the Communication Graph of MPC Protocols be an Expander? J. Cryptol. 36(3): 20 (2023) - [j5]Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran:
Topology-Hiding Communication from Minimal Assumptions. J. Cryptol. 36(4): 39 (2023) - [j4]Elette Boyle, Vincent Cohen-Addad, Alexandra Kolla, Mikkel Thorup:
Special Section on the Fifty-Ninth Annual IEEE Symposium on Foundations of Computer Science (2018). SIAM J. Comput. 52(6): S18- (2023) - [c57]Dan Boneh, Elette Boyle, Henry Corrigan-Gibbs, Niv Gilboa, Yuval Ishai:
Arithmetic Sketching. CRYPTO (1) 2023: 171-202 - [c56]Elette Boyle, Geoffroy Couteau, Pierre Meyer:
Sublinear-Communication Secure Multiparty Computation Does Not Require FHE. EUROCRYPT (2) 2023: 159-189 - [c55]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl:
Oblivious Transfer with Constant Computational Overhead. EUROCRYPT (1) 2023: 271-302 - [c54]Elette Boyle, Yuval Ishai, Pierre Meyer, Robert Robere, Gal Yehuda:
On Low-End Obfuscation and Learning. ITCS 2023: 23:1-23:28 - [c53]Eden Aldema Tshuva, Elette Boyle, Ran Cohen, Tal Moran, Rotem Oshman:
Locally Verifiable Distributed SNARGs. TCC (1) 2023: 65-90 - [c52]Erica Blum, Elette Boyle, Ran Cohen, Chen-Da Liu-Zhang:
Communication Lower Bounds for Cryptographic Broadcast Protocols. DISC 2023: 10:1-10:19 - [i54]Elette Boyle, Ran Cohen, Deepesh Data, Pavel Hubácek:
Must the Communication Graph of MPC Protocols be an Expander? CoRR abs/2305.11428 (2023) - [i53]Erica Blum, Elette Boyle, Ran Cohen, Chen-Da Liu-Zhang:
Communication Lower Bounds for Cryptographic Broadcast Protocols. CoRR abs/2309.01466 (2023) - [i52]Elette Boyle, Niv Gilboa, Yuval Ishai, Victor I. Kolobov:
Information-Theoretic Distributed Point Functions. IACR Cryptol. ePrint Arch. 2023: 28 (2023) - [i51]Elette Boyle, Geoffroy Couteau, Pierre Meyer:
Sublinear Secure Computation from New Assumptions. IACR Cryptol. ePrint Arch. 2023: 513 (2023) - [i50]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl:
Oblivious Transfer with Constant Computational Overhead. IACR Cryptol. ePrint Arch. 2023: 817 (2023) - [i49]Dan Boneh, Elette Boyle, Henry Corrigan-Gibbs, Niv Gilboa, Yuval Ishai:
Arithmetic Sketching. IACR Cryptol. ePrint Arch. 2023: 1012 (2023) - [i48]Erica Blum, Elette Boyle, Ran Cohen, Chen-Da Liu-Zhang:
Communication Lower Bounds for Cryptographic Broadcast Protocols. IACR Cryptol. ePrint Arch. 2023: 1316 (2023) - [i47]Elette Boyle, Geoffroy Couteau, Pierre Meyer:
Sublinear-Communication Secure Multiparty Computation does not require FHE. IACR Cryptol. ePrint Arch. 2023: 1802 (2023) - 2022
- [c51]Elette Boyle, Niv Gilboa, Yuval Ishai, Victor I. Kolobov:
Information-Theoretic Distributed Point Functions. ITC 2022: 17:1-17:14 - [c50]Elette Boyle, Niv Gilboa, Yuval Ishai, Victor I. Kolobov:
Programmable Distributed Point Functions. CRYPTO (4) 2022: 121-151 - [c49]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl:
Correlated Pseudorandomness from Expand-Accumulate Codes. CRYPTO (2) 2022: 603-633 - [c48]Elette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof:
Secure Multiparty Computation with Sublinear Preprocessing. EUROCRYPT (1) 2022: 427-457 - [c47]Elette Boyle, Itai Dinur, Niv Gilboa, Yuval Ishai, Nathan Keller, Ohad Klein:
Locality-Preserving Hashing for Shifts with Connections to Cryptography. ITCS 2022: 27:1-27:24 - [c46]Elette Boyle, Geoffroy Couteau, Pierre Meyer:
Sublinear Secure Computation from New Assumptions. TCC (2) 2022: 121-150 - [i46]Elette Boyle, Itai Dinur, Niv Gilboa, Yuval Ishai, Nathan Keller, Ohad Klein:
Locality-Preserving Hashing for Shifts with Connections to Cryptography. CoRR abs/2201.03041 (2022) - [i45]Elette Boyle, Itai Dinur, Niv Gilboa, Yuval Ishai, Nathan Keller, Ohad Klein:
Locality-Preserving Hashing for Shifts with Connections to Cryptography. IACR Cryptol. ePrint Arch. 2022: 28 (2022) - [i44]Elette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof:
Sublinear GMW-Style Compiler for MPC with Preprocessing. IACR Cryptol. ePrint Arch. 2022: 261 (2022) - [i43]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl:
Correlated Pseudorandomness from Expand-Accumulate Codes. IACR Cryptol. ePrint Arch. 2022: 1014 (2022) - [i42]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl:
Efficient Pseudorandom Correlation Generators from Ring-LPN. IACR Cryptol. ePrint Arch. 2022: 1035 (2022) - [i41]Elette Boyle, Niv Gilboa, Yuval Ishai, Victor I. Kolobov:
Programmable Distributed Point Functions. IACR Cryptol. ePrint Arch. 2022: 1060 (2022) - 2021
- [c45]Elette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof:
Sublinear GMW-Style Compiler for MPC with Preprocessing. CRYPTO (2) 2021: 457-485 - [c44]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl:
Low-Complexity Weak Pseudorandom Functions in $\mathtt {AC}0[\mathtt {MOD}2]$. CRYPTO (4) 2021: 487-516 - [c43]Elette Boyle, Nishanth Chandran, Niv Gilboa, Divya Gupta, Yuval Ishai, Nishant Kumar, Mayank Rathee:
Function Secret Sharing for Mixed-Mode and Fixed-Point Secure Computation. EUROCRYPT (2) 2021: 871-900 - [c42]Elette Boyle, Ran Cohen, Aarushi Goel:
Breaking the O(√ n)-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party. PODC 2021: 319-330 - [c41]Dan Boneh, Elette Boyle, Henry Corrigan-Gibbs, Niv Gilboa, Yuval Ishai:
Lightweight Techniques for Private Heavy Hitters. SP 2021: 762-776 - [c40]Fabrice Benhamouda, Elette Boyle, Niv Gilboa, Shai Halevi, Yuval Ishai, Ariel Nof:
Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation. TCC (2) 2021: 129-161 - [i40]Dan Boneh, Elette Boyle, Henry Corrigan-Gibbs, Niv Gilboa, Yuval Ishai:
Lightweight Techniques for Private Heavy Hitters. IACR Cryptol. ePrint Arch. 2021: 17 (2021) - [i39]Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran:
Topology-Hiding Communication from Minimal Assumptions. IACR Cryptol. ePrint Arch. 2021: 388 (2021) - [i38]Elette Boyle, Justin Holmgren, Fermi Ma, Mor Weiss:
On the Security of Doubly Efficient PIR. IACR Cryptol. ePrint Arch. 2021: 1113 (2021) - [i37]Fabrice Benhamouda, Elette Boyle, Niv Gilboa, Shai Halevi, Yuval Ishai, Ariel Nof:
Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation. IACR Cryptol. ePrint Arch. 2021: 1223 (2021) - 2020
- [c39]Elette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof:
Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs. ASIACRYPT (3) 2020: 244-276 - [c38]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl:
Efficient Pseudorandom Correlation Generators from Ring-LPN. CRYPTO (2) 2020: 387-416 - [c37]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl:
Correlated Pseudorandom Functions from Variable-Density LPN. FOCS 2020: 1069-1080 - [c36]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 - [c35]Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran:
Topology-Hiding Communication from Minimal Assumptions. TCC (2) 2020: 473-501 - [i36]Elette Boyle, Ran Cohen, Aarushi Goel:
Succinctly Reconstructed Distributed Signatures and Balanced Byzantine Agreement. CoRR abs/2002.02516 (2020) - [i35]Dan Boneh, Elette Boyle, Henry Corrigan-Gibbs, Niv Gilboa, Yuval Ishai:
Lightweight Techniques for Private Heavy Hitters. CoRR abs/2012.14884 (2020) - [i34]Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Cryptography from Information Loss. Electron. Colloquium Comput. Complex. TR20 (2020) - [i33]Elette Boyle, Ran Cohen, Aarushi Goel:
Succinctly Reconstructed Distributed Signatures and Balanced Byzantine Agreement. IACR Cryptol. ePrint Arch. 2020: 130 (2020) - [i32]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) - [i31]Elette Boyle, Nishanth Chandran, Niv Gilboa, Divya Gupta, Yuval Ishai, Nishant Kumar, Mayank Rathee:
Function Secret Sharing for Mixed-Mode and Fixed-Point Secure Computation. IACR Cryptol. ePrint Arch. 2020: 1392 (2020) - [i30]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl:
Correlated Pseudorandom Functions from Variable-Density LPN. IACR Cryptol. ePrint Arch. 2020: 1417 (2020) - [i29]Elette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof:
Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. 2020: 1451 (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. CCS 2019: 291-308 - [c33]Elette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof:
Practical Fully Secure Three-Party Computation via Sublinear Distributed Zero-Knowledge Proofs. CCS 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. CCS 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. CCS 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. CCS 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? Electron. Colloquium Comput. Complex. TR15 (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. Cryptol. 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. Soc. Choice Welf. 33(1): 87-99 (2009)
Coauthor Index
[c59] [c57] [c55] [i52] [i50] [i49] [c51] [c50] [c49] [c48] [c47] [i46] [i45] [i44] [i43] [i42] [i41] [c45] [c44] [c43] [c41] [c40] [i40] [i37] [c39] [c38] [c37] [i35] [i31] [i30] [i29] [c34] [c33] [c32] [c31] [c28] [i27] [i26] [i25] [i23] [i22] [i20] [c25] [c20] [i19] [i16] [c18] [c17] [i14] [i11] [c14] [c13] [i10] [c8]
[c59] [c57] [c55] [c54] [i52] [i50] [i49] [c51] [c50] [c49] [c48] [c47] [i46] [i45] [i44] [i43] [i42] [i41] [c45] [c44] [c43] [c41] [c40] [i40] [i37] [c39] [c38] [c37] [i35] [i31] [i30] [i29] [c34] [c33] [c32] [c31] [c28] [i27] [i26] [i25] [i23] [i22] [i20] [c25] [c23] [c20] [i19] [i17] [i16] [c18] [c17] [c15] [i14] [i12] [i11] [c14] [c13] [i10] [c8]
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).
Privacy notice: By enabling the option above, your browser will contact the API of 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, opencitations.net, and semanticscholar.org to load article reference 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, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and 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 and semanticscholar.org 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 as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional 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 information given by OpenAlex.
last updated on 2024-10-07 22:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
