移植 发表于 2025-3-28 16:51:18
http://reply.papertrans.cn/16/1598/159729/159729_41.pngPATRI 发表于 2025-3-28 21:04:31
http://reply.papertrans.cn/16/1598/159729/159729_42.png匍匐 发表于 2025-3-29 00:48:54
Novel Precomputation Schemes for Elliptic Curve Cryptosystemss for the scalar multiplication. Our analysis shows that the proposed schemes offer, to the best of our knowledge, the lowest costs for precomputing points on both single and multiple scalar multiplication and for various elliptic curve forms, including the highly efficient Jacobi quartics and Edwards curves.广大 发表于 2025-3-29 04:02:57
Efficient Robust Private Set Intersectionata mining. Assuring robustness, namely, coping with potentially arbitrarily misbehaving (i.e., malicious) parties, while retaining protocol efficiency (rather than employing costly generic techniques) is an open problem. In this work the first solution to this problem is presented.最小 发表于 2025-3-29 10:13:58
A New Variant of the Cramer-Shoup KEM Secure against Chosen Ciphertext AttackKEM scheme in terms of public key size and encapsulation cost, but is proven to be (still) secure against chosen ciphertext attack in the standard model, relative to the Decisional Diffie-Hellman problem.联想记忆 发表于 2025-3-29 11:56:11
http://reply.papertrans.cn/16/1598/159729/159729_46.png中国纪念碑 发表于 2025-3-29 17:02:42
http://reply.papertrans.cn/16/1598/159729/159729_47.pngjabber 发表于 2025-3-29 21:17:26
Secure Pairing of “Interface-Constrained” Devices Resistant against Rushing User Behavioras Bluetooth, WiFi). The devices in such a scenario can neither be assumed to have a prior context with each other nor do they share a common trusted authority. Fortunately, the devices can generally be connected using auxiliary physical channel(s) (such as audio, visual, tactile) that can be authen天文台 发表于 2025-3-30 02:35:55
How to Extract and Expand Randomness: A Summary and Explanation of Existing Resultshough existing works provide the basic theorems necessary, they lack details or examples of appropriate cryptographic primitives and/or parameter sizes. This has lead to the large amount of min-entropy needed in the (non-uniform) shared secret being overlooked in proposals and efficiency comparisonsAGATE 发表于 2025-3-30 04:39:13
Novel Precomputation Schemes for Elliptic Curve Cryptosystemss for the scalar multiplication. Our analysis shows that the proposed schemes offer, to the best of our knowledge, the lowest costs for precomputing points on both single and multiple scalar multiplication and for various elliptic curve forms, including the highly efficient Jacobi quartics and Edwar