Results 211 to 220 of about 1,476,368 (262)
Transmitted and pretreatment drug resistance among 69 HIV-1 CRFs in China: the first systematic analysis. [PDF]
Emerg Microbes InfectYin X +6 more
europepmc +1 more source
Unlocking the Value of Patient Self-Monitoring Technologies: A Multi-Country Framework to Calibrate Payer and HTA Coverage and Reimbursement Considerations with Innovation. [PDF]
J Health Econ Outcomes ResKarichu JK +8 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Nature, 1970
KEYS for the identification of specimens have been used by biologists for several centuries. A method is described here for generating such keys automatically by computer, instead of composing them by hand, which until recently was the only way to produce them.
openaire +2 more sources
KEYS for the identification of specimens have been used by biologists for several centuries. A method is described here for generating such keys automatically by computer, instead of composing them by hand, which until recently was the only way to produce them.
openaire +2 more sources
Key generation with a Byzantine helper
2015 IEEE International Conference on Communication Workshop (ICCW), 2015This paper considers the problem of key generation with a helper, which might be subjected to Byzantine attacks. If the helper is not under attack, it will follow the key generation protocol. However, if the helper is under attack, it will modify the messages to mislead the key generation parties.
Wenwen Tu, Lifeng Lai
openaire +1 more source
Key generation with limited interaction
2016 IEEE International Symposium on Information Theory (ISIT), 2016The basic two-terminal key generation model is considered, where the communication between the terminals is limited. We introduce a preorder relation on the set of joint distributions called XY-absolute continuity, and we reduce the multi-letter characterization of the key-communication tradeoff to the evaluation of the XY-concave envelope of a ...
Jingbo Liu, Paul W. Cuff, Sergio Verdú
openaire +1 more source
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 ...
Tahmasbi, Mehrdad, Bloch, Matthieu
openaire +1 more source
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 ...
Tahmasbi, Mehrdad, Bloch, Matthieu
openaire +1 more source
Short RSA keys and their generation
Journal of Cryptology, 1995The authors present various ways of constructing moduli suitable for the well-known RSA-public key cryptography scheme, i.e. products of two large primes of roughly the same size, with a predetermined number of bits. This approach is of obvious practical interest since it can lead to savings in storage and bandwith for data transmission.
Scott A. Vanstone, Robert J. Zuccherato
openaire +2 more sources
2016
In this paper we present a new algorithm to construct the keys of the multivariate public key encryption scheme ZHFE. Constructing ZHFE's trapdoor involves finding a low degree polynomial of q-Hamming-weight-three, as an aid to invert a pair of q-Hamming-weight-two polynomials of high degree and high rank.
John B. Baena +4 more
openaire +1 more source
In this paper we present a new algorithm to construct the keys of the multivariate public key encryption scheme ZHFE. Constructing ZHFE's trapdoor involves finding a low degree polynomial of q-Hamming-weight-three, as an aid to invert a pair of q-Hamming-weight-two polynomials of high degree and high rank.
John B. Baena +4 more
openaire +1 more source
Generalized key player problem
Computational and Mathematical Organization Theory, 2014The key player problem (KPP) identifies a set of key nodes that have a central role in a network. In this paper, we propose a generalized KPP (GKPP) that extends existing work on KPP-Pos and KPP-Neg in such a way that it can consider network structure, node attributes, and the characteristics of edges.
openaire +1 more source
A Novel Key Generating Scheme of Automatic Variable Key
2019 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS), 2019The major objectives of the computer networks are, sharing information and providing uninterrupted services over a distance. Because of the critical nature of computer networks and continuous development in information technology, the probability of getting hacked and leaking of the shared message becomes a bigger threat.
Chukhu Chunka +2 more
openaire +1 more source