Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Daniel P. Kennedy
Roland Zumkeller
Yue Li
Maximilian Dürr
Dan Graur
Liangliang Shang
Shixin Peng
Chen Ma
Chih-Chun Wu
Barbara Aquilani
Home
/
Author
/
ALEX J. MALOZEMOFF
Author Info
Open Visualization
Name
Affiliation
Papers
ALEX J. MALOZEMOFF
Univ Maryland, Dept Comp Sci, College Pk, MD 20742 USA
18
Collaborators
Citations
PageRank
41
158
8.98
Referers
Referees
References
346
427
300
Search Limit
100
427
Publications (18 rows)
Collaborators (41 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Mac'N'Cheese: Zero-Knowledge Proofs For Boolean And Arithmetic Circuits With Nested Disjunctions
0
0.34
2021
RAMPARTS: A Programmer-Friendly System for Building Homomorphic Encryption Applications
1
0.34
2019
Building Applications with Homomorphic Encryption.
0
0.34
2018
5Gen-C: Multi-input Functional Encryption and Program Obfuscation for Arithmetic Circuits.
2
0.37
2017
Faster Secure Two-Party Computation in the Single-Execution Setting.
15
0.51
2017
A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation.
1
0.35
2016
Attribute-based Key Exchange with General Policies.
2
0.36
2016
CompGC: Efficient Offline/Online Semi-honest Two-party Computation.
2
0.37
2016
Faster Two-Party Computation Secure Against Malicious Adversaries in the Single-Execution Setting.
4
0.38
2016
5Gen: A Framework for Prototyping Applications Using Multilinear Maps and Matrix Branching Programs.
12
0.51
2016
Efficiently Enforcing Input Validity in Secure Two-party Computation.
0
0.34
2016
Automated Analysis and Synthesis of Authenticated Encryption Schemes.
9
0.54
2015
Public Verifiability in the Covert Model (Almost) for Free.
2
0.36
2015
Amortizing Garbled Circuits.
36
0.90
2015
Automated Analysis and Synthesis of Block-Cipher Modes of Operation
42
1.37
2014
Implementing Cryptographic Program Obfuscation.
17
0.75
2014
Efficient Three-Party Computation from Cut-and-Choose.
13
0.53
2014
One-Round Multi-Party Communication Complexity of Distinguishing Sums
0
0.34
2013
1