Pages that link to "Item:Q3777940"

The following pages link to How To Prove Yourself: Practical Solutions to Identification and Signature Problems (Q3777940):

Displaying 50 items.

• On publicly-accountable zero-knowledge and small shuffle arguments (Q2061977) (← links)
• Group encryption: full dynamicity, message filtering and code-based instantiation (Q2061981) (← links)
• Identity-based authenticated encryption with identity confidentiality (Q2067611) (← links)
• A new identity-based multivariate signature scheme (Q2079899) (← links)
• Post-quantum ID-based ring signatures from symmetric-key primitives (Q2096649) (← links)
• A gapless code-based hash proof system based on RQC and its applications (Q2099170) (← links)
• Two-sided malicious security for private intersection-sum with cardinality (Q2102051) (← links)
• Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics (Q2102078) (← links)
• Interactive proofs for social graphs (Q2102081) (← links)
• Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
• Spartan: efficient and general-purpose zkSNARKs without trusted setup (Q2104239) (← links)
• NIZK from LPN and trapdoor hash via correlation intractability for approximable relations (Q2104241) (← links)
• Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages (Q2104242) (← links)
• Blind polynomial evaluation and data trading (Q2117031) (← links)
• Unlinkable and invisible \(\gamma \)-sanitizable signatures (Q2117037) (← links)
• Partially structure-preserving signatures: lower bounds, constructions and more (Q2117038) (← links)
• TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures (Q2117059) (← links)
• Cryptanalysis of the binary permuted kernel problem (Q2117060) (← links)
• LESS-FM: fine-tuning signatures from the code equivalence problem (Q2118522) (← links)
• On removing rejection conditions in practical lattice-based signatures (Q2118558) (← links)
• Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols (Q2120075) (← links)
• Compact ring signatures from learning with errors (Q2120080) (← links)
• \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments (Q2120097) (← links)
• Subquadratic SNARGs in the random oracle model (Q2120100) (← links)
• A compressed \(\varSigma \)-protocol theory for lattices (Q2128575) (← links)
• A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs (Q2128576) (← links)
• Tight state-restoration soundness in the algebraic group model (Q2128989) (← links)
• Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
• Compressing proofs of \(k\)-out-of-\(n\) partial knowledge (Q2139628) (← links)
• \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions (Q2139630) (← links)
• Time- and space-efficient arguments from groups of unknown order (Q2139631) (← links)
• Does Fiat-Shamir require a cryptographic hash function? (Q2139639) (← links)
• Composition with knowledge assumptions (Q2139641) (← links)
• Non-interactive batch arguments for NP from standard assumptions (Q2139642) (← links)
• Implementing secure reporting of sexual misconduct -- revisiting WhoToo (Q2146102) (← links)
• MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK) (Q2148762) (← links)
• An isogeny-based ID protocol using structured public keys (Q2149792) (← links)
• Cross-domain attribute-based access control encryption (Q2149810) (← links)
• Issuer-hiding attribute-based credentials (Q2149822) (← links)
• Report and trace ring signatures (Q2149823) (← links)
• Improved zero-knowledge argument of encrypted extended permutation (Q2151308) (← links)
• Adaptively secure threshold symmetric-key encryption (Q2152046) (← links)
• The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures (Q2152049) (← links)
• A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption (Q2152147) (← links)
• Dynamic universal accumulator with batch update over bilinear groups (Q2152172) (← links)
• Layering quantum-resistance into classical digital signature algorithms (Q2154036) (← links)
• A non-interactive \((t, n)\)-publicly verifiable multi-secret sharing scheme (Q2161420) (← links)
• Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs (Q2163394) (← links)
• A correction to a code-based blind signature scheme (Q2163765) (← links)
• Reusing nonces in Schnorr signatures (and keeping it secure...) (Q2167718) (← links)