Alex J. Malozemoff

According to our database1, Alex J. Malozemoff authored at least 23 papers between 2013 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Towards a Formal Treatment of Logic Locking.
IACR Cryptol. ePrint Arch., 2022

Security Foundations for Application-Based Covert Communication Channels.
Proceedings of the 43rd IEEE Symposium on Security and Privacy, 2022

2021
Balboa: Bobbing and Weaving around Network Censorship.
Proceedings of the 30th USENIX Security Symposium, 2021

Mac'n'Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
Mac'n'Cheese: Zero-Knowledge Proofs for Arithmetic Circuits with Nested Disjunctions.
IACR Cryptol. ePrint Arch., 2020

2019
RAMPARTS: A Programmer-Friendly System for Building Homomorphic Encryption Applications.
Proceedings of the 7th ACM Workshop on Encrypted Computing & Applied Homomorphic Cryptography, 2019

Public-Key Function-Private Hidden Vector Encryption (and More).
Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

2018
Building Applications with Homomorphic Encryption.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017
Faster Secure Two-Party Computation in the Single-Execution Setting.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

5Gen-C: Multi-input Functional Encryption and Program Obfuscation for Arithmetic Circuits.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

2016
Faster Two-Party Computation Secure Against Malicious Adversaries in the Single-Execution Setting.
IACR Cryptol. ePrint Arch., 2016

Efficiently Enforcing Input Validity in Secure Two-party Computation.
IACR Cryptol. ePrint Arch., 2016

CompGC: Efficient Offline/Online Semi-honest Two-party Computation.
IACR Cryptol. ePrint Arch., 2016

A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation.
Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

5Gen: A Framework for Prototyping Applications Using Multilinear Maps and Matrix Branching Programs.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

Attribute-based Key Exchange with General Policies.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015
Automated Analysis and Synthesis of Authenticated Encryption Schemes.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

Public Verifiability in the Covert Model (Almost) for Free.
Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

2014
Implementing Cryptographic Program Obfuscation.
IACR Cryptol. ePrint Arch., 2014

Automated Analysis and Synthesis of Block-Cipher Modes of Operation.
Proceedings of the IEEE 27th Computer Security Foundations Symposium, 2014

Amortizing Garbled Circuits.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

Efficient Three-Party Computation from Cut-and-Choose.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

2013
One-Round Multi-Party Communication Complexity of Distinguishing Sums.
Electron. Colloquium Comput. Complex., 2013


  Loading...