Arkady Yerukhimovich - Citegraph

Author Info

Name	Affiliation	Papers
ARKADY YERUKHIMOVICH	Dept. of Computer Science, University of Maryland, College Park, MD	19
Collaborators	Citations	PageRank
51	80	8.86
Referers	Referees	References
214	596	325

Search Limit

100596

Publications (19 rows)

Collaborators (51 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Secure Sampling with Sublinear Communication.	0	0.34	2022
Compressed Oblivious Encoding for Homomorphically Encrypted Search	0	0.34	2021
Stormy: Statistics in Tor by Measuring Securely	0	0.34	2019
Nothing But Net: Invading Android User Privacy Using Only Network Access Patterns.	0	0.34	2018
SoK: Cryptographically Protected Database Search	23	0.68	2017
Bounded-Collusion Attribute-Based Encryption from Minimal Assumptions.	1	0.35	2017
SoK: Privacy on Mobile Devices - It's Complicated.	5	0.42	2016
POPE: Partial Order-Preserving Encoding.	0	0.34	2016
Secure Multiparty Computation for Cooperative Cyber Risk Assessment	0	0.34	2016
CompGC: Efficient Offline/Online Semi-honest Two-party Computation.	2	0.37	2016
Computing on Masked Data to improve the security of big data	1	0.34	2015
(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens.	4	0.37	2014
(Efficient) Universally Composable Two-Party Computation Using a Minimal Number of Stateless Tokens.	0	0.34	2011
Impossibility of blind signatures from one-way permutations	11	0.47	2011
Limits on the power of zero-knowledge proofs in cryptographic constructions	13	0.64	2011
Limits of computational differential privacy in the client/server setting	8	0.63	2011
On the round complexity of zero-knowledge proofs based on one-way permutations	2	0.37	2010
On Black-Box Constructions of Predicate Encryption from Trapdoor Permutations	8	0.55	2009
Efficient Data Storage in Large Nanoarrays	2	1.33	2005

1