Titlebook: Applied Cryptography and Network Security; 7th International Co Michel Abdalla,David Pointcheval,Damien Vergnaud Conference proceedings 200

移植

PATRI

匍匐

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.

廣大

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.

最小

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.

聯(lián)想記憶

中國(guó)紀(jì)念碑

jabber

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

天文臺(tái)

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 comparisons

AGATE

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