scientific article

Oded Goldreich, Avi Wigderson, Silvio Micali

Publication date: 1987

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

complexity zero-knowledge proofs routing algorithm VLSI circuits track number river routing .CNF formula layout design Channel routing encryption functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Related Items

Round efficient secure multiparty quantum computation with identifiable abort, One-way functions imply secure computation in a quantum world, Efficient set intersection with simulation-based security, Concurrent knowledge extraction in public-key models, Updateable Inner Product Argument with Logarithmic Verifier and Applications, Game-theoretic fairness meets multi-party protocols: the case of leader election, Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes, Game theoretic notions of fairness in multi-party coin toss, Broadcast from Minicast Secure Against General Adversaries, Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement, Improving the efficiency of AES protocols in multi-party computation, On the design of cryptographic primitives, How to share a secret with cheaters, Mathematical problems in cryptology, Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms, A complete characterization of game-theoretically fair, multi-party coin toss, Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle, Blind key-generation attribute-based encryption for general predicates, Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract), NIZK from SNARGs, Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract), Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head, Random sources in private computation, The power of undirected rewindings for adaptive security, Two-round MPC without round collapsing revisited -- towards efficient malicious protocols, Succinct interactive oracle proofs: applications and limitations, Breaking and fixing garbled circuits when a gate has duplicate input wires, Two-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functions, Improved secure multiparty computation with a dishonest majority via quantum means, Quantum solution to a class of two-party private summation problems, Non-interactive composition of sigma-protocols via Share-then-Hash, Low-Leakage Secure Search for Boolean Expressions, A class of protocols for quantum private comparison based on the symmetry of states, Foundations of Homomorphic Secret Sharing, Secure multi-party quantum summation based on quantum Fourier transform, Actively secure garbled circuits with constant communication overhead in the plain model, Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?, Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?, Quantum multi-valued Byzantine agreement based on d-dimensional entangled states, Multi-theorem preprocessing NIZKs from lattices, A note on universal composable zero-knowledge in the common reference string model, Oblivious transfer is in MiniQCrypt, Breaking the circuit size barrier for secure computation under quasi-polynomial LPN, A geometric approach to homomorphic secret sharing, Round-optimal verifiable oblivious pseudorandom functions from ideal lattices, Group encryption: full dynamicity, message filtering and code-based instantiation, Quantum secure multi-party summation based on Grover's search algorithm, Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption, Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials, Quantum protocol for millionaire problem, Constant-Round Nonmalleable Commitments from Any One-Way Function, Toward a Generic Construction of Universally Convertible Undeniable Signatures from Pairing-Based Signatures, Multiparty generation of an RSA modulus, The Complexity of Differential Privacy, Some Open Problems in Information-Theoretic Cryptography, Zero-knowledge proofs for committed symmetric Boolean functions