Results 201 to 210 of about 34,573 (257)

Visually meaningful image encryption using convolution neural networks. [PDF]

Sci Rep
Himthani V, Hemrajani P, Kumar A.
europepmc   +1 more source

Accelerated Multisecret Sharing Scheme Using Fast Matrix Spectral Factorization. [PDF]

Entropy (Basel)
Çalkavur S, Solé P, Ephremidze L.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Covert secret key generation

2017 IEEE Conference on Communications and Network Security (CNS), 2017
We investigate the possibility of covert and secret key generation over a discrete memoryless channel model with one way public discussion. Protocols are required to conceal not only the key but also whether a protocol is being implemented. For some models, we show that covert secret key generation is possible and characterize the covert secret key ...
Mehrdad Tahmasbi, Matthieu R. Bloch
openaire   +1 more source

Multiterminal Secret Key Agreement

IEEE Transactions on Information Theory, 2014
The problem of secret key agreement by public discussion is studied under a general multiterminal network, where each user can both send and receive over a private channel. Single-letter upper and lower bounds are for the maximum achievable key rate. The bounds are shown to match for a large class of private channels.
Chung Chan, Lizhong Zheng
openaire   +1 more source

How to exchange (secret) keys

ACM Transactions on Computer Systems, 1983
A protocol is presented whereby two adversaries may exchange secrets, though neither trusts the other. The secrets are the prime factors of their publicly announced composite numbers. The two adversaries can exchange their secrets bit by bit, but each fears the other will cheat by sending “junk”bits.
openaire   +1 more source

Management of Secret Keys: Dynamic Key Handling

1998
In this paper we describe mechanisms for the management of secret keys, used in the securization of financial applications. The mechanisms Dynamic Key Handling and Reversed Dynamic Key Handling can be seen as particular methods to diversify keys in time, compatible with the present diversification by terminal and/or electronic purse.
openaire   +1 more source

Agreement of a restricted secret key

2012 IEEE International Symposium on Information Theory Proceedings, 2012
A secret key agreement problem is proposed with the additional restriction that the key is a function of a given secret source. An inner bound to the achievable rates, error and secrecy exponents is derived. The maximum key rate strongly achievable with positive exponents is characterized. The result leads to class of admissible restrictions on the key
openaire   +1 more source

On the Use of RSA as a Secret Key Cryptosystem

Designs, Codes and Cryptography, 2001
Typically, symmetric and public key cryptosystems are based on different algorithms that use different functions. As sometimes some restrictions on computing area and memory apply (e.g. smart cards), an interesting task is to investigate the possibility to have the different cryptosystems make use of the same cryptographic primitives in their ...
openaire   +2 more sources

Secret-key exchange with authentication

1993
This paper provides an outline for the second lecture on authentication protocols and deals with secret-key exchange protocols. The object is to encourage the interested reader to obtain and to study the original papers, and papers related to this subject.
openaire   +1 more source