The following pages link to (Q3549593):
Displayed 50 items.
- On \(d\)-multiplicative secret sharing (Q604627) (← links)
- Compilation of function representations for secure computing paradigms (Q826238) (← links)
- SoK: how (not) to design and implement post-quantum cryptography (Q826276) (← links)
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations (Q1629411) (← links)
- Round optimal black-box ``commit-and-prove'' (Q1629413) (← links)
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols (Q2035999) (← links)
- Security of hedged Fiat-Shamir signatures under fault attacks (Q2055633) (← links)
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes (Q2055652) (← links)
- Stacked garbling for disjunctive zero-knowledge proofs (Q2055668) (← links)
- Statistical ZAPR arguments from bilinear maps (Q2055670) (← links)
- Order-C secure multiparty computation for highly repetitive circuits (Q2056761) (← links)
- The more the merrier: reducing the cost of large scale MPC (Q2056763) (← links)
- Banquet: short and fast signatures from AES (Q2061922) (← links)
- On publicly-accountable zero-knowledge and small shuffle arguments (Q2061977) (← links)
- Black-box transformations from passive to covert security with public verifiability (Q2096543) (← links)
- Spartan: efficient and general-purpose zkSNARKs without trusted setup (Q2104239) (← links)
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures (Q2117059) (← links)
- Differential power analysis of the Picnic signature scheme (Q2118537) (← links)
- Zero-knowledge proofs for committed symmetric Boolean functions (Q2118554) (← links)
- The price of active security in cryptographic protocols (Q2119012) (← links)
- Three-round secure multiparty computation from black-box two-round oblivious transfer (Q2128560) (← links)
- On the round complexity of black-box secure MPC (Q2128561) (← links)
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC (Q2129015) (← links)
- Towards a unified approach to black-box constructions of zero-knowledge proofs (Q2139627) (← links)
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications (Q2139646) (← links)
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits (Q2145410) (← links)
- Post-quantum key-blinding for authentication in anonymity networks (Q2146075) (← links)
- MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK) (Q2148762) (← links)
- A simple post-quantum non-interactive zero-knowledge proof from garbled circuits (Q2151307) (← links)
- Layering quantum-resistance into classical digital signature algorithms (Q2154036) (← links)
- ZK-PCPs from leakage-resilient secret sharing (Q2159466) (← links)
- Round-optimal black-box protocol compilers (Q2170000) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier (Q2170049) (← links)
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions (Q2170057) (← links)
- Algebraic geometric secret sharing schemes over large fields are asymptotically threshold (Q2171881) (← links)
- From FE combiners to secure MPC and back (Q2175912) (← links)
- Oblivious sampling with applications to two-party \(k\)-means clustering (Q2188971) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
- A note on ramp secret sharing schemes from error-correcting codes (Q2450506) (← links)
- Code-based signatures from new proofs of knowledge for the syndrome decoding problem (Q2698342) (← links)
- Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature (Q2698345) (← links)
- On the Complexity of Additively Homomorphic UC Commitments (Q2796142) (← links)
- On the Power of Secure Two-Party Computation (Q2829222) (← links)
- Secure Protocol Transformations (Q2829224) (← links)
- Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract) (Q2953816) (← links)
- 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)