Pages that link to "Item:Q2874542"

The following pages link to Scalable Zero Knowledge via Cycles of Elliptic Curves (Q2874542):

Displaying 33 items.

• Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
• The hunting of the SNARK (Q1698394) (← links)
• How to build time-lock encryption (Q1791669) (← links)
• On subversion-resistant SNARKs (Q2039405) (← links)
• Marlin: preprocessing zkSNARKs with universal and updatable SRS (Q2055641) (← links)
• \textsc{Fractal}: post-quantum and transparent recursive proofs from holography (Q2055643) (← links)
• Compactness of hashing modes and efficiency beyond Merkle tree (Q2056724) (← links)
• Public verifiable private decision tree prediction (Q2057148) (← links)
• Hardware implementation of multiplication over quartic extension fields (Q2079983) (← links)
• Spartan: efficient and general-purpose zkSNARKs without trusted setup (Q2104239) (← links)
• TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures (Q2117059) (← links)
• \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments (Q2120097) (← links)
• BooLigero: improved sublinear zero knowledge proofs for Boolean circuits (Q2145410) (← links)
• Efficient proof composition for verifiable computation (Q2167734) (← links)
• On succinct non-interactive arguments in relativized worlds (Q2170051) (← links)
• Families of SNARK-friendly 2-chains of elliptic curves (Q2170053) (← links)
• Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions (Q2170057) (← links)
• Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits (Q2799088) (← links)
• NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion (Q2953796) (← links)
• Note on families of pairing-friendly elliptic curves with small embedding degree (Q3121464) (← links)
• On the (In)Security of SNARKs in the Presence of Oracles (Q3179354) (← links)
• Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
• Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography (Q5041168) (← links)
• ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines (Q5087274) (← links)
• Computational Integrity with a Public Random String from Quasi-Linear PCPs (Q5270376) (← links)
• Sublinear Zero-Knowledge Arguments for RAM Programs (Q5738888) (← links)
• On Cycles of Pairing-Friendly Elliptic Curves (Q5742695) (← links)
• Algorithms for elliptic curves (Q5865699) (← links)
• An efficient identity tracing scheme for blockchain-based systems (Q6057389) (← links)
• A survey of elliptic curves for proof systems (Q6063127) (← links)
• Rinocchio: SNARKs for ring arithmetic (Q6070447) (← links)
• Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) (← links)
• Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation (Q6182003) (← links)