scientific article; zbMATH DE number 708802
From MaRDI portal
Publication:4318690
Recommendations
Cited in
(73)- Fine-grained secure computation
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Proofs of Work from worst-case assumptions
- How to build time-lock encryption
- Continuous verifiable delay functions
- Generic-group delay functions require hidden-order groups
- Blockchain and cryptocurrencies: economic and financial research
- A resource-competitive jamming defense
- CArrency: an energy-efficient proof-of-work scheme for crypto-currencies
- Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
- SoK: securing email -- a stakeholder-based analysis
- Who are you? Secure identities in single hop ad hoc networks
- Algorand: a secure and efficient distributed ledger
- Cryptographic puzzles and DoS resilience, revisited
- Soft power: upgrading chain macroeconomic policy through soft forks
- SoK: algorithmic incentive manipulation attacks on permissionless PoW cryptocurrencies
- Bankrupting Sybil despite churn
- Magnifying computing gaps. Establishing encrypted communication over unidirectional channels
- Query-complexity amplification for random oracles
- Indistinguishable proofs of work or knowledge
- Balloon hashing: a memory-hard function providing provable protection against sequential attacks
- Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols
- Proof of space from stacked expanders
- Designing proof of human-work puzzles for cryptocurrency and beyond
- Compact Storage of Superblocks for NIPoPoW Applications
- Network-formation games with regular objectives
- Improved cryptographic puzzle based on~modular exponentiation
- An (Almost) Constant-Effort Solution-Verification Proof-of-Work Protocol Based on Merkle Trees
- Towards Denial-of-Service-Resilient Key Agreement Protocols
- scientific article; zbMATH DE number 708799 (Why is no real title available?)
- scientific article; zbMATH DE number 1759350 (Why is no real title available?)
- Correctness of Tendermint-Core Blockchains
- Federated Byzantine quorum systems
- Resource Burning for Permissionless Systems (Invited Paper)
- Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
- DEVELOPING SAFE PROTOCOL FOR DISTRIBUTED TASK-BASED CTF HOLDING SYSTEM
- Analysis of the Blockchain Protocol in Asynchronous Networks
- Scrypt is maximally memory-hard
- Timed-Release Encryption Revisited
- Permissionless consensus in the resource model
- An incremental PoSW for general weight distributions
- Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting)
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes
- Short-lived zero-knowledge proofs and signatures
- Non-interactive universal arguments
- Completeness theorems for adaptively secure broadcast
- Bandwidth-Hard Functions: Reductions and Lower Bounds
- Secure computation without authentication
- The superlinearity problem in post-quantum blockchains
- Defending hash tables from algorithmic complexity attacks with resource burning
- PURED: a unified framework for resource-hard functions
- Ordering transactions with bounded unfairness: definitions, complexity and constructions
- Trapdoor memory-hard functions
- Towards permissionless consensus in the standard model via fine-grained complexity
- Cryptanalysis of lattice-based sequentiality assumptions and proofs of sequential work
- Round efficient Byzantine agreement from VDFs
- Can verifiable delay functions be based on random oracles?
- Breaking verifiable delay functions in the random oracle model
- State machine replication among strangers, fast and self-sufficient
- Towards a white-box secure Fiat-Shamir transformation
- Good things come to those who wait. Dishonest-majority coin-flipping requires delay functions
- Malleable SNARKs and their applications
- BTLE: atomic swaps with time-lock puzzles
- The bitcoin backbone protocol: analysis and applications
- Profit lag and alternate network mining
- Provably memory-hard proofs of work with memory-easy verification
- Bankrupting DoS attackers
- Fair multiparty coin tossing from minimal assumptions
- Correctness and fairness of committee-based blockchains: a case study of Tendermint's repeated consensus
- A tight lower bound on the \textsc{TdScrypt} trapdoor memory-hard function
- Security definitions on time-lock puzzles
- A note on the Dwork-Naor timed deniable authentication
- Resource allocation for restoration of compromised systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4318690)
