Titlebook: Information Security and Cryptology; 4th International Co Moti Yung,Peng Liu,Dongdai Lin Conference proceedings 2009 Springer-Verlag Berlin

Conjecture

书目名称Information Security and Cryptology影响因子(影响力)




书目名称Information Security and Cryptology影响因子(影响力)学科排名




书目名称Information Security and Cryptology网络公开度




书目名称Information Security and Cryptology网络公开度学科排名




书目名称Information Security and Cryptology被引频次




书目名称Information Security and Cryptology被引频次学科排名




书目名称Information Security and Cryptology年度引用




书目名称Information Security and Cryptology年度引用学科排名




书目名称Information Security and Cryptology读者反馈




书目名称Information Security and Cryptology读者反馈学科排名

FLUSH

合并

Strong Anonymous Signaturestrong anonymous signatures. For strong anonymous signatures, the identity of the signer remains secret even if the challenge message is chosen by an adversary. We then demonstrate some efficient constructions and prove their security in our model.

潜移默化

MIR

Cryptanalysis of Two Ring Signcryption Schemeshang-Wang’s scheme (2008). We give different attack methods to the above two ring signcryption schemes. There exist Malicious KGC attack and Non-repudiation attack on Wang-Zhang-Ma’s scheme (2007).There exist anonymity attack and existential unforgeability attack on Zhu-Zhang-Wang’s scheme.

希望

Efficient Signcryption Key Encapsulation without Random Oraclesve their semantic security and existential unforgeability in the standard model. Compared to Tan’s schemes, our corresponding schemes have 20% faster speed in the key encapsulation, 33% faster speed in the key decapsulation, 33% shorter public key, 60% shorter private key, and |.| bits shorter ciphertext.

归功于

财主

切割

Constructing Variable-Length PRPs and SPRPs from Fixed-Length PRPsccepting any input length that is fixed in the range of . to 2. bits, when the round functions are independently chosen fixed-length PRPs on . bits. We also prove that these are the minimum number of rounds required.

chronicle

Chosen Ciphertext Secure Certificateless Threshold Encryption in the Standard Model-PKE scheme proposed by Long et al. [13], our scheme is more secure. Since our scheme deals with a malicious KGC and is proved secure in the standard model. Furthermore, our scheme does not need to compute pairings in the encryption phase. Therefore it is more efficient than Long et al.’s scheme [13].