Temat: public-key cryptography - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Multi-threshold signature
Autorzy:: Nakielski, B.
Pomykała, J.
Pomykała, J. A.
Powiązania:: https://bibliotekanauki.pl/articles/308529.pdf
Data publikacji:: 2008
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: public key cryptography
threshold signature
multisignature
secret sharing
Opis:: 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 exceptional circumstances the identities of signers may be revealed. Due to the new party - completer, in our scheme the threshold size may vary together with the message to be signed. The presented scheme is based on the RSA signature standard, however other signature standards might be applied to it as well.
Źródło:: Journal of Telecommunications and Information Technology; 2008, 1; 51-55
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Asymmetric cryptography and practical security
Autorzy:: Pointcheval, D.
Powiązania:: https://bibliotekanauki.pl/articles/309405.pdf
Data publikacji:: 2002
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: kryptografia
podpis cyfrowy
kryptografia asymetryczna
bezpieczeństwo
cryptography
digital signature
public-key encryption
provable security
random oracle model
Opis:: Since the appearance of public-key cryptography in Diffie-Hellman seminal paper, many schemes have been proposed, but many have been broken. Indeed, for many people, the simple fact that a cryptographic algorithm withstands cryptanalytic attacks for several years is considered as a kind of validation. But some schemes took a long time before being widely studied, and maybe thereafter being broken. A much more convincing line of research has tried to provide "provable" security for cryptographic protocols, in a complexity theory sense: if one can break the cryptographic protocol, one can efficiently solve the underlying problem. Unfortunately, very few practical schemes can be proven in this so-called "standard model" because such a security level rarely meets with efficiency. A convenient but recent way to achieve some kind of validation of efficient schemes has been to identify some concrete cryptographic objects with ideal random ones: hash functions are considered as behaving like random functions, in the so-called "random oracle model", block ciphers are assumed to provide perfectly independent and random permutations for each key in the "ideal cipher model", and groups are used as black-box groups in the "generic model". In this paper, we focus on practical asymmetric protocols together with their "reductionist" security proofs. We cover the two main goals that public-key cryptography is devoted to solve: authentication with digital signatures, and confidentiality with public-key encryption schemes.
Źródło:: Journal of Telecommunications and Information Technology; 2002, 4; 41-56
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "public-key cryptography" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język