Spreading Alerts Quietly and the Subgroup Escape Problem

DOI10.1007/11593447_14zbMATH Open1154.94369DBLPconf/asiacrypt/AspnesDGPY05OpenAlexW1506940115WikidataQ62472226 ScholiaQ62472226MaRDI QIDQ5451074FDOQ5451074

Authors: James Aspnes, Zoë Diamadi, Kristian Gjøsteen, René Peralta, Aleksandr Yampolskiy 

Publication date: 18 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11593447_14

Recommendations

• Spreading alerts quietly and the subgroup escape problem
• Note on the problem of gossiping in multidimensional grids
• The decentralized quickest detection problem
• Sending secrets swiftly: approximation algorithms for generalized multicast problems
• scientific article; zbMATH DE number 3987023
• Communication-optimal proactive secret sharing for dynamic groups
• scientific article; zbMATH DE number 1910393
• On optimal solutions to the problem of gossiping in minimum time
• Breaking the \(\log n\) barrier on rumor spreading
• The partial gossiping problem

zbMATH Keywords

AND-homomorphic Bit CommitmentAnonymous CommunicationBlind Coupon MechanismElliptic Curves Over Composite ModuliSubgroup Escape Problem

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Cited In (3)

• Spreading alerts quietly and the subgroup escape problem
• A blind coupon mechanism enabling veto voting over unreliable networks
• Privacy in population protocols with probabilistic scheduling

This page was built for publication: Spreading Alerts Quietly and the Subgroup Escape Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451074)