On the impossibility of cryptography with tamperable randomness
From MaRDI portal
Publication:1688399
DOI10.1007/s00453-016-0219-7zbMath1405.94041OpenAlexW2560885415MaRDI QIDQ1688399
Kai-Min Chung, Mohammad Mahmoody, Karn Seth, Per Austrin, Rafael Pass
Publication date: 5 January 2018
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-016-0219-7
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Probabilistic encryption
- Generating quasi-random sequences from semi-random sources
- Definitions and properties of zero-knowledge proof systems
- Security of Symmetric Encryption against Mass Surveillance
- Tamper and Leakage Resilience in the Split-State Model
- Securing Circuits against Constant-Rate Tampering
- How to Compute under $${\mathcal {\varvec{AC}}}^\mathbf{0}$$ Leakage without Secure Hardware
- Public Keys
- Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience
- Efficient Public-Key Cryptography in the Presence of Key Leakage
- BiTR: Built-in Tamper Resilience
- Resettable zero-knowledge (extended abstract)
- Public-Key Encryption Schemes with Auxiliary Inputs
- How to Compute in the Presence of Leakage
- The Dark Side of “Black-Box” Cryptography or: Should We Trust Capstone?
- How to Encrypt with a Malicious Random Number Generator
- Algorithmic Tamper-Proof Security under Probing Attacks
- Private Circuits II: Keeping Secrets in Tamperable Circuits
- Simultaneous Hardcore Bits and Cryptography against Memory Attacks
- A method for obtaining digital signatures and public-key cryptosystems
- A Pseudorandom Generator from any One-way Function
- 2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness
- Cryptography with Tamperable and Leaky Memory
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- Theory of Cryptography
- Theory of Cryptography
