Cryptographic reverse firewalls for interactive proof systems
From MaRDI portal
Publication:2220883
Recommendations
- Cryptographic reverse firewalls
- Reverse firewalls for actively secure MPCs
- Message transmission with reverse firewalls -- secure communication on corrupted machines
- Reverse firewalls for adaptively secure MPC without setup
- Cryptographic reverse firewall via malleable smooth projective hash functions
Cites work
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 4211487 (Why is no real title available?)
- scientific article; zbMATH DE number 4170086 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1302863 (Why is no real title available?)
- scientific article; zbMATH DE number 708798 (Why is no real title available?)
- scientific article; zbMATH DE number 708820 (Why is no real title available?)
- scientific article; zbMATH DE number 2009957 (Why is no real title available?)
- scientific article; zbMATH DE number 1406779 (Why is no real title available?)
- A formal treatment of backdoored pseudorandom generators
- A method for obtaining digital signatures and public-key cryptosystems
- A more cautious approach to security against mass surveillance
- Backdoors in pseudorandom number generators: possibility and impossibility results
- Cliptography: clipping the power of kleptographic attacks
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- Cryptographic reverse firewall via malleable smooth projective hash functions
- Cryptographic reverse firewalls
- Efficient secure two-party protocols. Techniques and constructions
- Foundations of Cryptography
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to construct constant-round zero-knowledge proof systems for NP
- Improved OR-composition of sigma-protocols
- Message transmission with reverse firewalls -- secure communication on corrupted machines
- NIZKs with an untrusted CRS: security in the face of parameter subversion
- Non-interactive and reusable non-malleable commitment schemes
- On round-optimal zero knowledge in the bare public-key model
- On selective-opening attacks against encryption schemes
- On the Non-malleability of the Fiat-Shamir Transform
- Online/offline OR composition of sigma protocols
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Public immunization against complete subversion without random oracles
- Public keys
- Public-key encryption resistant to parameter subversion and its realization from efficiently-embeddable groups
- Quantum proofs of knowledge
- Security of symmetric encryption against mass surveillance
- Strengthening zero-knowledge protocols using signatures
- The Knowledge Complexity of Interactive Proof Systems
- The prisoners' problem and the subliminal channel
- Unifying Zero-Knowledge Proofs of Knowledge
Cited in
(11)- Reverse firewalls for adaptively secure MPC without setup
- Cryptographic reverse firewalls
- Message transmission with reverse firewalls -- secure communication on corrupted machines
- Reverse firewalls for oblivious transfer extension and applications to zero-knowledge
- Steganography-free zero-knowledge
- Receiver-anonymity in rerandomizable RCCA-secure cryptosystems resolved
- Subversion-resilient enhanced privacy ID
- Universally composable subversion-resilient cryptography
- UC-secure cryptographic reverse firewall-guarding corrupted systems with the minimum trusted module
- Cryptographic reverse firewall via malleable smooth projective hash functions
- Reverse firewalls for actively secure MPCs
This page was built for publication: Cryptographic reverse firewalls for interactive proof systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2220883)
