Impossibility on tamper-resilient cryptography with uniqueness properties
From MaRDI portal
Publication:2061927
DOI10.1007/978-3-030-75245-3_15zbMath1479.94268OpenAlexW2886907404MaRDI QIDQ2061927
Goichiro Hanaoka, Takahiro Matsuda, Keisuke Tanaka, Yu Yu Wang
Publication date: 21 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-75245-3_15
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounded tamper resilience: how to go beyond the algebraic barrier
- On the security loss of unique signatures
- Memory lower bounds of reductions revisited
- A subversion-resistant SNARK
- Subversion-zero-knowledge SNARKs
- On tightly secure non-interactive key exchange
- Subversion-resilient signatures: definitions, constructions and applications
- Extracting randomness from extractor-dependent sources
- Signatures from sequential-OR proofs
- Hardness of LWE on general entropic distributions
- Upper and lower bounds for continuous non-malleable codes
- Non-Malleable Functions and Their Applications
- Optimal Security Proofs for Signatures from Identification Schemes
- Optimal Security Proofs for Full Domain Hash, Revisited
- Waters Signatures with Optimal Security Reduction
- Public Key Encryption against Related Key Attacks
- Tamper and Leakage Resilience in the Split-State Model
- Black-Box Separations for One-More (Static) CDH and Its Generalization
- Continuous Non-malleable Key Derivation and Its Application to Related-Key Security
- Efficient RKA-Secure KEM and IBE Schemes Against Invertible Functions
- The Chaining Lemma and Its Application
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
- Efficient Public-Key Cryptography with Bounded Leakage and Tamper Resilience
- Public-Key Cryptosystems Resilient to Continuous Tampering and Leakage of Arbitrary Functions
- Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits
- Barriers in cryptography with weak, correlated and leaky sources
- Careful with Composition: Limitations of the Indifferentiability Framework
- Efficient Public-Key Cryptography in the Presence of Key Leakage
- Cryptography Secure against Related-Key Attacks and Tampering
- Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
- Short and Stateless Signatures from the RSA Assumption
- Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
- On the Impossibility of Three-Move Blind Signature Schemes
- Constructing Verifiable Random Functions with Large Input Spaces
- Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks
- On the (Im)Possibility of Key Dependent Encryption
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Breaking RSA may not be equivalent to factoring
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Non-Malleable Codes
- RKA Security beyond the Linear Barrier: IBE, Encryption and Signatures
- Witness Maps and Applications
- Cryptography with Tamperable and Leaky Memory
- Tamper Detection and Continuous Non-malleable Codes
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Limits of provable security from standard assumptions
- Advances in Cryptology - CRYPTO 2003
- Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
- Updatable Zero-Knowledge Databases
- On the Impossibility of Tight Cryptographic Reductions
- Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits
- Continuous Non-malleable Codes
- On the Impossibility of Structure-Preserving Deterministic Primitives
- Theory of Cryptography
- On the importance of eliminating errors in cryptographic computations
This page was built for publication: Impossibility on tamper-resilient cryptography with uniqueness properties
