Spreading alerts quietly and the subgroup escape problem

Published

October 1, 2015

Author(s)

J. Aspnes, Z. Diamadi, A. Yampolskiy, K. Gjosteen, Rene Peralta

Abstract

We introduce a new cryptographic primitive called a blind coupon mechanism (BCM). In effect, a BCM is an authenticated bit commitment scheme, which is AND-homomorphic. We show that a BCM has natural and important applications. In particular, we use it to construct a mechanism for transmitting alerts undetectably in a message-passing system of n nodes. Our algorithms allow an alert to quickly propagate to all nodes without its source or existence being detected by an adversary, who controls all message traffic. Our proofs of security are based on a new subgroup escape problem, which seems hard on certain groups with bilinear pairings and on elliptic curves over the ring Zn.

Citation

Journal of Cryptology

Volume

28

Issue

4

Pub Type

Journals

Download Paper

https://doi.org/10.1007/s00145-014-9181-1

Local Download

Keywords

Blind Coupon Mechanism, AND-Homomorphic Bit Commitment, Subgroup Escape Problem, Elliptic Curves Over Composite Moduli, Anonymous Communication, Intrusion Detection

Citation

Aspnes, J. , Diamadi, Z. , Yampolskiy, A. , Gjosteen, K. and Peralta, R. (2015), Spreading alerts quietly and the subgroup escape problem, Journal of Cryptology, [online], https://doi.org/10.1007/s00145-014-9181-1, https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=152185 (Accessed April 26, 2024)