Document Zbl 1308.94102 - 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.
A short non-delegatable strong designated verifier signature. (English) Zbl 1308.94102
Susilo, Willy (ed.) et al., Information security and privacy. 17th Australasian conference, ACISP 2012, Wollongong, NSW, Australia, July 9–11, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31447-6/pbk). Lecture Notes in Computer Science 7372, 261-279 (2012).
Summary: We propose a non-delegatable strong designated verifier signature (SDVS) featured by a two-element signature. Comparatively, current SDVS schemes without delegatability produce at least three-element signatures. The SDVS scheme provably satisfies the unforgeability property under a computational Diffie-Hellman (CDH) problem. Its non-delegatability holds conditioned on a knowledge extraction assumption (KEA). Its privacy of signer’s identity (PSI) is reduced to the hardness of a variant of CDH problem. The construction method utilizes a combination of a KEA-based identification protocol, an OR proof technique, and a Fiat-Shamir heuristic.
For the entire collection see [Zbl 1245.94010].
MSC:
| 94A62 | Authentication, digital signatures and secret sharing |