default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIdo Shahaf
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j3]Alon Rosen, Gil Segev, Ido Shahaf:
Can PPAD Hardness be Based on Standard Cryptographic Assumptions? J. Cryptol. 34(1): 8 (2021)- [j2]Gilad Asharov
, Gil Segev, Ido Shahaf:
Tight Tradeoffs in Searchable Symmetric Encryption. J. Cryptol. 34(2): 9 (2021) - [j1]Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf:
Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations. SIAM J. Comput. 50(5): 1501-1536 (2021) - 2020
- [c8]Lior Rotem, Gil Segev, Ido Shahaf:
Generic-Group Delay Functions Require Hidden-Order Groups. EUROCRYPT (3) 2020: 155-180 - [c7]Gil Segev, Ido Shahaf:
Hardness vs. (Very Little) Structure in Cryptography: A Multi-Prover Interactive Proofs Perspective. ITC 2020: 10:1-10:23 - [c6]Ido Shahaf, Or Ordentlich, Gil Segev:
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption. ISIT 2020: 858-863 - [i10]Ido Shahaf, Or Ordentlich, Gil Segev:
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption. CoRR abs/2004.09935 (2020) - [i9]Lior Rotem, Gil Segev, Ido Shahaf:
Generic-Group Delay Functions Require Hidden-Order Groups. IACR Cryptol. ePrint Arch. 2020: 225 (2020) - [i8]Gil Segev, Ido Shahaf:
Hardness vs. (Very Little) Structure in Cryptography: A Multi-Prover Interactive Proofs Perspective. IACR Cryptol. ePrint Arch. 2020: 330 (2020) - [i7]Ido Shahaf, Or Ordentlich, Gil Segev:
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption. IACR Cryptol. ePrint Arch. 2020: 462 (2020)
2010 – 2019
- 2018
- [c5]Gilad Asharov, Gil Segev, Ido Shahaf:
Tight Tradeoffs in Searchable Symmetric Encryption. CRYPTO (1) 2018: 407-436 - [c4]Gil Segev, Ido Shahaf:
Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption: A Tight Computational Lower Bound. TCC (2) 2018: 177-191 - [i6]Gilad Asharov, Gil Segev, Ido Shahaf:
Tight Tradeoffs in Searchable Symmetric Encryption. IACR Cryptol. ePrint Arch. 2018: 507 (2018) - [i5]Gil Segev, Ido Shahaf:
Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption: A Tight Computational Lower Bound. IACR Cryptol. ePrint Arch. 2018: 521 (2018) - 2017
- [c3]Ilya Mironov, Gil Segev, Ido Shahaf:
Strengthening the Security of Encrypted Databases: Non-transitive JOINs. TCC (2) 2017: 631-661 - [c2]Alon Rosen, Gil Segev, Ido Shahaf:
Can PPAD Hardness be Based on Standard Cryptographic Assumptions? TCC (2) 2017: 747-776 - [i4]Ilya Mironov, Gil Segev, Ido Shahaf:
Strengthening the Security of Encrypted Databases: Non-Transitive JOINs. IACR Cryptol. ePrint Arch. 2017: 883 (2017) - 2016
- [c1]Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf:
Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations. STOC 2016: 1101-1114 - [i3]Alon Rosen, Gil Segev, Ido Shahaf:
Can PPAD Hardness be Based on Standard Cryptographic Assumptions? Electron. Colloquium Comput. Complex. TR16 (2016) - [i2]Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf:
Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations. IACR Cryptol. ePrint Arch. 2016: 251 (2016) - [i1]Alon Rosen, Gil Segev, Ido Shahaf:
Can PPAD Hardness be Based on Standard Cryptographic Assumptions? IACR Cryptol. ePrint Arch. 2016: 375 (2016)
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).
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:09 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:
