Simulating Auxiliary Inputs, Revisited

DOI10.1007/978-3-662-53641-4_7zbMath1369.94567arXiv1503.00484OpenAlexW2478529919MaRDI QIDQ3179356

Maciej Skórski

Publication date: 21 December 2016

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.00484

zbMATH Keywords

stream ciphersboostingleakage-resilient cryptographycomputational indistinguishabilitysimulating auxiliary inputs

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols

Cites Work

• Unnamed Item
• Unnamed Item
• Quick approximation to matrices and applications
• A Uniform Min-Max Theorem with Applications in Cryptography
• Leakage-Resilient Pseudorandom Functions and Side-Channel Attacks on Feistel Networks
• Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
• A Leakage-Resilient Mode of Operation
• Practical Leakage-Resilient Symmetric Cryptography
• Practical Leakage-Resilient Pseudorandom Objects with Minimum Public Randomness
• From Weak to Strong Zero-Knowledge and Applications
• Security Proofs for Hash Tree Time-Stamping Using Hash Functions with Small Output Size
• Separating succinct non-interactive arguments from all falsifiable assumptions
• How to Fake Auxiliary Input

This page was built for publication: Simulating Auxiliary Inputs, Revisited