The following pages link to (Q4709170):
Displayed 45 items.
- Building a reputation-based bootstrapping mechanism for newcomers in collaborative alert systems (Q389381) (← links)
- Clone wars: distributed detection of clone attacks in mobile WSNs (Q389398) (← links)
- Electric routing and concurrent flow cutting (Q553348) (← links)
- The design of a reliable reputation system (Q609014) (← links)
- Deterministic secure positioning in wireless sensor networks (Q638507) (← links)
- Towards a scalable and robust DHT (Q733718) (← links)
- Proportional scheduling, split-proofness, and merge-proofness (Q932808) (← links)
- Robust random number generation for peer-to-peer systems (Q1004308) (← links)
- Hop chains: Secure routing and the establishment of distinct identities (Q1004311) (← links)
- Optimizing scrip systems: crashes, altruists, hoarders, sybils and collusion (Q1938377) (← links)
- On the establishment of distinct identities in overlay networks (Q1954205) (← links)
- Pricing traffic in a spanning network (Q2016252) (← links)
- A paid message forwarding scheme based on social network (Q2057144) (← links)
- A resource-competitive jamming defense (Q2075623) (← links)
- The sum of its parts: analysis of federated Byzantine agreement systems (Q2084977) (← links)
- Computing a consensus trajectory in a vehicular network (Q2091112) (← links)
- Asynchronous reconfiguration with Byzantine failures (Q2104034) (← links)
- SoK: communication across distributed ledgers (Q2147221) (← links)
- Instant block confirmation in the sleepy model (Q2147229) (← links)
- Maximal information propagation via lotteries (Q2152141) (← links)
- Credibility dynamics: a belief-revision-based trust model with pairwise comparisons (Q2238617) (← links)
- An improved incentive ratio of the resource sharing on cycles (Q2326077) (← links)
- Who are you? Secure identities in single hop ad hoc networks (Q2407629) (← links)
- Algorand: a secure and efficient distributed ledger (Q2422025) (← links)
- An ``S-string'' scheme for business-oriented peer-to-peer networks (Q2466390) (← links)
- Bankrupting Sybil despite churn (Q2698290) (← links)
- Securing Ad Hoc Storage through Probabilistic Cooperation Assessment (Q2864365) (← links)
- Designing Proof of Human-Work Puzzles for Cryptocurrency and Beyond (Q3181039) (← links)
- (Q3300830) (← links)
- Trust-Rated Authentication for Domain-Structured Distributed Systems (Q3506351) (← links)
- Ensemble: Community-Based Anomaly Detection for Popular Applications (Q3556620) (← links)
- Self-organized Anonymous Authentication in Mobile Ad Hoc Networks (Q3556628) (← links)
- To catch a fake: Curbing deceptive Yelp ratings and venues (Q4970003) (← links)
- Communities, Random Walks, and Social Sybil Defense (Q4985360) (← links)
- (Q5053169) (← links)
- (Q5090894) (← links)
- Resource Burning for Permissionless Systems (Invited Paper) (Q5100943) (← links)
- Promise: Leveraging Future Gains for Collateral Reduction (Q5147171) (← links)
- DENIABLE GROUP COMMUNICATIONS IN THE PRESENCE OF GLOBAL UNLIMITED ADVERSARY (Q5151218) (← links)
- Agent incentives of strategic behavior in resource exchange (Q5920216) (← links)
- Fair and resilient incentive tree mechanisms (Q5964895) (← links)
- Permissionless and asynchronous asset transfer (Q6096037) (← links)
- Building blocks of sharding blockchain systems: concepts, approaches, and open problems (Q6158770) (← links)
- Decentralizing information technology: the advent of resource based systems (Q6164495) (← links)
- Zero-history confidential chains with zero-knowledge contracts: a new normal for decentralized ledgers? (Q6173284) (← links)