梯田
发表于 2025-3-23 12:52:03
http://reply.papertrans.cn/25/2407/240611/240611_11.png
Protein
发表于 2025-3-23 14:37:21
Hybrid Damgård Is CCA1-Secure under the DDH Assumptiontem is CPA-secure, the used MAC is unforgeable, the used key-derivation function is secure, and the underlying group is a DDH group. The new cryptosystem is the most efficient known CCA1-secure hybrid cryptosystem based on standard assumptions.
过度
发表于 2025-3-23 18:28:07
Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bitsrmat factoring on LSBS-RSA, which claims that . and . cannot share more than . least significant bits, where . is the bit-length of .. In conclusion, it is a trade-off between the number of sharing bits and the security level in LSBS-RSA. One should be more careful when using LSBS-RSA with short exponents.
全部
发表于 2025-3-23 22:41:40
http://reply.papertrans.cn/25/2407/240611/240611_14.png
漫步
发表于 2025-3-24 04:10:36
http://reply.papertrans.cn/25/2407/240611/240611_15.png
停止偿付
发表于 2025-3-24 07:51:53
Keyword Field-Free Conjunctive Keyword Searches on Encrypted Data and Extension for Dynamic Groups propose a scheme of keyword field-free conjunctive keyword searches on encrypted data, which affirmatively answers an open problem asked by Golle . at . 2004. Furthermore, the proposed scheme is extended to the dynamic group setting. Security analysis of our constructions is given in the paper.
FLEET
发表于 2025-3-24 14:25:53
Analysis and Design of Multiple Threshold Changeable Secret Sharing Schemest. First, we compute a theoretical bound on the information and security rate for such a secret sharing. Second, we show how to achieve multiple threshold change for a Chinese Remainder Theorem like scheme. We prove that the parameters of this new scheme asymptotically reach the previous bound.
演讲
发表于 2025-3-24 15:48:20
http://reply.papertrans.cn/25/2407/240611/240611_18.png
Charade
发表于 2025-3-24 21:07:41
0302-9743 m ciphers and block ciphers, cryptographic foundations, applications and implementations, as well as security in ad hoc networks and wireless sensor networks.978-3-540-89640-1978-3-540-89641-8Series ISSN 0302-9743 Series E-ISSN 1611-3349
烤架
发表于 2025-3-25 02:56:50
Pascalis Raimondos-Møller,Alan D. Woodlande pairing computation is very demanding. Still, pairing-based non-interactive key establishment requires minimal communication and at the same time enjoys excellent properties when used for key distribution.