Pages that link to "Item:Q3058664"
From MaRDI portal
The following pages link to Short Pairing-Based Non-interactive Zero-Knowledge Arguments (Q3058664):
Displaying 50 items.
- Refereed delegation of computation (Q385709) (← links)
- Shorter arithmetization of nondeterministic computations (Q496013) (← links)
- 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)
- Election control through social influence with unknown preferences (Q2019485) (← links)
- On subversion-resistant SNARKs (Q2039405) (← links)
- Compact designated verifier NIZKs from the CDH assumption without pairings (Q2051369) (← links)
- Marlin: preprocessing zkSNARKs with universal and updatable SRS (Q2055641) (← links)
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography (Q2055643) (← links)
- Compact NIZKs from standard assumptions on bilinear maps (Q2055661) (← links)
- Linearly-homomorphic signatures and scalable mix-nets (Q2055710) (← links)
- Public verifiable private decision tree prediction (Q2057148) (← links)
- Verifiable registration-based encryption (Q2096501) (← links)
- On succinct arguments and witness encryption from groups (Q2096510) (← links)
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics (Q2102078) (← links)
- Spartan: efficient and general-purpose zkSNARKs without trusted setup (Q2104239) (← links)
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures (Q2117059) (← links)
- Succinct non-interactive secure computation (Q2119013) (← links)
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments (Q2120097) (← links)
- Subquadratic SNARGs in the random oracle model (Q2120100) (← links)
- An algebraic framework for universal and updatable SNARKs (Q2120103) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge (Q2139628) (← links)
- Signatures of knowledge for Boolean circuits under standard assumptions (Q2143135) (← links)
- Somewhere statistically binding commitment schemes with applications (Q2145407) (← links)
- MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK) (Q2148762) (← links)
- Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs (Q2149845) (← links)
- A simple post-quantum non-interactive zero-knowledge proof from garbled circuits (Q2151307) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- On succinct non-interactive arguments in relativized worlds (Q2170051) (← links)
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions (Q2170057) (← links)
- SNARGs for P from sub-exponential DDH and QR (Q2170061) (← links)
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials (Q2423846) (← links)
- Efficient chameleon hash functions in the enhanced collision resistant model (Q2658065) (← links)
- Toward non-interactive zero-knowledge proofs for NP from LWE (Q2661693) (← links)
- Cryptographic algorithms for privacy-preserving online applications (Q2668547) (← links)
- Succinct functional commitment for a large class of arithmetic circuits (Q2691602) (← links)
- Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation (Q2822680) (← links)
- On the Existence of Extractable One-Way Functions (Q2829449) (← links)
- Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems (Q2829945) (← links)
- Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials (Q2829958) (← links)
- On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption (Q2945373) (← links)
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion (Q2953796) (← links)
- A Shuffle Argument Secure in the Generic Model (Q2953798) (← links)
- On the (In)Security of SNARKs in the Presence of Oracles (Q3179354) (← links)
- Interactive Oracle Proofs (Q3181021) (← links)
- Delegating RAM Computations (Q3181023) (← links)
- Constant-Round Leakage-Resilient Zero-Knowledge Argument for NP from the Knowledge-of-Exponent Assumption (Q3194601) (← links)
- Arguments of Proximity (Q3457077) (← links)
