Efficient and decentralized polling protocol for general social networks
From MaRDI portal
Publication:5207912
Recommendations
Cites work
- scientific article; zbMATH DE number 4039795 (Why is no real title available?)
- scientific article; zbMATH DE number 2088318 (Why is no real title available?)
- A distributed protocol for privacy preserving aggregation with non-permanent participants
- Computing in social networks
- Decentralized Polling with Respectable Participants
- Decentralized polling with respectable participants
- Distributed algorithms for network diameter and girth
- E-voting without `cryptography' (extended abstract)
- Efficient and decentralized polling protocol for general social networks
- How to share a secret
- Multi-authority secret-ballot elections with linear work
- Optimal distributed all pairs shortest paths and applications
- Partitioned encryption and achieving simultaneity by partitioning
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Scalable and Unconditionally Secure Multiparty Computation
- The Byzantine Generals Problem
Cited in
(6)- Decentralized Polling with Respectable Participants
- A privacy-aware protocol for sociometric questionnaires
- Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol
- Public verification of private effort
- Decentralized polling with respectable participants
- Efficient and decentralized polling protocol for general social networks
This page was built for publication: Efficient and decentralized polling protocol for general social networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207912)