A Depth-Universal Circuit
From MaRDI portal
Publication:3691586
DOI10.1137/0214058zbMath0573.94015OpenAlexW2043390577MaRDI QIDQ3691586
H. James Hoover, Stephen A. Cook
Publication date: 1985
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0214058
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (12)
Constraining and Watermarking PRFs from Milder Assumptions ⋮ Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact ⋮ From Cryptomania to Obfustopia Through Secret-Key Functional Encryption ⋮ Efficient Universal Quantum Circuits ⋮ From cryptomania to obfustopia through secret-key functional encryption ⋮ Efficient and scalable universal circuits ⋮ Functional commitments for all functions, with transparent setup and from SIS ⋮ Constrained pseudorandom functions from homomorphic secret sharing ⋮ Time-release cryptography from minimal circuit assumptions ⋮ How to use (plain) witness encryption: registered ABE, flexible broadcast, and more ⋮ Unbounded dynamic predicate compositions in ABE from standard assumptions ⋮ Breaking the Circuit Size Barrier for Secure Computation Under DDH
This page was built for publication: A Depth-Universal Circuit
