Spreading Alerts Quietly and the Subgroup Escape Problem

DOI10.1007/11593447_14zbMath1154.94369DBLPconf/asiacrypt/AspnesDGPY05OpenAlexW1506940115WikidataQ62472226 ScholiaQ62472226MaRDI QIDQ5451074

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items (1)

A blind coupon mechanism enabling veto voting over unreliable networks

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