Efficient and decentralized polling protocol for general social networks
DOI10.1007/978-3-319-21741-3_12zbMATH Open1428.68146OpenAlexW2283427202MaRDI QIDQ5207912FDOQ5207912
Authors: Bao-Thien Hoang, Abdessamad Imine 
Publication date: 14 January 2020
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-21741-3_12
Recommendations
Social networks; opinion dynamics (91D30) Authentication, digital signatures and secret sharing (94A62) Network protocols (68M12) Privacy of data (68P27)
Cites Work
- Optimal distributed all pairs shortest paths and applications
- How to share a secret
- Distributed algorithms for network diameter and girth
- The Byzantine Generals Problem
- Multi-authority secret-ballot elections with linear work
- Scalable and Unconditionally Secure Multiparty Computation
- E-voting without `cryptography' (extended abstract)
- A distributed protocol for privacy preserving aggregation with non-permanent participants
- Decentralized polling with respectable participants
- Computing in social networks
- Title not available (Why is that?)
- Partitioned encryption and achieving simultaneity by partitioning
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Title not available (Why is that?)
- Decentralized Polling with Respectable Participants
- Efficient and decentralized polling protocol for general social networks
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)
