Steganography-free zero-knowledge
From MaRDI portal
Recommendations
Cites work
- A formal treatment of backdoored pseudorandom generators
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- An information-theoretic model for steganography
- Backdoors in pseudorandom number generators: possibility and impossibility results
- Broadcast Interactive Proofs
- Cliptography: clipping the power of kleptographic attacks
- Collusion-free protocols
- Collusion-Free Protocols in the Mediated Model
- Cryptographic reverse firewalls
- Cryptographic reverse firewalls for interactive proof systems
- Cryptography with tamperable and leaky memory
- Divertible and subliminal-free zero-knowledge proofs for languages
- FHE-based bootstrapping of designated-prover NIZK
- Fully homomorphic encryption using ideal lattices
- How to construct constant-round zero-knowledge proof systems for NP
- How to simulate it -- a tutorial on the simulation proof technique
- How to use indistinguishability obfuscation
- How to Utilize the Randomness of Zero-Knowledge Proofs
- scientific article; zbMATH DE number 1303118 (Why is no real title available?)
- scientific article; zbMATH DE number 1088240 (Why is no real title available?)
- scientific article; zbMATH DE number 1942414 (Why is no real title available?)
- scientific article; zbMATH DE number 2009954 (Why is no real title available?)
- Message transmission with reverse firewalls -- secure communication on corrupted machines
- NIZKs with an untrusted CRS: security in the face of parameter subversion
- On the Power of Secure Two-Party Computation
- Public-key encryption resistant to parameter subversion and its realization from efficiently-embeddable groups
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
- Resisting randomness subversion: fast deterministic and hedged public-key encryption in the standard model
- Reverse firewalls for actively secure MPCs
- Reverse firewalls for adaptively secure MPC without setup
- Security of symmetric encryption against mass surveillance
- The knowledge complexity of interactive proof-systems
- Theory of Cryptography
- Theory of Cryptography
This page was built for publication: Steganography-free zero-knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169351)