default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMor Weiss
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j6]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss:
Protecting Distributed Primitives Against Leakage: Equivocal Secret Sharing and more. J. Cryptol. 38(1): 1 (2025)- 2024
- [j5]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss:
The Price of Active Security in Cryptographic Protocols. J. Cryptol. 37(3): 30 (2024) - [j4]Adi Akavia, Ben Galili
, Hayim Shaul, Mor Weiss, Zohar Yakhini:
Privacy Preserving Feature Selection for Sparse Linear Regression. Proc. Priv. Enhancing Technol. 2024(1): 300-313 (2024) - [c18]Noga Ron-Zewi, Mor Weiss:
Zero-Knowledge IOPs Approaching Witness Length. CRYPTO (10) 2024: 105-137 - [i22]Noga Ron-Zewi, Mor Weiss:
Zero-knowledge IOPs Approaching Witness Length. IACR Cryptol. ePrint Arch. 2024: 816 (2024) - 2023
- [c17]Adi Akavia, Ben Galili, Hayim Shaul, Mor Weiss, Zohar Yakhini:
Efficient Privacy-Preserving Viral Strain Classification via k-mer Signatures and FHE. CSF 2023: 489-504 - [c16]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss:
Beyond MPC-in-the-Head: Black-Box Constructions of Short Zero-Knowledge Proofs. TCC (1) 2023: 3-33 - [c15]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss:
Your Reputation's Safe with Me: Framing-Free Distributed Zero-Knowledge Proofs. TCC (1) 2023: 34-64 - [i21]Adi Akavia, Ben Galili, Hayim Shaul, Mor Weiss, Zohar Yakhini:
Efficient Privacy-Preserving Viral Strain Classification via k-mer Signatures and FHE. IACR Cryptol. ePrint Arch. 2023: 9 (2023) - [i20]Adi Akavia, Ben Galili, Hayim Shaul, Mor Weiss, Zohar Yakhini:
Privacy Preserving Feature Selection for Sparse Linear Regression. IACR Cryptol. ePrint Arch. 2023: 1354 (2023) - [i19]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss:
Beyond MPC-in-the-Head: Black-Box Constructions of Short Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. 2023: 1819 (2023) - 2022
- [j3]Mor Weiss:
Shielding Probabilistically Checkable Proofs: Zero-Knowledge PCPs from Leakage Resilience. Entropy 24(7): 970 (2022) - [j2]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss:
ZK-PCPs from Leakage-Resilient Secret Sharing. J. Cryptol. 35(4): 23 (2022) - [c14]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss:
Protecting Distributed Primitives Against Leakage: Equivocal Secret Sharing and More. ITC 2022: 3:1-3:24 - [i18]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss:
Protecting Distributed Primitives against Leakage: Equivocal Secret Sharing and More. IACR Cryptol. ePrint Arch. 2022: 497 (2022) - [i17]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss:
Your Reputation's Safe with Me: Framing-Free Distributed Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. 2022: 1523 (2022) - [i16]Mor Weiss:
Shielding Probabilistically Checkable Proofs: Zero-Knowledge PCPs from Leakage Resilience. IACR Cryptol. ePrint Arch. 2022: 1524 (2022) - 2021
- [j1]Mor Weiss, Daniel Wichs:
Is There an Oblivious RAM Lower Bound for Online Reads? J. Cryptol. 34(3): 18 (2021) - [c13]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss:
ZK-PCPs from Leakage-Resilient Secret Sharing. ITC 2021: 6:1-6:21 - [i15]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss:
ZK-PCPs from Leakage-Resilient Secret Sharing. IACR Cryptol. ePrint Arch. 2021: 606 (2021) - [i14]Elette Boyle, Justin Holmgren, Fermi Ma, Mor Weiss:
On the Security of Doubly Efficient PIR. IACR Cryptol. ePrint Arch. 2021: 1113 (2021) - 2020
- [c12]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss:
The Price of Active Security in Cryptographic Protocols. EUROCRYPT (2) 2020: 184-215
2010 – 2019
- 2019
- [c11]Adi Akavia, Hayim Shaul, Mor Weiss, Zohar Yakhini:
Linear-Regression on Packed Encrypted Data in the Two-Server Model. WAHC@CCS 2019: 21-32 - [c10]Ariel Hamlin, Justin Holmgren, Mor Weiss, Daniel Wichs:
On the Plausibility of Fully Homomorphic Encryption for RAMs. CRYPTO (1) 2019: 589-619 - [c9]Ariel Hamlin, Rafail Ostrovsky, Mor Weiss, Daniel Wichs:
Private Anonymous Data Access. EUROCRYPT (2) 2019: 244-273 - [c8]Elette Boyle, Justin Holmgren, Mor Weiss:
Permuted Puzzles and Cryptographic Hardness. TCC (2) 2019: 465-493 - [i13]Ariel Hamlin, Justin Holmgren, Mor Weiss, Daniel Wichs:
On the Plausibility of Fully Homomorphic Encryption for RAMs. IACR Cryptol. ePrint Arch. 2019: 632 (2019) - [i12]Adi Akavia, Hayim Shaul, Mor Weiss, Zohar Yakhini:
Linear-Regression on Packed Encrypted Data in the Two-Server Model. IACR Cryptol. ePrint Arch. 2019: 1238 (2019) - [i11]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss:
The Price of Active Security in Cryptographic Protocols. IACR Cryptol. ePrint Arch. 2019: 1250 (2019) - [i10]Elette Boyle, Justin Holmgren, Mor Weiss:
Permuted Puzzles and Cryptographic Hardness. IACR Cryptol. ePrint Arch. 2019: 1256 (2019) - 2018
- [c7]Ariel Hamlin, Abhi Shelat, Mor Weiss, Daniel Wichs:
Multi-Key Searchable Encryption, Revisited. Public Key Cryptography (1) 2018: 95-124 - [c6]Mor Weiss, Daniel Wichs:
Is There an Oblivious RAM Lower Bound for Online Reads? TCC (2) 2018: 603-635 - [i9]Ariel Hamlin, Abhi Shelat, Mor Weiss, Daniel Wichs:
Multi-Key Searchable Encryption, Revisited. IACR Cryptol. ePrint Arch. 2018: 18 (2018) - [i8]Ariel Hamlin, Rafail Ostrovsky, Mor Weiss, Daniel Wichs:
Private Anonymous Data Access. IACR Cryptol. ePrint Arch. 2018: 363 (2018) - [i7]Mor Weiss, Daniel Wichs:
Is there an Oblivious RAM Lower Bound for Online Reads? IACR Cryptol. ePrint Arch. 2018: 619 (2018) - 2017
- [c5]Daniel Genkin, Yuval Ishai, Mor Weiss:
How to Construct a Leakage-Resilient (Stateless) Trusted Party. TCC (2) 2017: 209-244 - [i6]Yuval Ishai, Mor Weiss:
Probabilistically Checkable Proofs of Proximity with Zero-Knowledge. IACR Cryptol. ePrint Arch. 2017: 176 (2017) - [i5]Daniel Genkin, Yuval Ishai, Mor Weiss:
How to Construct a Leakage-Resilient (Stateless) Trusted Party. IACR Cryptol. ePrint Arch. 2017: 926 (2017) - 2016
- [b1]Mor Weiss:
Secure Computation and Probabilistic Checking. Technion - Israel Institute of Technology, Israel, 2016 - [c4]Yuval Ishai, Mor Weiss, Guang Yang:
Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits. TCC (A2) 2016: 3-32 - [c3]Daniel Genkin, Yuval Ishai, Mor Weiss:
Binary AMD Circuits from Secure Multiparty Computation. TCC (B1) 2016: 336-366 - [i4]Daniel Genkin, Yuval Ishai, Mor Weiss:
Binary AMD Circuits from Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2016: 809 (2016) - 2015
- [i3]Mor Weiss, Boris Rozenberg, Muhammad Barham:
Practical Solutions For Format-Preserving Encryption. CoRR abs/1506.04113 (2015) - [i2]Yuval Ishai, Mor Weiss, Guang Yang:
Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits. IACR Cryptol. ePrint Arch. 2015: 1055 (2015) - 2014
- [c2]Yuval Ishai, Mor Weiss:
Probabilistically Checkable Proofs of Proximity with Zero-Knowledge. TCC 2014: 121-145 - [i1]Eric Miles, Amit Sahai, Mor Weiss:
Protecting obfuscation against arithmetic attacks. IACR Cryptol. ePrint Arch. 2014: 878 (2014) - 2013
- [c1]Yuval Ishai, Amit Sahai, Michael Viderman, Mor Weiss:
Zero Knowledge LTCs and Their Applications. APPROX-RANDOM 2013: 607-622
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 2025-01-20 23:00 CET 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:
