Document Zbl 1127.94345 - zbMATH Open
Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.
Fields
| any | anywhere |
| an | internal document identifier |
| au | author, editor |
| ai | internal author identifier |
| ti | title |
| la | language |
| so | source |
| ab | review, abstract |
| py | publication year |
| rv | reviewer |
| cc | MSC code |
| ut | uncontrolled term |
| dt | document type (j: journal article; b: book; a: book article) |
Operators
| a & b | logic and |
| a | b | logic or |
| !ab | logic not |
| abc* | right wildcard |
| "ab c" | phrase |
| (ab c) | parentheses |
See also our General Help.
Optimistic fair exchange in a multi-user setting. (English) Zbl 1127.94345
Okamoto, Tatsuaki (ed.) et al., Public key cryptography – PKC 2007. 10th international conference on practice and theory in public-key cryptography, Beijing, China, April 16–20, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-71676-1/pbk). Lecture Notes in Computer Science 4450, 118-133 (2007).
Summary: This paper addresses the security of optimistic fair exchange in a multi-user setting. While the security of public key encryption and public key signature schemes in a single-user setting guarantees the security in a multi-user setting, we show that the situation is different in the optimistic fair exchange. First, we show how to break, in the multi-user setting, an optimistic fair exchange scheme provably secure in the single-user setting. This example separates the security of optimistic fair exchange between the single-user setting and the multi-user setting. We then define the formal security model of optimistic fair exchange in the multi-user setting, which is the first complete security model of optimistic fair exchange in the multi-user setting. We prove the existence of a generic construction meeting our multi-user security based on one-way functions in the random oracle model and trapdoor one-way permutations in the standard model. Finally, we revisit two well-known methodologies of optimistic fair exchange, which are based on the verifiably encrypted signature and the sequential two-party multisignature, respectively. Our result shows that these paradigms remain valid in the multi-user setting.
For the entire collection see [Zbl 1116.94001].
MSC:
| 94A62 | Authentication, digital signatures and secret sharing |