Short-lived zero-knowledge proofs and signatures
From MaRDI portal
Publication:6135445
DOI10.1007/978-3-031-22969-5_17zbMath1519.94037OpenAlexW4317927042MaRDI QIDQ6135445
Joseph Bonneau, Arasu Arun, Jeremy Thane 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
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-interactive zero-knowledge proofs for composite statements
- Transaction protection by beacons
- Efficient signature generation by smart cards
- Trustworthy public randomness with sloth, unicorn, and trx
- Simple proofs of sequential work
- Verifiable delay functions
- Transparent SNARKs from DARK compilers
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Continuous verifiable delay functions
- 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
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Homomorphic time-lock puzzles and applications
- Verifiable delay functions from supersingular isogenies and pairings
- Non-interactive cryptographic timestamping based on verifiable delay functions
- Scalable zero knowledge with no trusted setup
- Improved OR-Composition of Sigma-Protocols
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
- Designated Verifier Proofs and Their Applications
- Indistinguishable Proofs of Work or Knowledge
- Publicly verifiable proofs of sequential work
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- A method for obtaining digital signatures and public-key cryptosystems
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Simple verifiable delay functions
- Advances in Cryptology - CRYPTO 2003
- Financial Cryptography and Data Security
- On the Size of Pairing-Based Non-interactive Arguments
- Slow Motion Zero Knowledge Identifying with Colliding Commitments
- Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
- Efficient verifiable delay functions
- Short-lived zero-knowledge proofs and signatures
- Time-release cryptography from minimal circuit assumptions
This page was built for publication: Short-lived zero-knowledge proofs and signatures
