scientific article; zbMATH DE number 708802
From MaRDI portal
Publication:4318690
zbMath0925.94094MaRDI QIDQ4318690
Publication date: 29 August 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Security definitions on time-lock puzzles ⋮ Magnifying computing gaps. Establishing encrypted communication over unidirectional channels ⋮ Fine-grained secure computation ⋮ Improved Cryptographic Puzzle Based on Modular Exponentiation ⋮ A note on the Dwork-Naor timed deniable authentication ⋮ Proof of Space from Stacked Expanders ⋮ SoK: securing email -- a stakeholder-based analysis ⋮ Designing Proof of Human-Work Puzzles for Cryptocurrency and Beyond ⋮ Fiat-Shamir and correlation intractability from strong KDM-secure encryption ⋮ Resource allocation for restoration of compromised systems ⋮ Network-formation games with regular objectives ⋮ Who are you? Secure identities in single hop ad hoc networks ⋮ Proofs of Work from worst-case assumptions ⋮ Soft power: upgrading chain macroeconomic policy through soft forks ⋮ SoK: algorithmic incentive manipulation attacks on permissionless PoW cryptocurrencies ⋮ Query-Complexity Amplification for Random Oracles ⋮ Resource Burning for Permissionless Systems (Invited Paper) ⋮ 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) ⋮ Indistinguishable Proofs of Work or Knowledge ⋮ Algorand: a secure and efficient distributed ledger ⋮ An (Almost) Constant-Effort Solution-Verification Proof-of-Work Protocol Based on Merkle Trees ⋮ Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks ⋮ 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 ⋮ Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles ⋮ Bankrupting Sybil despite churn ⋮ Secure computation without authentication ⋮ Compact Storage of Superblocks for NIPoPoW Applications ⋮ DEVELOPING SAFE PROTOCOL FOR DISTRIBUTED TASK-BASED CTF HOLDING SYSTEM ⋮ Unnamed Item ⋮ How to build time-lock encryption ⋮ Cryptographic puzzles and DoS resilience, revisited ⋮ Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols ⋮ Continuous verifiable delay functions ⋮ Generic-group delay functions require hidden-order groups ⋮ Towards Denial-of-Service-Resilient Key Agreement Protocols ⋮ Correctness of Tendermint-Core Blockchains ⋮ Blockchain and cryptocurrencies: economic and financial research ⋮ A resource-competitive jamming defense ⋮ CArrency: an energy-efficient proof-of-work scheme for crypto-currencies ⋮ Timed-Release Encryption Revisited ⋮ Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions ⋮ Analysis of the Blockchain Protocol in Asynchronous Networks ⋮ Scrypt Is Maximally Memory-Hard
This page was built for publication:
