Krzysztof Pietrzak
Institute of Science and Technology Austria
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Krzysztof Pietrzak.
international cryptology conference | 2009
Eike Kiltz; Krzysztof Pietrzak; Martijn Stam; Moti Yung
We present a new approach to the design of IND-CCA2 secure hybrid encryption schemes in the standard model. Our approach provides an efficient generic transformation from 1-universal to 2-universal hash proof systems. The transformation involves a randomness extractor based on a 4-wise independent hash function as the key derivation function. Our methodology can be instantiated with efficient schemes based on standard intractability assumptions such as Decisional Diffie-Hellman, Quadratic Residuosity, and Pailliers Decisional Composite Residuosity. Interestingly, our framework also allows to prove IND-CCA2 security of a hybrid version of 1991s Damgards ElGamal public-key encryption scheme under the DDH assumption.
international cryptology conference | 2005
Yevgeniy Dodis; Roberto Imbuzeiro Oliveira; Krzysztof Pietrzak
The Full-Domain Hash (FDH) signature scheme forms [3] one the most basic usages of random oracles. It works with a family
foundations of computer science | 2007
Stefan Dziembowski; Krzysztof Pietrzak
\mathcal{F}
international cryptology conference | 2005
Mihir Bellare; Krzysztof Pietrzak; Phillip Rogaway
of trapdoor permutations (TDP), where the signature of m is computed as f−−1(h(m)) (here
theory of cryptography conference | 2010
Sebastian Faust; Eike Kiltz; Krzysztof Pietrzak; Guy N. Rothblum
{f} \in_{\mathcal{R}} \mathcal{F}
theory and application of cryptographic techniques | 2003
Ueli Maurer; Krzysztof Pietrzak
and h is modelled as a random oracle). It is known to be existentially unforgeable for any TDP family
international conference on the theory and application of cryptology and information security | 2010
Eike Kiltz; Krzysztof Pietrzak
\mathcal{F}
international cryptology conference | 2011
Eike Kiltz; Krzysztof Pietrzak; David Cash; Abhishek Jain; Daniele Venturi
[3], although a much tighter security reduction is known for a restrictive class of TDPs [10,14]— namely, those induced by a family of claw-free permutations (CFP) pairs. The latter result was shown [11] to match the best possible “black-box” security reduction in the random oracle model, irrespective of the TDP family
international cryptology conference | 2015
Stefan Dziembowski; Sebastian Faust; Vladimir Kolmogorov; Krzysztof Pietrzak
\mathcal{F}
theory of cryptography conference | 2004
Ueli Maurer; Krzysztof Pietrzak
(e.g., RSA) one might use. In this work we investigate the question if it is possible to instantiate the random oracle h with a “real” family of hash functions