Suchergebnisse
Filter
Format
Medientyp
Sprache
Weitere Sprachen
Jahre
2028 Ergebnisse
Sortierung:
COIN
In: The Yale review, Band 104, Heft 1, S. 85-85
ISSN: 1467-9736
Beyond coin
In: The American interest: policy, politics & culture, Band 9, Heft 1, S. 5-11
ISSN: 1556-5777
World Affairs Online
COIN Perspectives
In: Marine corps gazette: the Marine Corps Association newsletter, Band 93, Heft 4
ISSN: 0025-3170
Two Coins
In: Feminist studies: FS, Band 32, Heft 1, S. 82
ISSN: 2153-3873
ZIMBABWE: New Coins
In: Africa research bulletin. Economic, financial and technical series, Band 56, Heft 10
ISSN: 1467-6346
Coins of the Realm
In: World policy journal: WPJ ; a publication of the World Policy Institute, Band 31, Heft 2, S. 8-11
ISSN: 0740-2775
The Imperial Coin
In: Peace & change: PC ; a journal of peace research, Band 35, Heft 1, S. 146-163
ISSN: 1468-0130
Leakage-resilient coin tossing
Proceedings 25th International Symposium, DISC 2011, Rome, Italy, September 20-22, 2011. ; The ability to collectively toss a common coin among n parties in the presence of faults is an important primitive in the arsenal of randomized distributed protocols. In the case of dishonest majority, it was shown to be impossible to achieve less than 1 r bias in O(r) rounds (Cleve STOC '86). In the case of honest majority, in contrast, unconditionally secure O(1)-round protocols for generating common unbiased coins follow from general completeness theorems on multi-party secure protocols in the secure channels model (e.g., BGW, CCD STOC '88). However, in the O(1)-round protocols with honest majority, parties generate and hold secret values which are assumed to be perfectly hidden from malicious parties: an assumption which is crucial to proving the resulting common coin is unbiased. This assumption unfortunately does not seem to hold in practice, as attackers can launch side-channel attacks on the local state of honest parties and leak information on their secrets. In this work, we present an O(1)-round protocol for collectively generating an unbiased common coin, in the presence of leakage on the local state of the honest parties. We tolerate t ≤ ( 1 3 − )n computationallyunbounded Byzantine faults and in addition a Ω(1)-fraction leakage on each (honest) party's secret state. Our results hold in the memory leakage model (of Akavia, Goldwasser, Vaikuntanathan '08) adapted to the distributed setting. Additional contributions of our work are the tools we introduce to achieve the collective coin toss: a procedure for disjoint committee election, and leakage-resilient verifiable secret sharing. ; National Defense Science and Engineering Graduate Fellowship ; National Science Foundation (U.S.) (CCF-1018064)
BASE
The Heroes of COIN
In: Orbis: FPRI's journal of world affairs, Band 56, Heft 2, S. 215-232
ISSN: 0030-4387
Compressing Politics in Counterinsurgency (COIN): Implications for COIN Theory from India's Northeast
In: Strategic analysis: a monthly journal of the IDSA, Band 41, Heft 5, S. 447-463
ISSN: 1754-0054
Compressing politics in counterinsurgency (COIN): implications for COIN theory from India's northeast
In: Strategic analysis: articles on current developments, Band 41, Heft 5, S. 447-463
ISSN: 0970-0161
World Affairs Online
ZIMBABWE: Gold Coin Issue
In: Africa research bulletin. Economic, financial and technical series, Band 59, Heft 7
ISSN: 1467-6346
Coins of the Realm
In: World policy journal: WPJ, Band 31, Heft 2, S. 8-11
ISSN: 1936-0924
The heroes of COIN
In: Orbis: FPRI's journal of world affairs, Band 56, Heft 2, S. 215-232
ISSN: 0030-4387
World Affairs Online