NIST · ИТ · 299c284ee336c274c6dc
Spreading alerts quietly and the subgroup escape problem
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
NIST · ИТОфициальный источник · 2015-10-01
{
"title_en": "Spreading alerts quietly and the subgroup escape problem",
"designation": "",
"series": "",
"status": "",
"date": "2015-10-01",
"date_original": "October 1, 2015",
"url": "https://www.nist.gov/publications/spreading-alerts-quietly-and-subgroup-escape-problem",
"source": "NIST Publications",
"display_en": "",
"authors_en": "J. Aspnes, Z. Diamadi, A. Yampolskiy, K. Gjosteen, Rene Peralta",
"abstract_excerpt_en": "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",
"id": "299c284ee336c274c6dc",
"sources": [
"NIST Publications"
],
"source_records": [
{
"title_en": "Spreading alerts quietly and the subgroup escape problem",
"designation": "",
"series": "",
"status": "",
"date": "2015-10-01",
"date_original": "October 1, 2015",
"url": "https://www.nist.gov/publications/spreading-alerts-quietly-and-subgroup-escape-problem",
"source": "NIST Publications",
"display_en": "",
"authors_en": "J. Aspnes, Z. Diamadi, A. Yampolskiy, K. Gjosteen, Rene Peralta",
"abstract_excerpt_en": "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"
}
],
"translation_state": "none",
"possible_title_matches": 1
}