High Entropy Random Selection Protocols
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F07%3A00090045" target="_blank" >RIV/67985840:_____/07:00090045 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
High Entropy Random Selection Protocols
Original language description
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high entropy, even when one of the two parties is dishonest and deviates from theprotocol. We develop protocols that achieve high, close to n, entropy.
Czech name
Protokoly pro výběr náhodného řetězce s velkou entropií
Czech description
Zabýváme se otázkou výběru náhodného řetězce dvěma hráči, kteří se mohou navzájem podvádět.
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2007
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2007, and 11th International Workshop on Randomization and Computation, RANDOM 2007, RANDOM-APPROX 2007
ISBN
978-3-540-74207-4
ISSN
—
e-ISSN
—
Number of pages
14
Pages from-to
366-379
Publisher name
Springer-Verlag
Place of publication
Berlin
Event location
Princeton
Event date
Aug 20, 2007
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—