Zobrazeno 1 - 10
of 43
pro vyhledávání: '"Jacek Pomykała"'
Publikováno v:
Journal of Telecommunications and Information Technology, Iss 1 (2023)
The work presents a new signature scheme, called the multi-threshold signature, which generalizes the concept of multisignature and threshold signature. This scheme protects the anonymity of signers in a way the group signature does – in exceptiona
Externí odkaz:
https://doaj.org/article/64beb857932c4d02a608c2ffbfffefde
Autor:
Jacek Pomykała
Publikováno v:
Journal of Telecommunications and Information Technology, Iss 4 (2023)
n the paper the ID-based digital signatures with signer’s protection in case of the private key compromising is investigated. The proposed protocols have two main ingredients. First is the application of the credential system for the suitable verif
Externí odkaz:
https://doaj.org/article/276efe279b4041728c0662fcb0ab17e4
Autor:
Bartosz Nakielski, Jacek Pomykała
Publikováno v:
Journal of Telecommunications and Information Technology, Iss 2 (2023)
In the paper we present a simple threshold decryption system based on the RSA cryptosystem. Our model avoids the application of the Shamir secret sharing protocol and is based only on the Chinese reminder theorem. The flexibility in the threshold lev
Externí odkaz:
https://doaj.org/article/4ff9c1fd2fe847bdadddbc822e43b9e4
Publikováno v:
International Journal of Electronics and Telecommunications, Vol vol. 67, Iss No 2, Pp 201-205 (2021)
We propose the proxy threshold signature scheme with the application of elegant construction of verifiable delegating key in the ID-based infrastructure, and also with the bilinear pairings. The protocol satisfies the classical security requirements
Externí odkaz:
https://doaj.org/article/b3a90df4619d4116892009f31766c1e1
Publikováno v:
The Ramanujan Journal. 60:505-516
Autor:
Andrzej Dąbrowski, Jacek Pomykała
Publikováno v:
Journal of Number Theory. 220:94-106
We prove a lower bound for the number of conductors q ≤ Q with q ≡ 1 ( mod r ) having t prime divisors of Dirichlet characters χ of fixed order r and with given values χ ( p ) for primes p ≤ B . We also give an elliptic curve variant of this
Autor:
Antoine Joux, Jacek Pomykała
Publikováno v:
Journal of Mathematical Cryptology, Vol 14, Iss 1, Pp 393-396 (2020)
Number-Theoretic Methods in Cryptology (NutMiC) is a bi-annual series of conferences that waslaunched in 2017. Its goal is to spur collaborations between cryptographers and number-theorists and to encourage progress on the number-theoretic hard probl
Autor:
Maciej Radziejewski, Jacek Pomykała
Publikováno v:
Journal of Mathematical Cryptology, Vol 14, Iss 1, Pp 346-358 (2020)
We describe a reduction of the problem of factorization of integers n ≤ x in polynomial-time (log x)M+O(1) to computing Euler’s totient function, with exceptions of at most xO(1/M) composite integers that cannot be factored at all, and at most x
Autor:
Markus Hittmeir, Jacek Pomykała
Publikováno v:
Fundamenta Informaticae. 172:39-51
Autor:
Jacek Pomykała, Robert Dryło
Publikováno v:
Colloquium Mathematicum. 159:259-284