default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOded Nir
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i11]Amos Beimel, Oriol Farràs, Oded Nir:
Secret-Sharing Schemes for High Slices. IACR Cryptol. ePrint Arch. 2024: 602 (2024)- 2023
- [c6]Benny Applebaum
, Oded Nir, Benny Pinkas:
How to Recover a Secret with O(n) Additions. CRYPTO (1) 2023: 236-262 - [c5]Benny Applebaum, Oded Nir:
Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography. FOCS 2023: 539-555 - [i10]Benny Applebaum, Oded Nir:
Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography. Electron. Colloquium Comput. Complex. TR23 (2023) - [i9]Benny Applebaum, Oded Nir, Benny Pinkas:
How to Recover a Secret with $O(n)$ Additions. Electron. Colloquium Comput. Complex. TR23 (2023) - [i8]Benny Applebaum, Oded Nir, Benny Pinkas:
How to Recover a Secret with O(n) Additions. IACR Cryptol. ePrint Arch. 2023: 838 (2023) - [i7]Benny Applebaum, Oded Nir:
Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography. IACR Cryptol. ePrint Arch. 2023: 1378 (2023) - 2022
- [c4]Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter, Toniann Pitassi:
Secret Sharing, Slice Formulas, and Monotone Real Circuits. ITCS 2022: 8:1-8:23 - [i6]Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter, Toniann Pitassi:
Secret Sharing, Slice Formulas, and Monotone Real Circuits. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c3]Benny Applebaum, Oded Nir:
Upslices, Downslices, and Secret-Sharing with Complexity of 1.5n. CRYPTO (3) 2021: 627-655 - [i5]Benny Applebaum, Oded Nir:
Upslices, Downslices, and Secret-Sharing with Complexity of $1.5^n$. Electron. Colloquium Comput. Complex. TR21 (2021) - [i4]Benny Applebaum, Oded Nir:
Upslices, Downslices, and Secret-Sharing with Complexity of 1.5n. IACR Cryptol. ePrint Arch. 2021: 470 (2021) - 2020
- [c2]Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter:
Better secret sharing via robust conditional disclosure of secrets. STOC 2020: 280-293 - [i3]Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter:
Better Secret-Sharing via Robust Conditional Disclosure of Secrets. Electron. Colloquium Comput. Complex. TR20 (2020) - [i2]Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter:
Better Secret-Sharing via Robust Conditional Disclosure of Secrets. IACR Cryptol. ePrint Arch. 2020: 80 (2020)
2010 – 2019
- 2019
- [c1]Benny Applebaum, Amos Beimel, Oriol Farràs, Oded Nir, Naty Peter:
Secret-Sharing Schemes for General and Uniform Access Structures. EUROCRYPT (3) 2019: 441-471 - [i1]Benny Applebaum, Amos Beimel, Oriol Farràs, Oded Nir, Naty Peter:
Secret-Sharing Schemes for General and Uniform Access Structures. IACR Cryptol. ePrint Arch. 2019: 231 (2019)
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-04-25 21:45 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:
