The following pages link to (Q4318690):
Displayed 48 items.
- Magnifying computing gaps. Establishing encrypted communication over unidirectional channels (Q290516) (← links)
- Network-formation games with regular objectives (Q342715) (← links)
- Secure computation without authentication (Q656923) (← links)
- Security definitions on time-lock puzzles (Q831622) (← links)
- A note on the Dwork-Naor timed deniable authentication (Q845814) (← links)
- Resource allocation for restoration of compromised systems (Q857779) (← links)
- Fine-grained secure computation (Q1631318) (← links)
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
- Proofs of Work from worst-case assumptions (Q1673424) (← links)
- How to build time-lock encryption (Q1791669) (← links)
- Continuous verifiable delay functions (Q2055650) (← links)
- Generic-group delay functions require hidden-order groups (Q2055651) (← links)
- Blockchain and cryptocurrencies: economic and financial research (Q2064599) (← links)
- A resource-competitive jamming defense (Q2075623) (← links)
- CArrency: an energy-efficient proof-of-work scheme for crypto-currencies (Q2079889) (← links)
- Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions (Q2102077) (← links)
- SoK: securing email -- a stakeholder-based analysis (Q2145401) (← links)
- Who are you? Secure identities in single hop ad hoc networks (Q2407629) (← links)
- Algorand: a secure and efficient distributed ledger (Q2422025) (← links)
- Cryptographic puzzles and DoS resilience, revisited (Q2510662) (← links)
- Soft power: upgrading chain macroeconomic policy through soft forks (Q2670864) (← links)
- SoK: algorithmic incentive manipulation attacks on permissionless PoW cryptocurrencies (Q2670873) (← links)
- Bankrupting Sybil despite churn (Q2698290) (← links)
- Query-Complexity Amplification for Random Oracles (Q2947529) (← links)
- Indistinguishable Proofs of Work or Knowledge (Q2953800) (← links)
- Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks (Q2958121) (← links)
- Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols (Q3073713) (← links)
- Proof of Space from Stacked Expanders (Q3179360) (← links)
- Designing Proof of Human-Work Puzzles for Cryptocurrency and Beyond (Q3181039) (← links)
- Compact Storage of Superblocks for NIPoPoW Applications (Q3294784) (← links)
- Improved Cryptographic Puzzle Based on Modular Exponentiation (Q3449412) (← links)
- An (Almost) Constant-Effort Solution-Verification Proof-of-Work Protocol Based on Merkle Trees (Q3506372) (← links)
- Towards Denial-of-Service-Resilient Key Agreement Protocols (Q3634508) (← links)
- Correctness of Tendermint-Core Blockchains (Q5091090) (← links)
- (Q5091091) (← links)
- Resource Burning for Permissionless Systems (Invited Paper) (Q5100943) (← links)
- Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles (Q5117380) (← links)
- DEVELOPING SAFE PROTOCOL FOR DISTRIBUTED TASK-BASED CTF HOLDING SYSTEM (Q5150688) (← links)
- Analysis of the Blockchain Protocol in Asynchronous Networks (Q5267421) (← links)
- Scrypt Is Maximally Memory-Hard (Q5270357) (← links)
- Timed-Release Encryption Revisited (Q5505456) (← links)
- Permissionless consensus in the resource model (Q6045237) (← links)
- An incremental PoSW for general weight distributions (Q6061362) (← links)
- Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting) (Q6067351) (← links)
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes (Q6134808) (← links)
- Short-lived zero-knowledge proofs and signatures (Q6135445) (← links)
- Non-interactive universal arguments (Q6145782) (← links)
- Completeness theorems for adaptively secure broadcast (Q6186585) (← links)