scientific article; zbMATH DE number 5485433
From MaRDI portal
Publication:3549593
Cited in
(only showing first 100 items - show all)- 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
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- A note on ramp secret sharing schemes from error-correcting codes
- The price of active security in cryptographic protocols
- Shorter, tighter, FAESTer: optimizations and improved (QROM) analysis for VOLE-in-the-head signatures
- From Farfalle to \textsc{Megafono} via Ciminion: the PRF \textsc{Hydra} for MPC applications
- Short signatures from regular syndrome decoding in the head
- From FE combiners to secure MPC and back
- Algebraic geometric secret sharing schemes over large fields are asymptotically threshold
- On publicly-accountable zero-knowledge and small shuffle arguments
- Efficient generic zero-knowledge proofs from commitments (extended abstract)
- Constant-round interactive proofs for delegating computation
- Sneaking up the ranks: partial key exposure attacks on rank-based schemes
- MPC in the head using the subfield bilinear collision problem
- On round elimination for special-sound multi-round identification and the generality of the hypercube for MPCitH
- Pairing-free blind signatures from CDH assumptions
- 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
- Black-box constant-round secure 2PC with succinct communication
- Round-optimal black-box multiparty computation from polynomial-time assumptions
- Relaxed vector commitment for shorter signatures
- Zero-knowledge RAM: doubly efficient and black-box
- Query-reusable proof systems
- 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
- Universal adaptor signatures from blackbox multi-party computation
- Hybrid zero-knowledge from garbled circuits and circuit-based composition of -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)
- Hybrid zero-knowledge from garbled circuits
- 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 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
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)
