The following pages link to Krzysztof Pietrzak (Q332266):
Displaying 50 items.
- A counterexample to the chain rule for conditional HILL entropy (Q332268) (← links)
- Parallel repetition of computationally sound protocols revisited (Q421032) (← links)
- Robust multi-property combiners for hash functions (Q744343) (← links)
- Sustained space complexity (Q1648824) (← links)
- Simple proofs of sequential work (Q1648847) (← links)
- Be adaptive, avoid overcommitting (Q1675723) (← links)
- Position-based cryptography and multiparty communication complexity (Q1690188) (← links)
- Efficient authentication from hard learning problems (Q1698400) (← links)
- Beyond Hellman's time-memory trade-offs with applications to proofs of space (Q1703929) (← links)
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems (Q1877706) (← links)
- Limits on the adaptive security of Yao's garbling (Q2128573) (← links)
- Delayed authentication: preventing replay and relay attacks in private contact tracing (Q2152016) (← links)
- Adaptively secure proxy re-encryption (Q2289435) (← links)
- Trojan-resilience without cryptography (Q2697869) (← links)
- On treewidth, separators and Yao's garbling (Q2697873) (← links)
- Generic Security of NMAC and HMAC with Input Whitening (Q2795967) (← links)
- Standard Security Does Imply Security Against Selective Opening for Markov Distributions (Q2796129) (← links)
- Constrained PRFs for Unbounded Inputs (Q2799033) (← links)
- New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators (Q2811128) (← links)
- Offline Witness Encryption (Q2822676) (← links)
- Learning with Rounding, Revisited (Q2845660) (← links)
- Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions (Q2845695) (← links)
- The Exact PRF-Security of NMAC and HMAC (Q2874500) (← links)
- Cryptography from Learning Parity with Noise (Q2891361) (← links)
- Hardness Preserving Constructions of Pseudorandom Functions (Q2891495) (← links)
- Lossy Functions Do Not Amplify Well (Q2891500) (← links)
- Subspace LWE (Q2891505) (← links)
- Message Authentication, Revisited (Q2894418) (← links)
- Adaptive Security of Constrained PRFs (Q2936602) (← links)
- The Chain Rule for HILL Pseudoentropy, Revisited (Q2946442) (← links)
- Parallel Repetition for Leakage Resilience Amplification Revisited (Q3000532) (← links)
- Efficient Authentication from Hard Learning Problems (Q3003371) (← links)
- Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience (Q3012821) (← links)
- Leakage Resilient ElGamal Encryption (Q3058681) (← links)
- Pseudoentropy: Lower-Bounds for Chain Rules and Transformations (Q3179357) (← links)
- An Efficient Parallel Repetition Theorem (Q3408184) (← links)
- Leakage-Resilient Signatures (Q3408204) (← links)
- Condensed Unpredictability (Q3448859) (← links)
- Proofs of Space (Q3457086) (← links)
- The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC (Q3457119) (← links)
- A Quasipolynomial Reduction for Generalized Selective Decryption on Trees (Q3457130) (← links)
- Weak Pseudorandom Functions in Minicrypt (Q3519519) (← links)
- Robust Multi-property Combiners for Hash Functions Revisited (Q3519540) (← links)
- Improving the Security of MACs Via Randomized Message Preprocessing (Q3524909) (← links)
- Leakage-Resilient Pseudorandom Functions and Side-Channel Attacks on Feistel Networks (Q3582746) (← links)
- A Tight Bound for EMAC (Q3591444) (← links)
- Composition Implies Adaptive Security in Minicrypt (Q3593104) (← links)
- Luby-Rackoff Ciphers from Weak Round Functions? (Q3593108) (← links)
- Parallel Repetition of Computationally Sound Protocols Revisited (Q3596374) (← links)
- Compression from Collisions, or Why CRHF Combiners Have a Long Output (Q3600232) (← links)
