Titlebook: Security and Cryptography for Networks; 8th International Co Ivan Visconti,Roberto Prisco Conference proceedings 2012 Springer-Verlag Berli

碎片

中子

Time-Specific Encryption from Forward-Secure Encryption are practical in . aspects with regard to computational costs and data sizes. The sizes of the ciphertext and the public parameter in our schemes are significantly smaller than those in previous schemes in an asymptotic sense.

Panther

zonules

IST

Multiple Differential Cryptanalysis Using , and ,, Statisticsapproaches for selecting and combining differentials are considered on a reduced version of the cipher PRESENT. We also consider the accuracy of the theoretical estimates corresponding to these attacks.

outskirts

STEER

Ivan Damgård,Marcel Keller,Enrique Larraia,Christian Miles,Nigel P. Smart

路标

Deterministic Public Key Encryption and Identity-Based Encryption from Lattices in the Auxiliary-Inpr scheme is based on the hardness of the learning with errors (LWE) problem which remains hard even for quantum algorithms..Furthermore, we consider deterministic identity-based public key encryption (D-IBE) in the auxiliary-input setting. The only known D-IBE scheme (without considering auxiliary i

Chandelier

Ring Switching in BGV-Style Homomorphic Encryptions technique to work over any cyclotomic ring and show how it can be used not only for bootstrapping but also during the computation itself (in conjunction with the “packed ciphertext” techniques of Gentry, Halevi and Smart).

electrolyte

Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptionson cost of each proof by a factor linear in the lattice dimension. Furthermore, we allow the message space to be ℤ. and the randomness distribution to be the discrete Gaussian, both of which are natural choices for the Regev encryption scheme. Finally, in our schemes there is no gap between the size