scientific article; zbMATH DE number 5485433
From MaRDI portal
Publication:3549593
Cited in
(only showing first 100 items - show all)- Non-interactive zero-knowledge proofs to multiple verifiers
- Amplification of non-interactive zero knowledge, revisited
- Black-box (and fast) non-malleable zero knowledge
- CDS composition of multi-round protocols
- Improved alternating-moduli PRFs and post-quantum signatures
- More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings
- Sometimes you can't distribute random-oracle-based proofs
- Secure multiparty computation with identifiable abort via vindicating release
- An efficient ZK compiler from SIMD circuits to general circuits
- Hash-Based Direct Anonymous Attestation
- Wave Parameter Selection
- Commitments to quantum states
- On the power of secure two-party computation
- Hybrid zero-knowledge from garbled circuits and circuit-based composition of \(\Sigma \)-protocols
- Zero-knowledge IOPs approaching witness length
- Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
- Resumable zero-knowledge for circuits from symmetric key primitives
- Verifiable decryption in the head
- Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)
- Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic
- Code-based signatures from new proofs of knowledge for the syndrome decoding problem
- Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature
- Four-round black-box non-malleable schemes from one-way permutations
- Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems
- On the computational overhead of MPC with dishonest majority
- Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
- Secret Sharing Schemes with Algebraic Properties and Applications
- Building MPCitH-based signatures from MQ, MinRank, and rank SD
- Biscuit: new MPCitH signature scheme from structured multivariate polynomials
- Efficient zero-knowledge arguments and digital signatures \textit{via} sharing conversion \textit{in the head}
- Compilation of function representations for secure computing paradigms
- SoK: how (not) to design and implement post-quantum cryptography
- Actively secure garbled circuits with constant communication overhead in the plain model
- Black-box anonymous commit-and-prove
- Efficient proof of RAM programs from any public-coin zero-knowledge system
- Three-round secure multiparty computation from black-box two-round oblivious transfer
- Sublinear zero-knowledge arguments for RAM programs
- MinRank in the head. Short signatures from zero-knowledge proofs
- Efficient NIZKs and signatures from commit-and-open protocols in the QROM
- On \(d\)-multiplicative secret sharing
- Oblivious sampling with applications to two-party k-means clustering
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
- Differential power analysis of the Picnic signature scheme
- Zero-knowledge proofs for committed symmetric Boolean functions
- On the correlation complexity of MPC with cheater identification
- Towards a unified approach to black-box constructions of zero-knowledge proofs
- On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives
- Black-box reusable NISC with random oracles
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
- Your reputation's safe with me: framing-free distributed zero-knowledge proofs
- An Algebraic Approach to Nonmalleability
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
- On the complexity of additively homomorphic UC commitments
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations
- Round optimal black-box ``commit-and-prove
- Lattice-based inner product argument
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- Security of hedged Fiat-Shamir signatures under fault attacks
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- Banquet: short and fast signatures from AES
- The return of the SDitH
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- PERK: compact signature scheme based on a new variant of the permuted kernel problem
- PrORAM
- Verifiable Inner Product Encryption Scheme
- Quadratic multiparty randomized encodings beyond honest majority and their applications
- GUC-secure commitments via random oracles: new impossibility and feasibility
- On secret sharing with nonlinear product reconstruction
- Algebraic attacks on round-reduced \textsc{Rain} and full \textsf{AIM-III}
- Ramp hyper-invertible matrices and their applications to MPC protocols
- Threshold linear secret sharing to the rescue of MPC-in-the-head
- SDitH in the QROM
- ZK-for-Z2K: MPC-in-the-head zero-knowledge proofs for \(\mathbb{Z}_{2^k}\)
- Scalable zero knowledge with no trusted setup
- Local zero knowledge
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
- On the round complexity of black-box secure MPC
- Round-optimal black-box protocol compilers
- Secure protocol transformations
- OT-Combiners via Secure Computation
- Ligero: lightweight sublinear arguments without a trusted setup
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
- Post-quantum key-blinding for authentication in anonymity networks
- MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK)
- Syndrome decoding in the head: shorter signatures from zero-knowledge proofs
- ZK-PCPs from leakage-resilient secret sharing
- Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols
- On interactive oracle proofs for Boolean R1CS statements
- Sok: vector OLE-based zero-knowledge protocols
- How to recover a secret with \(O(n)\) additions
- Credibility in private set membership
- A simple post-quantum non-interactive zero-knowledge proof from garbled circuits
- Layering quantum-resistance into classical digital signature algorithms
- Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves
- An Attack on Some Signature Schemes Constructed from Five-Pass Identification Schemes
- The price of active security in cryptographic protocols
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 Q3549593)
