Pages that link to "Item:Q625101"
From MaRDI portal
The following pages link to Cryptography in constant parallel time (Q625101):
Displaying 18 items.
- The complexity of estimating min-entropy (Q260395) (← links)
- Cryptographic hardness of random local functions. Survey (Q332271) (← links)
- Cryptography with constant input locality (Q1037233) (← links)
- Updatable signatures and message authentication codes (Q2061942) (← links)
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust (Q2104237) (← links)
- Expander-based cryptography meets natural proofs (Q2125080) (← links)
- On the relationship between statistical zero-knowledge and statistical randomized encodings (Q2281251) (← links)
- Locally computable UOWHF with linear shrinkage (Q2408584) (← links)
- System-level non-interference of constant-time cryptography. I: Model (Q2417947) (← links)
- On actively-secure elementary MPC reductions (Q2695655) (← links)
- On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings (Q2829956) (← links)
- Fine-Grained Cryptography (Q2829959) (← links)
- Statistical Randomized Encodings: A Complexity Theoretic View (Q3448769) (← links)
- Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
- Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization (Q5080481) (← links)
- Expander-Based Cryptography Meets Natural Proofs (Q5090391) (← links)
- Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof? (Q6157611) (← links)
- Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity (Q6595677) (← links)
