scientific article; zbMATH DE number 1931811
From MaRDI portal
Publication:4709170
zbMath1014.68882MaRDI QIDQ4709170
Publication date: 20 June 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2429/24290251.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Unnamed Item ⋮ Designing Proof of Human-Work Puzzles for Cryptocurrency and Beyond ⋮ SoK: communication across distributed ledgers ⋮ Instant block confirmation in the sleepy model ⋮ Maximal information propagation via lotteries ⋮ Who are you? Secure identities in single hop ad hoc networks ⋮ The design of a reliable reputation system ⋮ Building a reputation-based bootstrapping mechanism for newcomers in collaborative alert systems ⋮ Clone wars: distributed detection of clone attacks in mobile WSNs ⋮ Resource Burning for Permissionless Systems (Invited Paper) ⋮ Algorand: a secure and efficient distributed ledger ⋮ Permissionless and asynchronous asset transfer ⋮ Optimizing scrip systems: crashes, altruists, hoarders, sybils and collusion ⋮ Trust-Rated Authentication for Domain-Structured Distributed Systems ⋮ Building blocks of sharding blockchain systems: concepts, approaches, and open problems ⋮ Decentralizing information technology: the advent of resource based systems ⋮ Zero-history confidential chains with zero-knowledge contracts: a new normal for decentralized ledgers? ⋮ Deterministic secure positioning in wireless sensor networks ⋮ Bankrupting Sybil despite churn ⋮ On the establishment of distinct identities in overlay networks ⋮ Proportional scheduling, split-proofness, and merge-proofness ⋮ Promise: Leveraging Future Gains for Collateral Reduction ⋮ DENIABLE GROUP COMMUNICATIONS IN THE PRESENCE OF GLOBAL UNLIMITED ADVERSARY ⋮ Ensemble: Community-Based Anomaly Detection for Popular Applications ⋮ Self-organized Anonymous Authentication in Mobile Ad Hoc Networks ⋮ Credibility dynamics: a belief-revision-based trust model with pairwise comparisons ⋮ An ``S-string scheme for business-oriented peer-to-peer networks ⋮ Unnamed Item ⋮ Agent incentives of strategic behavior in resource exchange ⋮ Electric routing and concurrent flow cutting ⋮ Pricing traffic in a spanning network ⋮ Unnamed Item ⋮ Fair and resilient incentive tree mechanisms ⋮ Towards a scalable and robust DHT ⋮ Robust random number generation for peer-to-peer systems ⋮ Hop chains: Secure routing and the establishment of distinct identities ⋮ To catch a fake: Curbing deceptive Yelp ratings and venues ⋮ A paid message forwarding scheme based on social network ⋮ Communities, Random Walks, and Social Sybil Defense ⋮ A resource-competitive jamming defense ⋮ An improved incentive ratio of the resource sharing on cycles ⋮ The sum of its parts: analysis of federated Byzantine agreement systems ⋮ Computing a consensus trajectory in a vehicular network ⋮ Securing Ad Hoc Storage through Probabilistic Cooperation Assessment ⋮ Asynchronous reconfiguration with Byzantine failures
