The following pages link to (Q3549593):
Displaying 50 items.
- Efficient Secure Multiparty Computation with Identifiable Abort (Q3179367) (← links)
- Secret Sharing Schemes with Algebraic Properties and Applications (Q3188241) (← links)
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems (Q3408195) (← links)
- Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications (Q4916004) (← links)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- Verifiable Inner Product Encryption Scheme (Q5041153) (← links)
- Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography (Q5041168) (← links)
- Updateable Inner Product Argument with Logarithmic Verifier and Applications (Q5041169) (← links)
- An Algebraic Approach to Nonmalleability (Q5157398) (← links)
- On Secret Sharing with Nonlinear Product Reconstruction (Q5265016) (← links)
- OT-Combiners via Secure Computation (Q5445517) (← links)
- Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves (Q5458608) (← links)
- On the Computational Overhead of MPC with Dishonest Majority (Q5738762) (← links)
- Sublinear Zero-Knowledge Arguments for RAM Programs (Q5738888) (← links)
- From fairness to full security in multiparty computation (Q5916285) (← links)
- PrORAM (Q6041295) (← links)
- On interactive oracle proofs for Boolean R1CS statements (Q6045202) (← links)
- Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems (Q6057202) (← links)
- Ligero: lightweight sublinear arguments without a trusted setup (Q6063128) (← links)
- Sok: vector OLE-based zero-knowledge protocols (Q6063131) (← links)
- Efficient NIZKs and signatures from commit-and-open protocols in the QROM (Q6104357) (← links)
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round (Q6108994) (← links)
- Actively secure garbled circuits with constant communication overhead in the plain model (Q6109074) (← links)
- Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) (Q6111540) (← links)
- Four-round black-box non-malleable schemes from one-way permutations (Q6114274) (← links)
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection (Q6132417) (← links)
- Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head'' (Q6132422) (← links)
- Black-box anonymous commit-and-prove (Q6134847) (← links)
- Non-interactive zero-knowledge proofs to multiple verifiers (Q6135446) (← links)
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols (Q6155260) (← links)
- Lattice-based inner product argument (Q6160829) (← links)
- Quadratic multiparty randomized encodings beyond honest majority and their applications (Q6166962) (← links)
- On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives (Q6169365) (← links)
- Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II (Q6169368) (← links)
- GUC-secure commitments via random oracles: new impossibility and feasibility (Q6175972) (← links)
- Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic (Q6176271) (← links)
- An Attack on Some Signature Schemes Constructed from Five-Pass Identification Schemes (Q6488026) (← links)
- Efficient isogeny proofs using generic techniques (Q6535120) (← links)
- Building MPCitH-based signatures from MQ, MinRank, and rank SD (Q6547988) (← links)
- Biscuit: new MPCitH signature scheme from structured multivariate polynomials (Q6547993) (← links)
- Efficient zero-knowledge arguments and digital signatures \textit{via} sharing conversion \textit{in the head} (Q6550638) (← links)
- On the correlation complexity of MPC with cheater identification (Q6573954) (← links)
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs (Q6581781) (← links)
- Your reputation's safe with me: framing-free distributed zero-knowledge proofs (Q6581782) (← links)
- PERK: compact signature scheme based on a new variant of the permuted kernel problem (Q6587197) (← links)
- Ramp hyper-invertible matrices and their applications to MPC protocols (Q6595682) (← links)
- Threshold linear secret sharing to the rescue of MPC-in-the-head (Q6595690) (← links)
- Algebraic attacks on round-reduced \textsc{Rain} and full \textsf{AIM-III} (Q6595816) (← links)
- The price of active security in cryptographic protocols (Q6595846) (← links)
- SDitH in the QROM (Q6595928) (← links)
