Short-lived zero-knowledge proofs and signatures
From MaRDI portal
Publication:6135445
Recommendations
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- Advances in Cryptology - CRYPTO 2003
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Continuous verifiable delay functions
- Designated verifier proofs and their applications
- Efficient range proofs with transparent setup from bounded integer commitments
- Efficient signature generation by smart cards
- Efficient verifiable delay functions
- Financial Cryptography and Data Security
- Homomorphic time-lock puzzles and applications
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 1303131 (Why is no real title available?)
- scientific article; zbMATH DE number 708802 (Why is no real title available?)
- scientific article; zbMATH DE number 2081084 (Why is no real title available?)
- scientific article; zbMATH DE number 2081086 (Why is no real title available?)
- scientific article; zbMATH DE number 1759782 (Why is no real title available?)
- scientific article; zbMATH DE number 1406779 (Why is no real title available?)
- Improved OR-composition of sigma-protocols
- Indistinguishable proofs of work or knowledge
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Non-interactive cryptographic timestamping based on verifiable delay functions
- Non-interactive zero-knowledge proofs for composite statements
- On the size of pairing-based non-interactive arguments
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Publicly verifiable proofs of sequential work
- Quadratic span programs and succinct NIZKs without PCPs
- Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
- Scalable zero knowledge with no trusted setup
- Short pairing-based non-interactive zero-knowledge arguments
- Short-lived zero-knowledge proofs and signatures
- Simple proofs of sequential work
- Simple verifiable delay functions
- Slow motion zero knowledge identifying with colliding commitments
- Snarks for C: verifying program executions succinctly and in zero knowledge
- SoK: securing email -- a stakeholder-based analysis
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Time-release cryptography from minimal circuit assumptions
- Transaction protection by beacons
- Transparent SNARKs from DARK compilers
- Trustworthy public randomness with sloth, unicorn, and trx
- Verifiable delay functions
- Verifiable delay functions from supersingular isogenies and pairings
Cited in
(9)- Short 2-Move Undeniable Signatures
- Short-lived zero-knowledge proofs and signatures
- (Verifiable) delay functions from Lucas sequences
- Cryptanalysis of algebraic verifiable delay functions
- On deniable authentication against malicious verifiers
- DSKE: digital signatures with key extraction
- Watermarkable and zero-knowledge verifiable delay functions from any proof of exponentiation
- Timed secret sharing
- Space-deniable proofs
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)
