Spreading alerts quietly and the subgroup escape problem
type: Item
instance of: scholarly article
title: Spreading alerts quietly and the subgroup escape problem
zbMATH Open document ID: 1332.94054
author: James Aspnes
author: Zoë Diamadi
author: Aleksandr Yampolskiy
author: Kristian Gjøsteen
author: René Peralta
published in: Journal of Cryptology
publication date: 2016-01-11T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6528670
zbMATH Keywords: blind coupon mechanism
zbMATH Keywords: AND-homomorphic bit commitment
zbMATH Keywords: subgroup escape problem
zbMATH Keywords: elliptic curves over composite moduli
zbMATH Keywords: anonymous communication
zbMATH Keywords: intrusion detection
Wikidata QID: Q62472212
MaRDI profile type: Publication
full work available at URL: s00145-014-9181-1
OpenAlex ID: W2153699259
cites work: Q4502505
cites work: Q4409134
cites work: Buses for anonymous message delivery
cites work: Q4265362
cites work: Noninteractive Zero-Knowledge
cites work: Theory of Cryptography
cites work: Finding composite order ordinary elliptic curves using the Cocks-Pinch method
cites work: Minimum disclosure proofs of knowledge
cites work: The dining cryptographers problem: Unconditional sender and recipient untraceability
cites work: Q4737235
cites work: Q4934742
cites work: Elliptic curve Paillier schemes
cites work: Progress in Cryptology – Mycrypt 2005
cites work: Public Key Cryptography - PKC 2005
cites work: Primality testing using elliptic curves
cites work: Probabilistic encryption
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Q4249657
cites work: Flash mixing
cites work: Q4472078
cites work: Q2739458
cites work: Q4035724
cites work: Equivalence of counting the number of points on elliptic curve over the ring Zn and factoring n
cites work: The Byzantine Generals Problem
cites work: Q4847937
cites work: Factoring integers with elliptic curves
cites work: Reducing elliptic curve logarithms to logarithms in a finite field
cites work: The Weil pairing, and its efficient calculation
cites work: Q4249647
cites work: Q4473618
cites work: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
cites work: A method for obtaining digital signatures and public-key cryptosystems
cites work: An efficient solution of the congruence&lt;tex&gt;x^2 + ky^2 = mpmod{n}&lt;/tex&gt;
cites work: Counting points on elliptic curves over finite fields
cites work: Q3710637
cites work: Computing rational points on rank 1 elliptic curves via $L$-series and canonical heights
DBLP publication ID: journals/joc/AspnesDYGP15
DOI: 10.1007/S00145-014-9181-1
Recommended article: Spreading Alerts Quietly and the Subgroup Escape Problem
Recommended article: Note on the problem of gossiping in multidimensional grids
Recommended article: The decentralized quickest detection problem
Recommended article: Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems
Recommended article: Q3750489
Recommended article: Communication-Optimal Proactive Secret Sharing for Dynamic Groups
Recommended article: Q4806292
Recommended article: On optimal solutions to the problem of gossiping in minimum time
Recommended article: Breaking the \(\log n\) barrier on rumor spreading
Recommended article: The partial gossiping problem
description: scientific article; zbMATH DE number 6528670