Publication:4709170
From MaRDI portal
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
Related Items
Unnamed Item, Unnamed Item, To catch a fake: Curbing deceptive Yelp ratings and venues, Communities, Random Walks, and Social Sybil Defense, Resource Burning for Permissionless Systems (Invited Paper), Promise: Leveraging Future Gains for Collateral Reduction, DENIABLE GROUP COMMUNICATIONS IN THE PRESENCE OF GLOBAL UNLIMITED ADVERSARY, Agent incentives of strategic behavior in resource exchange, Fair and resilient incentive tree mechanisms, Permissionless and asynchronous asset transfer, 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?, Building a reputation-based bootstrapping mechanism for newcomers in collaborative alert systems, Clone wars: distributed detection of clone attacks in mobile WSNs, Electric routing and concurrent flow cutting, The design of a reliable reputation system, Deterministic secure positioning in wireless sensor networks, Towards a scalable and robust DHT, Proportional scheduling, split-proofness, and merge-proofness, Robust random number generation for peer-to-peer systems, Hop chains: Secure routing and the establishment of distinct identities, Optimizing scrip systems: crashes, altruists, hoarders, sybils and collusion, On the establishment of distinct identities in overlay networks, Pricing traffic in a spanning network, A paid message forwarding scheme based on social network, A resource-competitive jamming defense, The sum of its parts: analysis of federated Byzantine agreement systems, Computing a consensus trajectory in a vehicular network, Asynchronous reconfiguration with Byzantine failures, SoK: communication across distributed ledgers, Instant block confirmation in the sleepy model, Maximal information propagation via lotteries, Credibility dynamics: a belief-revision-based trust model with pairwise comparisons, An improved incentive ratio of the resource sharing on cycles, Who are you? Secure identities in single hop ad hoc networks, Algorand: a secure and efficient distributed ledger, An ``S-string scheme for business-oriented peer-to-peer networks, Bankrupting Sybil despite churn, Securing Ad Hoc Storage through Probabilistic Cooperation Assessment, Unnamed Item, Designing Proof of Human-Work Puzzles for Cryptocurrency and Beyond, Trust-Rated Authentication for Domain-Structured Distributed Systems, Ensemble: Community-Based Anomaly Detection for Popular Applications, Self-organized Anonymous Authentication in Mobile Ad Hoc Networks
