Subversion-resilient signatures: definitions, constructions and applications
From MaRDI portal
Publication:1989360
DOI10.1016/j.tcs.2020.03.021zbMath1455.94114OpenAlexW3121130432MaRDI QIDQ1989360
Bernardo Magri, Giuseppe Ateniese, Daniele Venturi
Publication date: 21 April 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.03.021
Related Items (5)
Practical algorithm substitution attack on extractable signatures ⋮ Subversion-resilient enhanced privacy ID ⋮ Universally composable subversion-resilient cryptography ⋮ Impossibility on tamper-resilient cryptography with uniqueness properties ⋮ Reverse firewalls for actively secure MPCs
Cites Work
- Programmable hash functions and their applications
- Verifiable random functions: relations to identity-based key encapsulation and new constructions
- Divertible and subliminal-free zero-knowledge proofs for languages
- Public-key encryption resistant to parameter subversion and its realization from efficiently-embeddable groups
- Correcting subverted random oracles
- Let a non-barking watchdog bite: cliptographic signatures with an offline watchdog
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Message Transmission with Reverse Firewalls—Secure Communication on Corrupted Machines
- Backdoors in Pseudorandom Number Generators: Possibility and Impossibility Results
- Instantiating Random Oracles via UCEs
- Bounded Tamper Resilience: How to Go beyond the Algebraic Barrier
- Tamper Resilient Circuits: The Adversary at the Gates
- Security of Symmetric Encryption against Mass Surveillance
- On the Impossibility of Cryptography with Tamperable Randomness
- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
- Waters Signatures with Optimal Security Reduction
- Strong Security from Probabilistic Signature Schemes
- Public Key Encryption against Related Key Attacks
- Tamper and Leakage Resilience in the Split-State Model
- Securing Circuits against Constant-Rate Tampering
- A Tamper and Leakage Resilient von Neumann Architecture
- A More Cautious Approach to Security Against Mass Surveillance
- The Chaining Lemma and Its Application
- A Formal Treatment of Backdoored Pseudorandom Generators
- Resisting Randomness Subversion: Fast Deterministic and Hedged Public-Key Encryption in the Standard Model
- Cryptographic Reverse Firewalls
- Cliptography: Clipping the Power of Kleptographic Attacks
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
- Correlated-Input Secure Hash Functions
- Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience
- On Cipher-Dependent Related-Key Attacks in the Ideal-Cipher Model
- Cryptography Secure against Related-Key Attacks and Tampering
- Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
- Short and Stateless Signatures from the RSA Assumption
- Lossy Trapdoor Functions and Their Applications
- On Related-Secret Pseudorandomness
- Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation
- The Dark Side of “Black-Box” Cryptography or: Should We Trust Capstone?
- Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks
- Private Circuits II: Keeping Secrets in Tamperable Circuits
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
- Realizing Hash-and-Sign Signatures under Standard Assumptions
- Secure Hash-and-Sign Signatures Without the Random Oracle
- Efficient Construction of (Distributed) Verifiable Random Functions
- The Cramer-Shoup Strong-RSA Signature Scheme Revisited
- Non-Malleable Codes
- Signature Schemes Secure against Hard-to-Invert Leakage
- The Prisoners’ Problem and the Subliminal Channel
- Cryptography with Tamperable and Leaky Memory
- Circuits resilient to additive attacks with applications to secure computation
- Non-malleable codes from additive combinatorics
- A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations
- Locally Decodable and Updatable Non-malleable Codes and Their Applications
- Tamper Detection and Continuous Non-malleable Codes
- Verifiable Random Functions from Weaker Assumptions
- Advances in Cryptology – CRYPTO 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Leakage-Resilient Signatures with Graceful Degradation
- Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits
- Proving Tight Security for Rabin-Williams Signatures
- Public Key Cryptography - PKC 2005
- Fast Software Encryption
- Continuous Non-malleable Codes
- Securing Circuits and Protocols against 1/poly(k) Tampering Rate
- Theory of Cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Subversion-resilient signatures: definitions, constructions and applications
