نتایج جستجو برای: chryseobacyerium indologenes

تعداد نتایج: 213  

Journal: :New Disease Reports 2023

A disease survey was carried out in Tamil Nadu, India during 2021 to assess the prevalence of diseases major rice-growing areas and characterise pathogens associated with infected plants. During survey, rice plants at seedling grain-filling stage showing water-soaked, elongated, light brown lesions leaf margins tips (Figure 1) were collected along grains a polythene bag, labelled sealed. Leaves...

2014
Kaoru Kurosawa Trieu Phong

While the hybrid public key encryption scheme of Kurosawa and Desmedt (CRYPTO 2004) is provably secure against chosen ciphertext attacks (namely, IND-CCA-secure), its associated key encapsulation mechanism (KEM) is widely known as not IND-CCA-secure. In this paper, we present a direct proof of IND-CCA security thanks to a simple twist on the Kurosawa-Desmedt KEM. Our KEM beats the standardized ...

2014
Eduarda Simões Veloso Freire

This thesis is divided into two distinct parts. The first part of this thesis studies noninteractive key exchange schemes in two different settings: the public key setting and the identity-based setting. Loosely speaking, a non-interactive key exchange (NIKE) scheme allows two users to compute a unique shared key without any interaction. Our work is motivated by the scant attention that this pr...

2017
Shenghui Su Jianhua Zheng Shuwang Lu

This paper gives the definitions of an extra superincreasing sequence and an anomalous subset sum, and proposes a fast quantum-safe asymmetric cryptosystem called JUOAN2. The new cryptosystem is based on an additive multivariate permutation problem (AMPP) and an anomalous subset sum problem (ASSP) which parallel a multivariate polynomial problem and a shortest vector problem respectively, and c...

2000
Tatsuaki Okamoto David Pointcheval

We describe a new version of the elliptic curve encryption schemes PSEC (Provably Secure Elliptic Curve). PSEC{3 is a public-key encryption system that uses the elliptic curve El Gamal trapdoor function and two random functions (hash functions) as well as any semantically secure symmetric encryption scheme, such as the one-time pad, or any classical block-cipher. Furthermore, we de ne a new pro...

2014
Srinivasa Reddy S. Ramachandram R. Agrawal J. Kiernan R. Srikant H. Kadhem T. Amagasa S. Lee T. J. Park D. Lee T. Nam R. A. Popa C. M. S. Redfield N. Zeldovich

Order Preserving Encryption (OPE) schemes have been examined to a great extent in the cryptography literature because of their prospective application to database design. OPE is an appealing method for database encryption as it permits to execute sort and range queries in an efficient manner without decrypting the data. Databases such as CryptDB are beginning to employ encryption to guard sensi...

2015
Baljit singh bajwa Sapna Mehta

The treatment of patients with PPH has 2 major components: Resuscitation and control of bleeding, correction of blood volume and identification and management of the underlying cause(s). This complication is life threatening which requires timely and skillful anesthetic management.

2014
Sandro Coretti Yevgeniy Dodis Björn Tackmann Daniele Venturi

We introduce a new security notion for public-key encryption (PKE) that we dub non-malleability under (chosen-ciphertext) self-destruct attacks (NM-SDA), which appears to be the strongest natural PKE security notion below full-blown chosen-ciphertext (IND-CCA) security. In this notion, the adversary is allowed to ask many adaptive “parallel” decryption queries (i.e., a query consists of many ci...

2014
Majid Nateghizad Majid Bakhtiari Mohd Aizaini Maarof

Cloud computing offers a wide range of services such as user demand network, operating systems, hardware, software and resources. These encouraging facilities and hassle free management of computing resources have attracted many users to outsource their data to untrusted servers. Cloud server may leak documents to unauthorized parties. Therefore, all documents need to be transmitted in cipherte...

1996
Afonso Ferreira Claire Kenyon Andrew Rau-Chaplin

Given a set L of n points in the d-dimensional Cartesian space E d , and a query specifying a domain q in E d , the Range Search problem consists in identifying the subset R(q) of the points of L contained in q. The Range Tree data-structure represents a particularly good balance between storage space and search time. The structure requires O(n log d?1 n) space and construction time, but suppor...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید