scientific article; zbMATH DE number 4037759
From MaRDI portal
Publication:3777937
Recommendations
- 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
Cited in
(62)- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- Actively secure garbled circuits with constant communication overhead in the plain model
- Improved secure multiparty computation with a dishonest majority via quantum means
- Constant-Round Nonmalleable Commitments from Any One-Way Function
- One-way functions imply secure computation in a quantum world
- Sigma protocols from verifiable secret sharing and their applications
- Quantum multi-valued Byzantine agreement based on d-dimensional entangled states
- Concurrent knowledge extraction in public-key models
- Efficient set intersection with simulation-based security
- Quantum protocol for millionaire problem
- The power of undirected rewindings for adaptive security
- Zero-knowledge proofs for committed symmetric Boolean functions
- Round efficient secure multiparty quantum computation with identifiable abort
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
- On the design of cryptographic primitives
- Multiparty generation of an RSA modulus
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
- Game theoretic notions of fairness in multi-party coin toss
- 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
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Foundations of homomorphic secret sharing
- Group encryption: full dynamicity, message filtering and code-based instantiation
- A note on universal composable zero-knowledge in the common reference string model
- Breaking and fixing garbled circuits when a gate has duplicate input wires
- Oblivious transfer from any non-trivial elastic noisy channel via secret key agreement
- Mathematical problems in cryptology
- How to share a secret with cheaters
- Improving the efficiency of AES protocols in multi-party computation
- Two-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functions
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
- Toward a Generic Construction of Universally Convertible Undeniable Signatures from Pairing-Based Signatures
- scientific article; zbMATH DE number 1670843 (Why is no real title available?)
- Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms
- A complete characterization of game-theoretically fair, multi-party coin toss
- The complexity of differential privacy
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
- Oblivious transfer is in MiniQCrypt
- Random sources in private computation
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Multi-theorem preprocessing NIZKs from lattices
- Non-interactive composition of sigma-protocols via Share-then-Hash
- Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle
- A geometric approach to homomorphic secret sharing
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
- Efficient generic zero-knowledge proofs from commitments (extended abstract)
- Updateable Inner Product Argument with Logarithmic Verifier and Applications
- Broadcast from minicast secure against general adversaries
- Commitments to quantum states
- The round complexity of statistical MPC with optimal resiliency
- Secure multi-party quantum summation based on quantum Fourier transform
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Quantum secure multi-party summation based on Grover's search algorithm
- A class of protocols for quantum private comparison based on the symmetry of states
- Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head
- NIZK from SNARGs
- Quantum solution to a class of two-party private summation problems
- Some open problems in information-theoretic cryptography
- Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract)
- Low-leakage secure search for Boolean expressions
- Blind key-generation attribute-based encryption for general predicates
- Succinct interactive oracle proofs: applications and limitations
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)
