Titlebook: Information Security; 14th International C Xuejia Lai,Jianying Zhou,Hui Li Conference proceedings 2011 Springer-Verlag GmbH Berlin Heidelbe

Nucleate

Sha Ma,Bo Yang,Kangshun Li,Feng Xiaife health and disease, restoration ecology, reintroduction management and environmental economics. Such applications in turn benefit from close cooperation between university-based researchers and managers of endangered species in zoos and reserves. Only in exceptional cases do zoos or reserves hav

CURB

吹牛需要藝術(shù)

領(lǐng)巾

How to Find Short RC4 Colliding Key Pairsciple that how the two different keys can achieve a collision is well known by investigating the key scheduling algorithm of RC4. However, how to find those colliding key pairs is a different story, which has been largely remained unexploited. Previous researches have demonstrated that finding colli

Feature

痛苦一下

直覺(jué)好

Toward Pairing-Free Certificateless Authenticated Key Exchangesarty. Unfortunately, these advantages are partially counteracted in most CL-AKE protocols which require expensive pairing operations. This paper proposes a new CL-AKE protocol without requiring any pairing operation during the protocol execution, although a pairing map may be required to realize a D

黃油沒(méi)有

Security Analysis of an RSA Key Generation Algorithm with a Large Private Keyed secure. In this paper, we propose an attack on Encinas-Masqué-Dios algorithm and find its security flaw. Firstly, we prove that Encinas-Masqué-Dios algorithm is totally insecure when the public exponent . is larger than the sum of the two primes . and .. Secondly, we show that when . is larger th

克制

Adaptive Secure-Channel Free Public-Key Encryption with Keyword Search Implies Timed Release Encryptryption (IBE), respectively. It seems natural that there is a close relationship between TRE and PEKS. However, no explicit bridge has been shown between TRE and PEKS so far. In this paper, we show that TRE can be generically constructed by PEKS with extended functionalities, called secure-channel f

MULTI

The ,-Diffie-Hellman Problem and Its Applicationsnded to the .-Diffie-Hellman (.-DH) problem for an arbitrary integer ., and this new problem is shown to be at least as hard as the ordinary DH problem. Like the twin DH problem, the .-DH problem remains hard even in the presence of a decision oracle that recognizes solution to the problem. On the o