Titlebook: Cryptology and Network Security; 7th International Co Matthew K. Franklin,Lucas Chi Kwong Hui,Duncan S. Conference proceedings 2008 Spring

低能儿

https://doi.org/10.1007/b138960ut learning the underlying plaintext. Proxy re-encryption has found many practical applications, such as encrypted email forwarding, secure distributed file systems, and outsourced filtering of encrypted spam. In ACM CCS’07, Canetti and Hohenberger presented a proxy re-encryption scheme with chosen-

狼群

Extricate

https://doi.org/10.1007/b138960. The computational cost and the encryption (public) key size are more efficient than the original scheme. We observe that by using a decryption key in the original scheme, we can encrypt a message more efficiently without a part of an encryption key. In order to let any user receive this benefit, w

Emg827

https://doi.org/10.1007/b138960 of short exponent LSBS-RSA. They claimed that short exponent LSBS-RSA is much more vulnerable to the lattice attack than the standard RSA. In this paper, we further raise the security boundary of the Zhao-Qi attack by considering another polynomial. Our improvemet supports the result of analogue Fe

SUE

友好

https://doi.org/10.1007/b138960ut interacting with the signer. There exists many security models, properties and constructions for sanitizable signatures, which are useful in different scenarios. The aim of this paper is twofold. Firstly, we summarize different properties in the literature and gives some generic conversions betwe

合法

RAG

https://doi.org/10.1007/b138995roposed an identity-based online/offline signature scheme for authentication in the AODV protocol and then transformed this scheme to an identity-based multisignature scheme which is suitable for the DSR protocol. In this paper, we show that their schemes cannot achieve the claimed security by demon

flamboyant

RAG