Efficient and Decentralized Polling Protocol for General Social Networks
From MaRDI portal
Publication:5207912
DOI10.1007/978-3-319-21741-3_12zbMath1428.68146OpenAlexW2283427202MaRDI QIDQ5207912
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
Social networks; opinion dynamics (91D30) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62) Privacy of data (68P27)
Related Items (1)
Cites Work
- A distributed protocol for privacy preserving aggregation with non-permanent participants
- Decentralized polling with respectable participants
- Partitioned encryption and achieving simultaneity by partitioning
- Computing in social networks
- Multi-Authority Secret-Ballot Elections with Linear Work
- Optimal distributed all pairs shortest paths and applications
- E-voting without ‘Cryptography’
- How to share a secret
- Distributed Algorithms for Network Diameter and Girth
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Scalable and Unconditionally Secure Multiparty Computation
- Decentralized Polling with Respectable Participants
- The Byzantine Generals Problem
- Efficient and Decentralized Polling Protocol for General Social Networks
- Unnamed Item
- Unnamed Item
This page was built for publication: Efficient and Decentralized Polling Protocol for General Social Networks
