scientific article; zbMATH DE number 5485433
From MaRDI portal
Publication:3549593
zbMATH Open1232.68044MaRDI QIDQ3549593FDOQ3549593
Cited in
(only showing first 100 items - show all)
- Compilation of function representations for secure computing paradigms
- SoK: how (not) to design and implement post-quantum cryptography
- Three-round secure multiparty computation from black-box two-round oblivious transfer
- 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
- Towards a unified approach to black-box constructions of zero-knowledge proofs
- An Algebraic Approach to Nonmalleability
- On the complexity of additively homomorphic UC commitments
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- The return of the SDitH
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations
- Round optimal black-box ``commit-and-prove
- 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
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- On secret sharing with nonlinear product reconstruction
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
- Scalable zero knowledge with no trusted setup
- Local zero knowledge
- 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
- OT-Combiners via Secure Computation
- Secure protocol transformations
- 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)
- ZK-PCPs from leakage-resilient secret sharing
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols
- An Attack on Some Signature Schemes Constructed from Five-Pass Identification Schemes
- Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves
- A simple post-quantum non-interactive zero-knowledge proof from garbled circuits
- Layering quantum-resistance into classical digital signature algorithms
- On the Power of Secure Two-Party Computation
- Efficient secure multiparty computation with identifiable abort
- Asymptotically quasi-optimal cryptography
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
- Stacked garbling for disjunctive zero-knowledge proofs
- Statistical ZAPR arguments from bilinear maps
- Order-C secure multiparty computation for highly repetitive circuits
- The more the merrier: reducing the cost of large scale MPC
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- A note on ramp secret sharing schemes from error-correcting codes
- Black-box transformations from passive to covert security with public verifiability
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- The price of active security in cryptographic protocols
- From FE combiners to secure MPC and back
- Constant-round interactive proofs for delegating computation
- Efficient generic zero-knowledge proofs from commitments (extended abstract)
- On publicly-accountable zero-knowledge and small shuffle arguments
- Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
- On sufficient oracles for secure computation with identifiable abort
- Updateable Inner Product Argument with Logarithmic Verifier and Applications
- Non-interactive zero-knowledge proofs to multiple verifiers
- On the power of secure two-party computation
- Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
- 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
- Black-box anonymous commit-and-prove
- Efficient proof of RAM programs from any public-coin zero-knowledge system
- Sublinear zero-knowledge arguments for RAM programs
- MinRank in the head. Short signatures from zero-knowledge proofs
- On the correlation complexity of MPC with cheater identification
- 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
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
- Lattice-based inner product argument
- PERK: compact signature scheme based on a new variant of the permuted kernel problem
- PrORAM
- Quadratic multiparty randomized encodings beyond honest majority and their applications
- Verifiable Inner Product Encryption Scheme
- GUC-secure commitments via random oracles: new impossibility and feasibility
- 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}\)
- Ligero: lightweight sublinear arguments without a trusted setup
- Syndrome decoding in the head: shorter signatures from zero-knowledge proofs
- Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II
- On interactive oracle proofs for Boolean R1CS statements
- How to recover a secret with \(O(n)\) additions
- Sok: vector OLE-based zero-knowledge protocols
- Credibility in private set membership
- The price of active security in cryptographic protocols
- Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
- Efficient isogeny proofs using generic techniques
- \textsf{ReSolveD}: shorter signatures from regular syndrome decoding and VOLE-in-the-head
- Fully dynamic attribute-based signatures for circuits from codes
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)
