scientific article; zbMATH DE number 5485433
From MaRDI portal
Publication:3549593
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
- Actively secure garbled circuits with constant communication overhead in the plain model
- Black-box timed commitments from time-lock puzzles
- Threshold computation in the head: improved framework for post-quantum signatures and zero-knowledge arguments
- A guide to the design of digital signatures based on cryptographic group actions
- Black-box anonymous commit-and-prove
- Efficient proof of RAM programs from any public-coin zero-knowledge system
- Modelling ciphers with overdefined systems of quadratic equations: application to Friday, Vision, RAIN and Biscuit
- Dual support decomposition in the head: shorter signatures from Rank SD and MinRank
- Three-round secure multiparty computation from black-box two-round oblivious transfer
- Single trace side-channel attack on the MPC-in-the-head framework
- 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
- A digital signature scheme based on the vector space factorization problem and the MPC-in-the-head paradigm
- 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
- RYDE: a digital signature scheme based on rank syndrome decoding problem with MPC-in-the-head paradigm
- 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
- Your reputation's safe with me: framing-free distributed zero-knowledge proofs
- Round-optimal black-box protocol compilers
- Quasi-optimal permutation ranking and applications to PERK
- Secure protocol transformations
- OT-Combiners via Secure Computation
- Ligero: lightweight sublinear arguments without a trusted setup
- On digital signatures based on group actions: QROM security and ring signatures
- A new hash-based enhanced privacy ID signature scheme
- 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
- Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
- Improved black-box constructions of composable secure computation
- Efficient isogeny proofs using generic techniques
- On the Power of Secure Two-Party Computation
- Efficient secure multiparty computation with identifiable abort
- \textsf{ReSolveD}: shorter signatures from regular syndrome decoding and VOLE-in-the-head
- Fully dynamic attribute-based signatures for circuits from codes
- Zero knowledge protocols and signatures from the restricted syndrome decoding problem
- 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
- Towards building scalable constant-round MPC from minimal assumptions via round collapsing
- Constant-round asynchronous MPC with optimal resilience and linear communication
- The round complexity of black-box post-quantum secure computation
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- Black-box transformations from passive to covert security with public verifiability
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)
