The following pages link to Ran Canetti (Q176997):
Displaying 32 items.
- Fiat-Shamir: from practice to theory (Q5212848) (← links)
- Fast asynchronous Byzantine agreement with optimal resilience (Q5248470) (← links)
- Asynchronous secure computation (Q5248471) (← links)
- On the existence of extractable one-way functions (Q5259586) (← links)
- On Obfuscation with Random Oracles (Q5261687) (← links)
- Obfuscation of Probabilistic Circuits and Applications (Q5261688) (← links)
- Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation (Q5261691) (← links)
- Advances in Cryptology - EUROCRYPT 2004 (Q5307255) (← links)
- Maintaining authenticated communication in the presence of break-ins (Q5361462) (← links)
- Randomness vs. fault-tolerance (Q5361464) (← links)
- Universally Composable Password-Based Key Exchange (Q5385742) (← links)
- Obtaining Universally Compoable Security: Towards the Bare Bones of Trust (Q5387094) (← links)
- Verifiable Set Operations over Outsourced Databases (Q5402967) (← links)
- Chosen‐Ciphertext Security from Identity‐Based Encryption (Q5422487) (← links)
- Advances in Cryptology - CRYPTO 2003 (Q5428125) (← links)
- Advances in Cryptology - CRYPTO 2003 (Q5428142) (← links)
- Secure Computation Without Authentication (Q5451036) (← links)
- Obfuscating Point Functions with Multibit Output (Q5458610) (← links)
- Recursive composition and bootstrapping for SNARKS and proof-carrying data (Q5495781) (← links)
- Theory of Cryptography (Q5711652) (← links)
- Theory of Cryptography (Q5711672) (← links)
- Chosen-Ciphertext Secure Fully Homomorphic Encryption (Q5738757) (← links)
- Better Two-Round Adaptive Multi-party Computation (Q5738763) (← links)
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE (Q5738886) (← links)
- Obfuscation for Evasive Functions (Q5746331) (← links)
- Mitigating Dictionary Attacks on Password-Protected Local Storage (Q5756658) (← links)
- Theory of Cryptography (Q5898365) (← links)
- Theory of Cryptography (Q5901764) (← links)
- On the statistical properties of Diffie-Hellman distributions (Q5932009) (← links)
- Triply adaptive UC NIZK (Q6132421) (← links)
- Taming adaptivity in YOSO protocols: the modular way (Q6582166) (← links)
- On the computational hardness needed for quantum cryptography (Q6610287) (← links)