نتایج جستجو برای: symmetric key management

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

2008
Tat Chee Wan Alwyn Goh Chin Kiong Ng Geong Sen Poh

Simple Network Management Protocol (SNMP) is widely used for remote network resource management due to its simplicity and distributed management capabilities. However, the increased use of SNMP to manage and control network resources such as routers and servers also introduces security risks whereby unauthorized users can retrieve information or modify the given resources remotely. The basic se...

2013
Suman Bala Gaurav Sharma Anil K. Verma

WSN is the collection of thousands of tiny sensor nodes, which have the capability of sensing, computing and transmitting the information in the network. Due to the low circuit design, it has some resource constraints but efficient to carry the information through wireless communication. But the exchange of information in a secure manner is critical in WSN. There are many techniques developed i...

1997
Bruce Schneier Chris Hall

Current e-mail security systems base their security on the secrecy of the long-term private key. If this private key is ever compromised, an attacker can decrypt any messages— past, present, or future—encrypted with the corresponding public key. The system described in this paper uses short term private-key/public-key key pairs to reduce the magnitude of this vulnerability.

2006
Jung-Jae Kim Kwang-Hyoung Lee So Yeon Min Jeong Gyu Jee

This paper proposes more various key generation algorithms than conventional encryption method, and more secure encryption method that does not keep each symmetric key of key generation algorithm in server. After implementing proposed system, we verify the system using various sizes of video data. We get the fact that proposed system can reduce the delay time of encryption and decryption at the...

Journal: :Electronic Colloquium on Computational Complexity (ECCC) 2010
Ron Rothblum

We show how to transform any additively homomorphic privatekey encryption scheme that is compact, into a public-key encryption scheme. By compact we mean that the length of a homomorphically generated encryption is independent of the number of ciphertexts from which it was created. We do not require anything else on the distribution of homomorphically generated encryptions (in particular, we do...

2010
Keith M. Martin

There are many applications of symmetric cryptography where the only realistic option is to predistribute key material in advance of deployment, rather than provide online key distribution. The problem of how most effectively to predistribute keys is inherently combinatorial. We revisit some early combinatorial key predistribution shemes and discuss their limitations. We then explain why this p...

Journal: :Sig. Proc.: Image Comm. 2006
Dariusz Bogumil

In this paper, a novel asymmetric public-key watermarking scheme is proposed. The watermark is embedded with the use of a private key, while the decoding uses only simple public key. The asymmetric watermark carries certain number of bits of information. However, neither the knowledge of a public key, nor the knowledge of the hidden information, does not allow the attacker to remove the waterma...

1998
Hung-Min Sun Shiuh-Pyng Shieh

Recently J. and R.M. Campello de Souza proposed a private-key encryption scheme based on the product codes with the capability of correcting a special type of structured errors. In this paper, we show that J. and R.M. Campello de Souza’s scheme is insecure against chosen-plaintext attacks, and consequently propose a secure modified scheme.

2003
Hong-Sen Yan Hsing-Hui Huang

Most ancient Chinese padlocks are key-operated locks with splitting springs, and partially keyless letter-combination locks. They can be characterized based on the types of locks, the shapes of locks, the engravings of locks, the materials of locks, and the mechanisms of locks. Some locks and keys are not only very beautiful and artistic colorful, but also with various designs. As a result, a s...

Journal: :Informatica, Lith. Acad. Sci. 2001
Yuh-Min Tseng Jinn-ke Jan Hung-Yu Chien

Peyravian and Zunic (2000) proposed a password transmission scheme and a password change scheme over an insecure network. Their proposed solutions do not require the use of any symmetric-key or public-key cryptosystems. However, this article points out that their schemes have several security flaws for practical applications. A slight improvement on their schemes is proposed in this paper to re...

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

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