Journal of the ACM (JACM)
The Complexity of Computing
A characterization of the power of vector machines
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
On sparse graphs with dense long paths.
On sparse graphs with dense long paths.
Circuit Size is Nonlinear in Depth
Circuit Size is Nonlinear in Depth
Graphs and Hypergraphs
A complexity theory based on Boolean algebra
Journal of the ACM (JACM)
An Efficient General-Purpose Parallel Computer
Journal of the ACM (JACM)
Three-Dimensional VLSI: a case study
Journal of the ACM (JACM)
Minimal Complete Primitives for Secure Multi-party Computation
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Non-Interactive CryptoComputing For NC1
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
An efficient general purpose parallel computer
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Attribute-Based Access Control with Hidden Policies and Hidden Credentials
IEEE Transactions on Computers
Extending tamper-proof hardware security to untrusted execution environments
CARDIS'02 Proceedings of the 5th conference on Smart Card Research and Advanced Application Conference - Volume 5
Improved Garbled Circuit: Free XOR Gates and Applications
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
Financial Cryptography and Data Security
Information Security and Cryptology --- ICISC 2008
Practical Secure Evaluation of Semi-private Functions
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Efficient Universal Quantum Circuits
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Secure Multi-party Computation Minimizing Online Rounds
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Two-party computing with encrypted data
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Garbled circuits for leakage-resilience: hardware implementation and evaluation of one-time programs
CHES'10 Proceedings of the 12th international conference on Cryptographic hardware and embedded systems
Universality considerations in VLSI circuits
IEEE Transactions on Computers
Efficient universal quantum circuits
Quantum Information & Computation
Hiding circuit topology from unbounded reverse engineers
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Constant-Round private function evaluation with linear complexity
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
| Hi-index | 0.01 |
We show that there is a combinational (acyclic) Boolean circuit of complexity 0(slog s), that can be made to compute any Boolean function of complexity s by setting its specially designated set of control inputs to appropriate fixed values. We investigate the construction of such “universal circuits” further so as to exhibit directions in which refinements of the asymptotic multiplicative constant factor in the complexity bound can be found. In this pursuit useful detailed guidance is provided by available lower bound arguments. In the final section we discuss some other problems in computational complexity that can be related directly to the graph-theoretic ideas behind our constructions. For motivation we start by illustrating some of the applications of universal circuits themselves.