Short Unique Signatures from RSA with a Tight Security Reduction (in the Random Oracle Model)
| Autor: | Hovav Shacham |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
0209 industrial biotechnology
Reduction (recursion theory) Theoretical computer science Logarithm Computer science business.industry Hash function TheoryofComputation_GENERAL 020206 networking & telecommunications 02 engineering and technology Adversary Signature (logic) Oracle Random oracle Public-key cryptography 020901 industrial engineering & automation 0202 electrical engineering electronic engineering information engineering business |
| Zdroj: | Financial Cryptography and Data Security ISBN: 9783662583869 Financial Cryptography |
| DOI: | 10.1007/978-3-662-58387-6_4 |
| Popis: | A signature scheme is unique if for every public key and message there is only one signature that is accepted as valid by the verification algorithm. At Crypto 2017, Guo, Chen, Susilo, Lai, Yang, and Mu gave a unique signature scheme whose security proof incurred a security loss logarithmic in the number of hash oracle queries made by the adversary, bypassing an argument due to Bader, Jager, Li, and Schage that the security loss must be at least linear in the number of signing oracle queries made by the adversary. Unfortunately, the number of elements in a Guo et al. signature is also logarithmic in the number of hash oracle queries made by the adversary. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|