#### Filter Results:

- Full text PDF available (81)

#### Publication Year

1977

2017

- This year (5)
- Last 5 years (57)
- Last 10 years (110)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Organism

Learn More

We introduce the notion of “non-malleable codes” which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message contained in a modified codeword… (More)

- Stefan Dziembowski, Krzysztof Pietrzak
- 2008 49th Annual IEEE Symposium on Foundations of…
- 2008

We construct a stream-cipher S whose implementation is secure even if a bounded amount of arbitrary (adversarially chosen) information on the internal state ofS is leaked during computation. This… (More)

- Eike Kiltz, Krzysztof Pietrzak
- ASIACRYPT
- 2010

Blinding is a popular and well-known countermeasure to protect public-key cryptosystems against side-channel attacks. The high level idea is to randomize an exponentiation in order to prevent… (More)

- Krzysztof Pietrzak
- J. Comput. Syst. Sci.
- 2003

We show that the Fixed Alphabet Shortest Common Supersequence (SCS) and the Fixed Alphabet Longest Common Subsequence (LCS) problems parameterized in the number of strings are W [1]-hard. Unless W… (More)

- Krzysztof Pietrzak
- EUROCRYPT
- 2009

A weak pseudorandom function (wPRF) is a pseudorandom functions with a relaxed security requirement, where one only requires the output to be pseudorandom when queried on random (and not… (More)

- Mihir Bellare, Krzysztof Pietrzak, Phillip Rogaway
- CRYPTO
- 2005

We present an improved bound on the advantage of any q-query adversary at distinguishing between the CBC MAC over a random n-bit permutation and a random function outputting n bits. The result… (More)

- Ueli Maurer, Krzysztof Pietrzak, Renato Renner
- IACR Cryptology ePrint Archive
- 2006

A random system is the abstraction of the input-output behavior of any kind of discrete system, in particular cryptographic systems. Many aspects of cryptographic security analyses and proofs can be… (More)

- Stefan Dziembowski, Sebastian Faust, Vladimir Kolmogorov, Krzysztof Pietrzak
- IACR Cryptology ePrint Archive
- 2013

Proofs of work (PoW) have been suggested by Dwork and Naor (Crypto’92) as protection to a shared resource. The basic idea is to ask the service requestor to dedicate some non-trivial amount of… (More)

- Ueli Maurer, Krzysztof Pietrzak
- EUROCRYPT
- 2003

Luby and Rackoff showed how to construct a (super-)pseudorandom permutation {0, 1}2n → {0, 1}2n from some number r of pseudorandom functions {0, 1}n → {0, 1}n. Their construction, motivated by DES,… (More)

- Yevgeniy Dodis, Eike Kiltz, Krzysztof Pietrzak, Daniel Wichs
- IACR Cryptology ePrint Archive
- 2012

Traditionally, symmetric-key message authentication codes (MACs) are easily built from pseudorandom functions (PRFs). In this work we propose a wide variety of other approaches to building efficient… (More)