default search action
Alex J. Malozemoff
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j2]Peter A. Beerel, Marios Georgiou, Ben Hamlin, Alex J. Malozemoff, Pierluigi Nuzzo:
Towards a Formal Treatment of Logic Locking. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2022(2): 92-114 (2022) - [c16]James K. Howes IV, Marios Georgiou, Alex J. Malozemoff, Thomas Shrimpton:
Security Foundations for Application-Based Covert Communication Channels. SP 2022: 1971-1986 - [i20]Peter A. Beerel, Marios Georgiou, Ben Hamlin, Alex J. Malozemoff, Pierluigi Nuzzo:
Towards a Formal Treatment of Logic Locking. IACR Cryptol. ePrint Arch. 2022: 503 (2022) - 2021
- [c15]Carsten Baum
, Alex J. Malozemoff, Marc B. Rosen, Peter Scholl:
Mac'n'Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions. CRYPTO (4) 2021: 92-122 - [c14]Marc B. Rosen, James Parker, Alex J. Malozemoff:
Balboa: Bobbing and Weaving around Network Censorship. USENIX Security Symposium 2021: 3399-3413 - [i19]Marc B. Rosen, James Parker, Alex J. Malozemoff:
Balboa: Bobbing and Weaving around Network Censorship. CoRR abs/2104.05871 (2021) - 2020
- [i18]Carsten Baum, Alex J. Malozemoff, Marc B. Rosen, Peter Scholl:
Mac'n'Cheese: Zero-Knowledge Proofs for Arithmetic Circuits with Nested Disjunctions. IACR Cryptol. ePrint Arch. 2020: 1410 (2020)
2010 – 2019
- 2019
- [c13]James Bartusek
Public-Key Function-Private Hidden Vector Encryption (and More). ASIACRYPT (3) 2019: 489-519 - [c12]David W. Archer, José Manuel Calderón Trilla, Jason Dagit, Alex J. Malozemoff, Yuriy Polyakov
RAMPARTS: A Programmer-Friendly System for Building Homomorphic Encryption Applications. WAHC@CCS 2019: 57-68 - [i17]James Bartusek, Brent Carmer, Abhishek Jain
Public-Key Function-Private Hidden Vector Encryption (and More). IACR Cryptol. ePrint Arch. 2019: 746 (2019) - [i16]David W. Archer, José Manuel Calderón Trilla, Jason Dagit, Alex J. Malozemoff, Yuriy Polyakov, Kurt Rohloff, Gerard W. Ryan:
RAMPARTS: A Programmer-Friendly System for Building Homomorphic Encryption Applications. IACR Cryptol. ePrint Arch. 2019: 988 (2019) - 2018
- [c11]Roger A. Hallman
Building Applications with Homomorphic Encryption. CCS 2018: 2160-2162 - 2017
- [c10]Brent Carmer, Alex J. Malozemoff, Mariana Raykova:
5Gen-C: Multi-input Functional Encryption and Program Obfuscation for Arithmetic Circuits. CCS 2017: 747-764 - [c9]Xiao Wang
Faster Secure Two-Party Computation in the Single-Execution Setting. EUROCRYPT (3) 2017: 399-424 - [i15]Brent Carmer, Alex J. Malozemoff, Mariana Raykova:
5Gen-C: Multi-input Functional Encryption and Program Obfuscation for Arithmetic Circuits. IACR Cryptol. ePrint Arch. 2017: 826 (2017) - 2016
- [c8]Kevin Lewi, Alex J. Malozemoff, Daniel Apon, Brent Carmer, Adam Foltzer, Daniel Wagner, David W. Archer, Dan Boneh, Jonathan Katz, Mariana Raykova:
5Gen: A Framework for Prototyping Applications Using Multilinear Maps and Matrix Branching Programs. CCS 2016: 981-992 - [c7]Vladimir Kolesnikov, Hugo Krawczyk, Yehuda Lindell
Attribute-based Key Exchange with General Policies. CCS 2016: 1451-1463 - [c6]Matthew D. Green, Jonathan Katz, Alex J. Malozemoff, Hong-Sheng Zhou
A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation. SCN 2016: 587-603 - [i14]Jonathan Katz, Alex J. Malozemoff, Xiao Wang:
Efficiently Enforcing Input Validity in Secure Two-party Computation. IACR Cryptol. ePrint Arch. 2016: 184 (2016) - [i13]Adam Groce, Alex Ledger, Alex J. Malozemoff, Arkady Yerukhimovich:
CompGC: Efficient Offline/Online Semi-honest Two-party Computation. IACR Cryptol. ePrint Arch. 2016: 458 (2016) - [i12]Vladimir Kolesnikov, Hugo Krawczyk, Yehuda Lindell, Alex J. Malozemoff, Tal Rabin:
Attribute-based Key Exchange with General Policies. IACR Cryptol. ePrint Arch. 2016: 518 (2016) - [i11]Kevin Lewi, Alex J. Malozemoff, Daniel Apon, Brent Carmer, Adam Foltzer, Daniel Wagner, David W. Archer, Dan Boneh, Jonathan Katz, Mariana Raykova:
5Gen: A Framework for Prototyping Applications Using Multilinear Maps and Matrix Branching Programs. IACR Cryptol. ePrint Arch. 2016: 619 (2016) - [i10]Xiao Wang, Alex J. Malozemoff, Jonathan Katz:
Faster Two-Party Computation Secure Against Malicious Adversaries in the Single-Execution Setting. IACR Cryptol. ePrint Arch. 2016: 762 (2016) - 2015
- [c5]Vladimir Kolesnikov, Alex J. Malozemoff:
Public Verifiability in the Covert Model (Almost) for Free. ASIACRYPT (2) 2015: 210-235 - [c4]Viet Tung Hoang, Jonathan Katz, Alex J. Malozemoff:
Automated Analysis and Synthesis of Authenticated Encryption Schemes. CCS 2015: 84-95 - [i9]Yan Huang, Jonathan Katz, Vladimir Kolesnikov, Ranjit Kumaresan, Alex J. Malozemoff:
Amortizing Garbled Circuits. IACR Cryptol. ePrint Arch. 2015: 81 (2015) - [i8]Viet Tung Hoang, Jonathan Katz, Alex J. Malozemoff:
Automated Analysis and Synthesis of Authenticated Encryption Schemes. IACR Cryptol. ePrint Arch. 2015: 624 (2015) - [i7]Vladimir Kolesnikov, Alex J. Malozemoff:
Public Verifiability in the Covert Model (Almost) for Free. IACR Cryptol. ePrint Arch. 2015: 1067 (2015) - 2014
- [c3]Yan Huang, Jonathan Katz, Vladimir Kolesnikov, Ranjit Kumaresan, Alex J. Malozemoff:
Amortizing Garbled Circuits. CRYPTO (2) 2014: 458-475 - [c2]Seung Geol Choi, Jonathan Katz, Alex J. Malozemoff, Vassilis Zikas:
Efficient Three-Party Computation from Cut-and-Choose. CRYPTO (2) 2014: 513-530 - [c1]Alex J. Malozemoff, Jonathan Katz, Matthew D. Green:
Automated Analysis and Synthesis of Block-Cipher Modes of Operation. CSF 2014: 140-152 - [i6]Seung Geol Choi, Jonathan Katz, Alex J. Malozemoff, Vassilis Zikas:
Efficient Three-Party Computation from Cut-and-Choose. IACR Cryptol. ePrint Arch. 2014: 128 (2014) - [i5]Alex J. Malozemoff, Jonathan Katz, Matthew D. Green:
Automated Analysis and Synthesis of Block-Cipher Modes of Operation. IACR Cryptol. ePrint Arch. 2014: 774 (2014) - [i4]Daniel Apon, Yan Huang, Jonathan Katz, Alex J. Malozemoff:
Implementing Cryptographic Program Obfuscation. IACR Cryptol. ePrint Arch. 2014: 779 (2014) - [i3]Matthew D. Green, Jonathan Katz, Alex J. Malozemoff, Hong-Sheng Zhou:
A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2014: 863 (2014) - 2013
- [j1]Daniel Apon, Jonathan Katz, Alex J. Malozemoff:
One-round multi-party communication complexity of distinguishing sums. Theor. Comput. Sci. 501: 101-108 (2013) - [i2]Daniel Apon, Jonathan Katz, Alex J. Malozemoff:
One-Round Multi-Party Communication Complexity of Distinguishing Sums. CoRR abs/1301.4269 (2013) - [i1]Daniel Apon, Jonathan Katz, Alex J. Malozemoff:
One-Round Multi-Party Communication Complexity of Distinguishing Sums. Electron. Colloquium Comput. Complex. TR13 (2013)
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-24 23:21 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: