Short-lived zero-knowledge proofs and signatures
From MaRDI portal
Publication:6135445
DOI10.1007/978-3-031-22969-5_17zbMATH Open1519.94037OpenAlexW4317927042MaRDI QIDQ6135445FDOQ6135445
Authors: Arasu Arun, Joseph Bonneau, Jeremy Clark 
Publication date: 25 August 2023
Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22969-5_17
Recommendations
Cites Work
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
- A method for obtaining digital signatures and public-key cryptosystems
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Title not available (Why is that?)
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Title not available (Why is that?)
- Efficient signature generation by smart cards
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Advances in Cryptology - CRYPTO 2003
- Short pairing-based non-interactive zero-knowledge arguments
- Designated Verifier Proofs and Their Applications
- Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
- Title not available (Why is that?)
- Financial Cryptography and Data Security
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Trustworthy public randomness with sloth, unicorn, and trx
- Transaction protection by beacons
- Non-interactive zero-knowledge proofs for composite statements
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Scalable zero knowledge with no trusted setup
- Homomorphic time-lock puzzles and applications
- Verifiable delay functions from supersingular isogenies and pairings
- Verifiable delay functions
- Continuous verifiable delay functions
- Simple verifiable delay functions
- Efficient verifiable delay functions
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Improved OR-Composition of Sigma-Protocols
- On the Size of Pairing-Based Non-interactive Arguments
- Simple proofs of sequential work
- Non-interactive cryptographic timestamping based on verifiable delay functions
- Publicly verifiable proofs of sequential work
- Transparent SNARKs from DARK compilers
- Efficient range proofs with transparent setup from bounded integer commitments
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- SoK: securing email -- a stakeholder-based analysis
- Short-lived zero-knowledge proofs and signatures
- Indistinguishable Proofs of Work or Knowledge
- Time-release cryptography from minimal circuit assumptions
- Slow Motion Zero Knowledge Identifying with Colliding Commitments
Cited In (4)
This page was built for publication: Short-lived zero-knowledge proofs and signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135445)
