• Aucun résultat trouvé

Concise Multi-challenge CCA-Secure Encryption and Signatures with Almost Tight Security

N/A
N/A
Protected

Academic year: 2021

Partager "Concise Multi-challenge CCA-Secure Encryption and Signatures with Almost Tight Security"

Copied!
32
0
0

Texte intégral

Références

Documents relatifs

In ASIACRYPT 2015, Part I, LNCS 9452, pages 681–707. Indistinguishability obfuscation from trilinear maps and block-wise local PRGs. Indistinguishability obfuscation from

To enhance the security of kinoform identity-tag, we propose to embed another fold of safety by using substitution cipher encrypted phase-key as a watermark instead of the

As the public key can be generated based on the identity of the connected server and its exchange is not necessary, the method is not prone to MITM attacks any more.. To verify

Only re- cipients who have attributes which satisfy the access policy and whose identity is not in the list of revoked users will be able to decrypt the mes- sage.The proposed

The first attack is called Error Set Decoding (ESD), it will take full advantage of the knowledge of the code structure to decode the largest possible number of errors remaining in

In Crypto’11, LNCS 6841, pp. A Forward-Secure Public-Key Encryption Scheme. Chosen-Ciphertext Security from Identity-Based Encryption. Bonsai Trees, or How to Delegate a Lattice

This paper presents the first unidirectional proxy re-encryption schemes with chosen-ciphertext security in the standard model (i.e. without the random oracle idealization).. The

In this section, we first show a generic construction of an IND-FE-CPA secure inner-product functional encryption scheme from a FE-CPA-friendly projective hash function.. Then, we