The following pages link to (Q2754171):
Displaying 9 items.
- Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model (Q1633458) (← links)
- Homomorphic secret sharing for low degree polynomials (Q1710675) (← links)
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact (Q2128569) (← links)
- Efficient and scalable universal circuits (Q2188968) (← links)
- Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys (Q2954373) (← links)
- A Practical Universal Circuit Construction and Secure Evaluation of Private Functions (Q3603006) (← links)
- Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
- Non-interactive Secure 2PC in the Offline/Online and Batch Settings (Q5270370) (← links)
- Combinatorially homomorphic encryption (Q6582175) (← links)
