scientific article; zbMATH DE number 4037759
[For the entire collection see Zbl 0624.00026.] Under the assumption that encryption functions exist, we show that all languages in NP possess zero-knowledge proofs. That is, it is possible to demonstrate that a CNF formula is satisfiable without revealing any other property of the formula. In particular, without yieldinChannel routing is an important subcase of the layout design problem for VLSI circuits. In the paper an exact model for channel routing is developed and some special variants of the problem are considered. For river routing and channel routing without vertical constraints results concerning complexity and necessary track number are given. For the case of channel routing with vertical constraints upper and lower bounds for the track number and an approximate routing algorithm are derived.
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- scientific article; zbMATH DE number 94166
- On the communication complexity of zero-knowledge proofs
- Zero-Knowledge Simulation of Boolean Circuits
- The Knowledge Complexity of Interactive Proof Systems
- A note on universal composable zero-knowledge in the common reference string model
- How to share a secret with cheaters
- Game theoretic notions of fairness in multi-party coin toss
- Quantum solution to a class of two-party private summation problems
- Mathematical problems in cryptology
- Improved secure multiparty computation with a dishonest majority via quantum means
- Secure multi-party quantum summation based on quantum Fourier transform
- 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
- Zero-knowledge proofs for committed symmetric Boolean functions
- Round efficient secure multiparty quantum computation with identifiable abort
- One-way functions imply secure computation in a quantum world
- 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
- Improving the efficiency of AES protocols in multi-party computation
- Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms
- A complete characterization of game-theoretically fair, multi-party coin toss
- Quantum multi-valued Byzantine agreement based on d-dimensional entangled states
- Quantum protocol for millionaire problem
- A class of protocols for quantum private comparison based on the symmetry of states
- Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle
- Blind key-generation attribute-based encryption for general predicates
- Non-interactive composition of sigma-protocols via Share-then-Hash
- Efficient set intersection with simulation-based security
- Concurrent knowledge extraction in public-key models
- Necessary and sufficient assumptions for non-interactive zero-knowledge proofs of knowledge for all NP relations. (Extended abstract)
- 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
- Efficient generic zero-knowledge proofs from commitments (extended abstract)
- Low-leakage secure search for Boolean expressions
- Oblivious transfer from any non-trivial elastic noisy channel via secret key agreement
- Broadcast from minicast secure against general adversaries
- Foundations of homomorphic secret sharing
- The complexity of differential privacy
- Updateable Inner Product Argument with Logarithmic Verifier and Applications
- Some open problems in information-theoretic cryptography
- Constant-Round Nonmalleable Commitments from Any One-Way Function
- Toward a Generic Construction of Universally Convertible Undeniable Signatures from Pairing-Based Signatures
- 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?
- Multi-theorem preprocessing NIZKs from lattices
- Multiparty generation of an RSA modulus
- Actively secure garbled circuits with constant communication overhead in the plain model
- 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
- The round complexity of statistical MPC with optimal resiliency
- Commitments to quantum states
- Sigma protocols from verifiable secret sharing and their applications
- Group encryption: full dynamicity, message filtering and code-based instantiation
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
- Lightweight transparent zero-knowledge proofs for cross-domain statements
- Registered ABE and adaptively-secure broadcast encryption from succinct LWE
- Efficient permutation correlations and batched random access for two-party computation
- Rate-1 zero-knowledge proofs from one-way functions
- On achieving ``best-in-the-multiverse MPC
- Goldreich-Krawczyk revisited: a note on the zero knowledge of proofs of knowledge
- Group encryption with oblivious traceability
- Succinct zero-knowledge proofs from one-way functions: the blackbox way
- On the design of cryptographic primitives
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777937)