Public keys for e-coins: partially solved problem using signature with rerandomizable keys
Prikladnaya Diskretnaya Matematika. Supplement, no. 16 (2023), pp. 110-114.

Voir la notice de l'article provenant de la source Math-Net.Ru

We give an example of an existing cryptographic mechanism that can be considered as a partial solution to the problem “Public keys for e-coins” proposed at the International Olympiad in Cryptography NSUCRYPTO'2022. This mechanism is used with the class of signatures with rerandomizable keys and provides one of the two security properties required by the authors of the problem. The results of this paper contain a systematic description of security models that can be used to analyze signature with rerandomizable keys, which is of independent interest.
Keywords: public key derivation, signature with rerandomizable keys, related key attack, BIP32
Mots-clés : NSUCRYPTO.
@article{PDMA_2023_16_a27,
     author = {A. A. Babueva and S. N. Kyazhin},
     title = {Public keys for e-coins: partially solved problem using signature with rerandomizable keys},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {110--114},
     publisher = {mathdoc},
     number = {16},
     year = {2023},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2023_16_a27/}
}
TY  - JOUR
AU  - A. A. Babueva
AU  - S. N. Kyazhin
TI  - Public keys for e-coins: partially solved problem using signature with rerandomizable keys
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2023
SP  - 110
EP  - 114
IS  - 16
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDMA_2023_16_a27/
LA  - en
ID  - PDMA_2023_16_a27
ER  - 
%0 Journal Article
%A A. A. Babueva
%A S. N. Kyazhin
%T Public keys for e-coins: partially solved problem using signature with rerandomizable keys
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2023
%P 110-114
%N 16
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDMA_2023_16_a27/
%G en
%F PDMA_2023_16_a27
A. A. Babueva; S. N. Kyazhin. Public keys for e-coins: partially solved problem using signature with rerandomizable keys. Prikladnaya Diskretnaya Matematika. Supplement, no. 16 (2023), pp. 110-114. http://geodesic.mathdoc.fr/item/PDMA_2023_16_a27/

[1] “Problem 10. “Public keys for e-coins””, International Olympiad in Cryptography NSUCRYPTO'2022 https://nsucrypto.nsu.ru/archive/2022/round/2/section/0/task/10/

[2] Bellare M., Cash D., and Miller R., “Cryptography secure against related-key attacks and tampering”, LNCS, 7073, 2011, 486–503 | MR | Zbl

[3] FIPS 186-5. Digital Signature Standard https://csrc.nist.gov/publications/detail/fips/186/5/final

[4] BIP 32. Hierarchical Deterministic Wallets https://github.com/bitcoin/bips/blob/master/bip-0032.mediawiki

[5] Das P., Faust S., and Loss J., “A formal treatment of deterministic wallets.”, Proc. ACM SIGSAC Conf. CCS'19, ACM, N.Y., 2019, 651–668 | DOI

[6] Fleischhacker N., Krupp J., Malavolta G., et al., “Efficient unlinkable sanitizable signatures from signatures with re-randomizable keys”, LNCS, 9614, 2016, 310–330 | MR

[7] Yuen Y. H. and Yiu S. M., “Strong known related-key attacks and the security of ECDSA”, LNCS, 11928, 2019, 130–145

[8] Morita H., Schuldt J. C. N., Matsuda T., et al., “On the security of the Schnorr signature scheme and DSA against related-key attacks”, LNCS, 9558, 2016, 20–35 | MR | Zbl

[9] Bellare M., Canetti R., and Krawczyk H., “Keying hash functions for message authentication”, LNCS, 1109, 1996, 1–15 | MR | Zbl