Pages that link to "Item:Q1273742"
From MaRDI portal
The following pages link to Modern cryptography, probabilistic proofs and pseudo-randomness (Q1273742):
Displayed 10 items.
- Exploring confusion in product ciphers through regression analysis (Q881850) (← links)
- A simple remote user authentication scheme (Q1410075) (← links)
- Interactive and probabilistic proof-checking (Q1577488) (← links)
- In search of an easy witness: Exponential time vs. probabilistic polynomial time. (Q1872732) (← links)
- More efficient PAC-learning of DNF with membership queries under the uniform distribution (Q1878685) (← links)
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols (Q2368990) (← links)
- Practical construction and analysis of pseudo-randomness primitives (Q2482337) (← links)
- Tweakable Enciphering Schemes from Hash-Sum-Expansion (Q5458214) (← links)
- Computational sample complexity and attribute-efficient learning (Q5918064) (← links)
- Pseudorandom generators without the XOR lemma (Q5943089) (← links)