Titlebook: Security and Cryptography for Networks; 6th International Co Rafail Ostrovsky,Roberto Prisco,Ivan Visconti Conference proceedings 2008 The

扔掉掐死你

General Certificateless Encryption and Timed-Release EncryptionLE and TRE differ and there is no generic transformation from a CLE to a TRE. This paper gives a generalized model for CLE that fulfills the requirements of TRE. This model is secure against adversaries with adaptive trapdoor extraction capabilities, decryption capabilities for arbitrary public keys

废止

Efficient Certificate-Based Encryption in the Standard ModelCA) security directly without any transformation. When compared to all previous generic constructions (in either random oracle or standard model), our scheme is far more efficient than those schemes. When compared to the CBE scheme in [16] (which is the only concrete implementation secure in the sta

narcotic

An Improved Robust Fuzzy Extractor in the presence of an active adversary. Robust fuzzy extractors were defined by Dodis et al. in Crypto 2006 to be noninteractive, i.e., only one message ., which can be modified by an unbounded adversary, can pass from one party to the other. This allows them to be used by a single party at differe

爱社交

On Linear Secret Sharing for Connectivity in Directed Graphsted graph, and a set of parties (i.e., edges) can reconstruct the secret if it contains a path from node . to node .. We prove that in every linear secret sharing scheme realizing the st-con function on a directed graph with . edges the total size of the shares is .(..). This should be contrasted wi

压倒性胜利

取消

Anonymous Proxy Signaturesiate delegators remain anonymous. As for group signatures, in case of misuse, a special authority can . signatures to reveal the chain of delegations and the signer’s identity. The scheme satisfies a strong notion of non-frameability generalizing the one for dynamic group signatures. We give formal

OATH

可卡

Using Normal Bases for Compact Hardware Implementations of the AES S-Boxn affine transformation in GF(2). The S-box is the most expansive building block of any hardware implementation of the AES, and the multiplicative inversion is the most costly step of the S-box transformation. There exist many publications about hardware implementations of the S-box and the smallest

小淡水鱼

A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes, is still unbroken up to now, but has two major drawbacks: long key and low transmission rate. Our variant is based on QC-LDPC codes and is able to overcome such drawbacks, while avoiding the known attacks. Recently, however, a new attack has been discovered that can recover the private key with li

faculty

Full Cryptanalysis of LPS and Morgenstern Hash Functions computing preimages was also easy for this hash function. We present a probabilistic polynomial time algorithm solving this problem. Subsequently, we study the Morgenstern hash, an interesting variant of LPS hash, and break this function as well. Our attacks build upon the ideas of Zémor and Tillic