Sciweavers

Share
TCC
2012
Springer
7views Cryptology» more  TCC 2012»
1 months 2 days ago
Subspace LWE
The (decisional) learning with errors problem (LWE) asks to distinguish “noisy” inner products of a secret vector with random vectors from uniform. In recent years, the LWE pro...
Krzysztof Pietrzak
TCC
2012
Springer
10views Cryptology» more  TCC 2012»
1 months 2 days ago
Hardness Preserving Constructions of Pseudorandom Functions
We show a hardness-preserving construction of a PRF from any length doubling PRG which improves upon known constructions whenever we can put a non-trivial upper bound q on the numb...
Abhishek Jain, Krzysztof Pietrzak, Aris Tentes
TCC
2012
Springer
7views Cryptology» more  TCC 2012»
1 months 2 days ago
Iterative Constructions and Private Data Release
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
Anupam Gupta, Aaron Roth, Jonathan Ullman
TCC
2012
Springer
11views Cryptology» more  TCC 2012»
1 months 2 days ago
Secure Two-Party Computation with Low Communication
We propose a 2-party UC-secure protocol that can compute any function securely. The protocol requires only two messages, communication that is poly-logarithmic in the size of the ...
Ivan Damgård, Sebastian Faust, Carmit Hazay
TCC
2012
Springer
8views Cryptology» more  TCC 2012»
1 months 2 days ago
Computing on Authenticated Data
In tandem with recent progress on computing on encrypted data via fully homomorphic encryption, we present a framework for computing on authenticated data via the notion of slight...
Jae Hyun Ahn, Dan Boneh, Jan Camenisch, Susan Hohe...
TCC
2012
Springer
6views Cryptology» more  TCC 2012»
1 months 2 days ago
On the Instantiability of Hash-and-Sign RSA Signatures
The hash-and-sign RSA signature is one of the most elegant and well known signatures schemes, extensively used in a wide variety of cryptographic applications. Unfortunately, the o...
Yevgeniy Dodis, Iftach Haitner, Aris Tentes
CTRSA
2012
Springer
7views Cryptology» more  CTRSA 2012»
1 months 6 days ago
Plaintext-Checkable Encryption
We study the problem of searching on encrypted data, where the search is performed using a plaintext message or a keyword, rather than a message-specific trapdoor as done by state...
Sébastien Canard, Georg Fuchsbauer, Aline G...
CTRSA
2012
Springer
8views Cryptology» more  CTRSA 2012»
1 months 6 days ago
Practical Realisation and Elimination of an ECC-Related Software Bug Attack
We analyse and exploit implementation features in OpenSSL version 0.9.8g which permit an attack against ECDH-based functionality. The attack, although more general, can recover the...
Billy Bob Brumley, Manuel Barbosa, Dan Page, Frede...
CTRSA
2012
Springer
9views Cryptology» more  CTRSA 2012»
1 months 6 days ago
On the Joint Security of Encryption and Signature in EMV
We provide an analysis of current and future algorithms for signature and encryption in the EMV standards in the case where a single key-pair is used for both signature and encrypt...
Jean Paul Degabriele, Anja Lehmann, Kenneth G. Pat...
FDTC
2011
Springer
33views Cryptology» more  FDTC 2011»
5 months 9 days ago
An In-depth and Black-box Characterization of the Effects of Clock Glitches on 8-bit MCUs
Abstract—The literature about fault analysis typically describes fault injection mechanisms, e.g. glitches and lasers, and cryptanalytic techniques to exploit faults based on som...
Josep Balasch, Benedikt Gierlichs, Ingrid Verbauwh...
books