The following pages link to A Depth-Universal Circuit (Q3691586):
Displaying 12 items.
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact (Q2128569) (← links)
- From cryptomania to obfustopia through secret-key functional encryption (Q2175212) (← links)
- Efficient and scalable universal circuits (Q2188968) (← links)
- Unbounded dynamic predicate compositions in ABE from standard assumptions (Q2691592) (← links)
- Breaking the Circuit Size Barrier for Secure Computation Under DDH (Q2835599) (← links)
- From Cryptomania to Obfustopia Through Secret-Key Functional Encryption (Q3181034) (← links)
- Universal circuits (Preliminary Report) (Q4140882) (← links)
- Constraining and Watermarking PRFs from Milder Assumptions (Q5041166) (← links)
- Efficient Universal Quantum Circuits (Q5323090) (← links)
- Functional commitments for all functions, with transparent setup and from SIS (Q6063522) (← links)
- Time-release cryptography from minimal circuit assumptions (Q6157610) (← links)
- Compact NIZKs from standard assumptions on bilinear maps (Q6570525) (← links)
