The following pages link to Ran Canetti (Q176997):
Displaying 50 items.
- Program Obfuscation with Leaky Hardware (Q3102218) (← links)
- Adaptive Succinct Garbled RAM or: How to Delegate Your Database (Q3181022) (← links)
- Resettable zero-knowledge (extended abstract) (Q3191990) (← links)
- (Q3374929) (← links)
- On Symmetric Encryption and Point Obfuscation (Q3408187) (← links)
- Obfuscation of Hyperplane Membership (Q3408188) (← links)
- Keying Hash Functions for Message Authentication (Q3452335) (← links)
- A Simpler Variant of Universally Composable Security for Standard Multiparty Computation (Q3457057) (← links)
- Concurrent Secure Computation with Optimal Query Complexity (Q3457059) (← links)
- Extractable Perfectly One-Way Functions (Q3519522) (← links)
- How to Protect Yourself without Perfect Shredding (Q3519529) (← links)
- Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols (Q3524308) (← links)
- Modeling Computational Security in Long-Lived Systems (Q3541014) (← links)
- Just fast keying (Q3546456) (← links)
- Universally composable two-party and multi-party secure computation (Q3579187) (← links)
- On Strong Simulation and Composable Point Obfuscation (Q3582775) (← links)
- Universally Composable Security with Global Setup (Q3596372) (← links)
- Non-malleable Obfuscation (Q3611760) (← links)
- Towards a Theory of Extractable Functions (Q3611790) (← links)
- Amplifying Collision Resistance: A Complexity-Theoretic Treatment (Q3612554) (← links)
- Bounding the Power of Preemption in Randomized Scheduling (Q4210081) (← links)
- (Q4228521) (← links)
- (Q4234110) (← links)
- (Q4234111) (← links)
- An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract) (Q4250756) (← links)
- (Q4250781) (← links)
- Bandwidth Allocation with Preemption (Q4268843) (← links)
- On Certain Exponential Sums and the Distribution of Diffie-Hellman Triples (Q4354276) (← links)
- (Q4364544) (← links)
- (Q4364570) (← links)
- (Q4409115) (← links)
- (Q4411535) (← links)
- (Q4418587) (← links)
- (Q4434869) (← links)
- (Q4434880) (← links)
- (Q4542530) (← links)
- (Q4542539) (← links)
- (Q4542560) (← links)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
- (Q4737255) (← links)
- (Q4783717) (← links)
- Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds (Q4785630) (← links)
- Public-Coin Concurrent Zero-Knowledge in the Global Hash Model (Q4910272) (← links)
- (Q4940714) (← links)
- (Q4941850) (← links)
- Equivocating Yao (Q4977997) (← links)
- Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model (Q5026392) (← links)
- Universally Composable Security (Q5066937) (← links)
- Black-box concurrent zero-knowledge requires \tilde {Ω} (log <i>n</i> ) rounds (Q5176015) (← links)
- Two Protocols for Delegation of Computation (Q5200454) (← links)
