default search action
Niv Gilboa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c58]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 - [c57]Tom Kessous, Niv Gilboa:
Prune+PlumTree - Finding Eviction Sets at Scale. SP 2024: 3754-3772 - 2023
- [j9]Oren Shvartzman, Adar Ovadya, Kfir Zvi, Omer Shwartz, Rom Ogen, Yakov Mallah, Niv Gilboa, Yossi Oren
:
Characterization and Detection of Cross-Router Covert Channels. Comput. Secur. 127: 103125 (2023) - [c56]Dan Boneh, Elette Boyle, Henry Corrigan-Gibbs, Niv Gilboa, Yuval Ishai:
Arithmetic Sketching. CRYPTO (1) 2023: 171-202 - [c55]Elette Boyle, Geoffroy Couteau
Oblivious Transfer with Constant Computational Overhead. EUROCRYPT (1) 2023: 271-302 - [i31]Elette Boyle, Niv Gilboa, Yuval Ishai, Victor I. Kolobov:
Information-Theoretic Distributed Point Functions. IACR Cryptol. ePrint Arch. 2023: 28 (2023) - [i30]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) - [i29]Dan Boneh, Elette Boyle, Henry Corrigan-Gibbs, Niv Gilboa, Yuval Ishai:
Arithmetic Sketching. IACR Cryptol. ePrint Arch. 2023: 1012 (2023) - 2022
- [c54]Elette Boyle, Niv Gilboa, Yuval Ishai, Victor I. Kolobov:
Information-Theoretic Distributed Point Functions. ITC 2022: 17:1-17:14 - [c53]Elette Boyle, Niv Gilboa, Yuval Ishai, Victor I. Kolobov:
Programmable Distributed Point Functions. CRYPTO (4) 2022: 121-151 - [c52]Elette Boyle, Geoffroy Couteau
Correlated Pseudorandomness from Expand-Accumulate Codes. CRYPTO (2) 2022: 603-633 - [c51]Elette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof:
Secure Multiparty Computation with Sublinear Preprocessing. EUROCRYPT (1) 2022: 427-457 - [c50]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 - [i28]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) - [i27]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) - [i26]Elette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof:
Sublinear GMW-Style Compiler for MPC with Preprocessing. IACR Cryptol. ePrint Arch. 2022: 261 (2022) - [i25]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) - [i24]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) - [i23]Elette Boyle, Niv Gilboa, Yuval Ishai, Victor I. Kolobov:
Programmable Distributed Point Functions. IACR Cryptol. ePrint Arch. 2022: 1060 (2022) - 2021
- [c49]Elette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof:
Sublinear GMW-Style Compiler for MPC with Preprocessing. CRYPTO (2) 2021: 457-485 - [c48]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 - [c47]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 - [c46]Dan Boneh, Elette Boyle, Henry Corrigan-Gibbs, Niv Gilboa, Yuval Ishai:
Lightweight Techniques for Private Heavy Hitters. SP 2021: 762-776 - [c45]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 - [i22]Dan Boneh, Elette Boyle, Henry Corrigan-Gibbs, Niv Gilboa, Yuval Ishai:
Lightweight Techniques for Private Heavy Hitters. IACR Cryptol. ePrint Arch. 2021: 17 (2021) - [i21]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
- [c44]Elette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof:
Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs. ASIACRYPT (3) 2020: 244-276 - [c43]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl:
Efficient Pseudorandom Correlation Generators from Ring-LPN. CRYPTO (2) 2020: 387-416 - [c42]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl:
Correlated Pseudorandom Functions from Variable-Density LPN. FOCS 2020: 1069-1080 - [i20]Dan Boneh, Elette Boyle, Henry Corrigan-Gibbs, Niv Gilboa, Yuval Ishai:
Lightweight Techniques for Private Heavy Hitters. CoRR abs/2012.14884 (2020) - [i19]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) - [i18]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) - [i17]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
- [j8]Shlomi Dolev
Perennial secure multi-party computation of universal Turing machine. Theor. Comput. Sci. 769: 43-62 (2019) - [j7]Shlomi Dolev, Niv Gilboa, Ximing Li
Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation. Theor. Comput. Sci. 795: 81-99 (2019) - [c41]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 - [c40]Elette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof:
Practical Fully Secure Three-Party Computation via Sublinear Distributed Zero-Knowledge Proofs. CCS 2019: 869-886 - [c39]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 - [c38]Elette Boyle, Geoffroy Couteau
Efficient Pseudorandom Correlation Generators: Silent OT Extension and More. CRYPTO (3) 2019: 489-518 - [c37]Ben Amos, Niv Gilboa, Arbel Levy:
Spectre without shared memory. SAC 2019: 1944-1951 - [c36]Elette Boyle, Niv Gilboa, Yuval Ishai:
Secure Computation with Preprocessing via Function Secret Sharing. TCC (1) 2019: 341-371 - [c35]Adar Ovadya, Rom Ogen, Yakov Mallah, Niv Gilboa, Yossi Oren:
Cross-Router Covert Channels. WOOT @ USENIX Security Symposium 2019 - [i16]Adar Ovadya, Rom Ogen, Yakov Mallah, Niv Gilboa, Yossi Oren:
Cross-Router Covert Channels. CoRR abs/1908.02524 (2019) - [i15]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) - [i14]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai:
Compressing Vector OLE. IACR Cryptol. ePrint Arch. 2019: 273 (2019) - [i13]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) - [i12]Elette Boyle, Niv Gilboa, Yuval Ishai:
Secure Computation with Preprocessing via Function Secret Sharing. IACR Cryptol. ePrint Arch. 2019: 1095 (2019) - [i11]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) - [i10]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
- [c34]Elette Boyle, Geoffroy Couteau
Compressing Vector OLE. CCS 2018: 896-912 - [c33]Elette Boyle, Niv Gilboa
Foundations of Homomorphic Secret Sharing. ITCS 2018: 21:1-21:21 - [i9]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Michele Orrù:
Homomorphic Secret Sharing: Optimizations and Applications. IACR Cryptol. ePrint Arch. 2018: 419 (2018) - [i8]Elette Boyle, Niv Gilboa, Yuval Ishai:
Function Secret Sharing: Improvements and Extensions. IACR Cryptol. ePrint Arch. 2018: 707 (2018) - 2017
- [j6]Dan Brownstein, Shlomi Dolev
Functional encryption for cascade automata. Inf. Comput. 255: 384-407 (2017) - [c32]Elette Boyle, Geoffroy Couteau
Homomorphic Secret Sharing: Optimizations and Applications. CCS 2017: 2105-2122 - [c31]Nico Struckmann, Yosandra Sandoval, Nadav Har'El, Fang Chen, Shiqing Fan, Justin Cinkelj, Gregor Berginc, Peter Chronz, Niv Gilboa
MIKELANGELO: MIcro KErneL virtualizAtioN for hiGh pErfOrmance cLOud and HPC Systems. ESOCC Workshops 2017: 175-180 - [c30]Elette Boyle, Niv Gilboa
Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation. EUROCRYPT (2) 2017: 163-193 - [c29]Dan Brownstein, Shlomi Dolev, Niv Gilboa
Broadcast Encryption with Both Temporary and Permanent Revocation. SSS 2017: 469-483 - [i7]Elette Boyle, Niv Gilboa, Yuval Ishai:
Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation. IACR Cryptol. ePrint Arch. 2017: 150 (2017) - [i6]Elette Boyle, Niv Gilboa, Yuval Ishai, Huijia Lin, Stefano Tessaro:
Foundations of Homomorphic Secret Sharing. IACR Cryptol. ePrint Arch. 2017: 1248 (2017) - 2016
- [c28]Elette Boyle, Niv Gilboa
Function Secret Sharing: Improvements and Extensions. CCS 2016: 1292-1303 - [c27]Elette Boyle, Niv Gilboa
Breaking the Circuit Size Barrier for Secure Computation Under DDH. CRYPTO (1) 2016: 509-539 - [i5]Elette Boyle, Niv Gilboa, Yuval Ishai:
Breaking the Circuit Size Barrier for Secure Computation Under DDH. IACR Cryptol. ePrint Arch. 2016: 585 (2016) - 2015
- [j5]Shlomi Dolev
Towards efficient private distributed computation on unbounded input streams. J. Math. Cryptol. 9(2): 79-94 (2015) - [j4]Ofer Hermoni, Niv Gilboa
Rendezvous tunnel for anonymous publishing. Peer-to-Peer Netw. Appl. 8(3): 352-366 (2015) - [c26]Hillel Avni, Shlomi Dolev, Niv Gilboa
SSSDB: Database with Private Information Search. ALGOCLOUD 2015: 49-61 - [c25]Shlomi Dolev
Accumulating Automata and Cascaded Equations Automata for Communicationless Information Theoretically Secure Multi-Party Computation: Extended Abstract. SCC@ASIACCS 2015: 21-29 - [c24]Elette Boyle, Niv Gilboa
Function Secret Sharing. EUROCRYPT (2) 2015: 337-367 - [c23]Dan Brownstein, Shlomi Dolev, Niv Gilboa
Functional Encryption for Cascade Automata (Extended Abstract). SSS 2015: 94-108 - 2014
- [j3]Shlomi Dolev
Information security for sensors by overwhelming random sequences and permutations. Ad Hoc Networks 12: 193-200 (2014) - [c22]Niv Gilboa
Distributed Point Functions and Their Applications. EUROCRYPT 2014: 640-658 - [i4]Shlomi Dolev, Niv Gilboa, Ximing Li:
Accumulating Automata and Cascaded Equations Automata for Communicationless Information Theoretically Secure Multi-Party Computation. IACR Cryptol. ePrint Arch. 2014: 611 (2014) - 2013
- [c21]Shlomi Dolev, Juan A. Garay, Niv Gilboa
Towards Efficient Private Distributed Computation on Unbounded Input Streams - (Extended Abstract). ACNS 2013: 69-83 - [i3]Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir Kolesnikov, Yelena Yuditsky:
Towards Efficient Private Distributed Computation on Unbounded Input Streams. IACR Cryptol. ePrint Arch. 2013: 220 (2013) - 2012
- [c20]Shlomi Dolev
Permanent Revocation in Attribute Based Broadcast Encryption. CyberSecurity 2012: 203-208 - [c19]Shlomi Dolev, Niv Gilboa
Brief Announcement: Arbitrators in the Security Infrastructure. SSS 2012: 236-238 - [c18]Shlomi Dolev, Juan A. Garay, Niv Gilboa
Brief Announcement: Efficient Private Distributed Computation on Unbounded Input Streams. DISC 2012: 431-432 - [i2]Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir Kolesnikov, Yelena Yuditsky:
Efficient Private Distributed Computation on Unbounded Input Streams. CoRR abs/1208.4909 (2012) - 2011
- [j2]Carlo Blundo
Innovative approaches for security of small artefacts. Comput. Sci. Rev. 5(1): 47-55 (2011) - [c17]Shlomi Dolev, Niv Gilboa, Ofer Hermoni:
Poster: arbitrators in the security infrastructure, supporting positive anonymity. CCS 2011: 753-756 - [c16]Shlomi Dolev, Niv Gilboa, Marina Kopeetsky:
Poster: attribute based broadcast encryption with permanent revocation. CCS 2011: 757-760 - [c15]Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir Kolesnikov:
Secret Sharing Krohn-Rhodes: Private and Perennial Distributed Computation. ICS 2011: 32-44 - [c14]Ofer Hermoni, Niv Gilboa
Rendezvous Tunnel for Anonymous Publishing: Clean Slate and Tor Based Designs. SSS 2011: 223-237 - 2010
- [j1]Eyal Felstaine, Eldad Chai, Niv Gilboa
Distributed flow detection over multi-path sessions. Comput. Commun. 33(7): 816-827 (2010) - [c13]Shlomi Dolev
Information security for sensors by overwhelming random sequences and permutations. CCS 2010: 669-671 - [c12]Ofer Hermoni, Niv Gilboa
Rendezvous tunnel for anonymous publishing. CCS 2010: 690-692 - [c11]Shlomi Dolev
Information security for sensors by overwhelming random sequences and permutations. DIALM-PODC 2010: 43-48 - [c10]Nurit Gal-Oz, Niv Gilboa, Ehud Gudes:
Schemes for Privately Computing Trust and Reputation. IFIPTM 2010: 1-16 - [c9]Shlomi Dolev
Brief announcement: swarming secrets. PODC 2010: 231-232 - [c8]Shlomi Dolev
Computing multi-party trust privately: in O(n) time units sending one (possibly large) message at a time. SAC 2010: 1460-1465
2000 – 2009
- 2009
- [c7]Shlomi Dolev, Juan A. Garay, Niv Gilboa
Swarming secrets. Allerton 2009: 1438-1445 - 2008
- [c6]Sharon Shitrit, Eyal Felstaine, Niv Gilboa
Anonymity Scheme for Interactive P2P Services. CCGRID 2008: 33-40 - [c5]Ofer Hermoni, Niv Gilboa
Deniability - an alibi for users in P2P networks. COMSWARE 2008: 310-317 - [c4]Eyal Felstaine, Eldad Chai, Niv Gilboa
Distributed flow detection over multi path sessions. SecureComm 2008: 3 - 2001
- [b1]Niv Gilboa:
Topics in private information retrieval. Technion - Israel Institute of Technology, Israel, 2001
1990 – 1999
- 1999
- [c3]Niv Gilboa:
Two Party RSA Key Generation. CRYPTO 1999: 116-129 - [c2]Niv Gilboa, Yuval Ishai:
Compressing Cryptographic Resources. CRYPTO 1999: 591-608 - 1998
- [i1]Benny Chor, Niv Gilboa, Moni Naor:
Private Information Retrieval by Keywords. IACR Cryptol. ePrint Arch. 1998: 3 (1998) - 1997
- [c1]Benny Chor, Niv Gilboa:
Computationally Private Information Retrieval (Extended Abstract). STOC 1997: 304-313
Coauthor Index
[c58] [c56] [c55] [i31] [i30] [i29] [c54] [c53] [c52] [c51] [c50] [i28] [i27] [i26] [i25] [i24] [i23] [c49] [c48] [c47] [c46] [c45] [i22] [i21] [c44] [c43] [c42] [i20] [i19] [i18] [i17] [c41] [c40] [c39] [c38] [c36] [i15] [i14] [i13] [i12] [i11] [i10] [c34] [c33] [i9] [i8] [c32] [c30] [i7] [i6] [c28] [c27] [i5] [c24]
[c58] [c56] [c55] [i31] [i30] [i29] [c54] [c53] [c52] [c51] [c50] [i28] [i27] [i26] [i25] [i24] [i23] [c49] [c48] [c47] [c46] [c45] [i22] [i21] [c44] [c43] [c42] [i20] [i19] [i18] [i17] [c41] [c40] [c39] [c38] [c36] [i15] [i14] [i13] [i12] [i11] [i10] [c34] [c33] [i9] [i8] [c32] [c30] [i7] [i6] [c28] [c27] [i5] [c24] [c22] [c2]
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-09-22 23:35 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: