The following pages link to Arkady Yerukhimovich (Q814926):
Displaying 10 items.
- Efficient data storage in large nanoarrays (Q814927) (← links)
- The more the merrier: reducing the cost of large scale MPC (Q2056763) (← links)
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens (Q2423844) (← links)
- Authenticated broadcast with a partially compromised public-key infrastructure (Q2637312) (← links)
- Limits of Computational Differential Privacy in the Client/Server Setting (Q3000553) (← links)
- Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions (Q3000564) (← links)
- Impossibility of Blind Signatures from One-Way Permutations (Q3000567) (← links)
- On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations (Q3584983) (← links)
- On Black-Box Constructions of Predicate Encryption from Trapdoor Permutations (Q3650693) (← links)
- (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens (Q5746357) (← links)
