Space-deniable proofs
From MaRDI portal
Cites work
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- Asymptotically tight bounds on time-space trade-offs in a pebble game
- Bandwidth hard functions for ASIC resistance
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- Fixing cracks in the concrete: random oracles with auxiliary input, revisited
- High Parallel Complexity Graphs and Memory-Hard Functions
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 708820 (Why is no real title available?)
- scientific article; zbMATH DE number 1406779 (Why is no real title available?)
- Indistinguishable proofs of work or knowledge
- Memory-tight reductions
- On the complexity of \textsf{scrypt} and proofs of space in the parallel random oracle model
- Pebbling and Proofs of Work
- Proof of space from stacked expanders
- Proofs of Catalytic Space
- Proofs of space
- Proofs of space: when space is of the essence
- Scrypt is maximally memory-hard
- Short-lived zero-knowledge proofs and signatures
- Space-lock puzzles and verifiable space-hard functions from root-finding in sparse polynomials
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
- The local forking lemma and its application to deterministic encryption
- Tight proofs of space and replication
- Trapdoor memory-hard functions
This page was built for publication: Space-deniable proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233230)
