Pages that link to "Item:Q1207696"
From MaRDI portal
The following pages link to A uniform-complexity treatment of encryption and zero-knowledge (Q1207696):
Displaying 20 items.
- Authenticated encryption: relations among notions and analysis of the generic composition paradigm (Q1021246) (← links)
- Random oracles and non-uniformity (Q1648794) (← links)
- AC-RRNS: anti-collusion secured data sharing scheme for cloud storage (Q1726264) (← links)
- Mathematical problems in cryptology (Q1910812) (← links)
- Secure integration of asymmetric and symmetric encryption schemes (Q1946596) (← links)
- Cryptographic pseudorandom generators can make cryptosystems problematic (Q2061967) (← links)
- On publicly-accountable zero-knowledge and small shuffle arguments (Q2061977) (← links)
- High-threshold AVSS with optimal communication complexity (Q2147255) (← links)
- Enhancements of trapdoor permutations (Q2392094) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- On expected polynomial runtime in cryptography (Q2695649) (← links)
- On the Existence of Extractable One-Way Functions (Q2829449) (← links)
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion (Q2953796) (← links)
- Composition of Zero-Knowledge Proofs with Efficient Provers (Q3408217) (← links)
- Language Modeling and Encryption on Packet Switched Networks (Q3593106) (← links)
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles (Q3600229) (← links)
- A Leakage-Resilient Mode of Operation (Q3627451) (← links)
- Cryptography and cryptographic protocols (Q5138490) (← links)
- Magic Adversaries Versus Individual Reduction: Science Wins Either Way (Q5738980) (← links)
- Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity (Q6595677) (← links)
