The following pages link to Ran Canetti (Q176997):
Displaying 50 items.
- Toward a game theoretic view of secure computation (Q321318) (← links)
- Refereed delegation of computation (Q385709) (← links)
- Secure computation without authentication (Q656923) (← links)
- Lower bounds for sampling algorithms for estimating the average (Q674290) (← links)
- Bounds on tradeoffs between randomness and communication complexity (Q687507) (← links)
- On strong simulation and composable point obfuscation (Q744605) (← links)
- Universally composable accumulators (Q785051) (← links)
- Analyzing security protocols using time-bounded task-PIOAs (Q1020557) (← links)
- More on BPP and the polynomial-time hierarchy (Q1351599) (← links)
- Certifying trapdoor permutations, revisited (Q1629429) (← links)
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
- On virtual grey box obfuscation for general circuits (Q1688397) (← links)
- Towards doubly efficient private information retrieval (Q1690292) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Optimal-rate non-committing encryption (Q1701444) (← links)
- Task-structured probabilistic I/O automata (Q1745718) (← links)
- Adaptive versus non-adaptive security of multi-party protocols (Q1882568) (← links)
- Maintaining authenticated communication in the presence of break-ins (Q1976005) (← links)
- Randomness versus fault-tolerance (Q1976006) (← links)
- Security and composition of multiparty cryptographic protocols (Q1976007) (← links)
- Fully deniable interactive encryption (Q2096511) (← links)
- Towards multiparty computation withstanding coercion of all parties (Q2119054) (← links)
- Universal composition with global subroutines: capturing global setup within plain UC (Q2119067) (← links)
- COA-secure obfuscation and applications (Q2170027) (← links)
- Unclonable polymers and their cryptographic applications (Q2170032) (← links)
- Universally composable symbolic security analysis (Q2429708) (← links)
- On the limitations of universally composable two-party computation without set-up assumptions (Q2499272) (← links)
- A forward-secure public-key encryption scheme (Q2642255) (← links)
- Covert learning: how to learn with an untrusted intermediary (Q2697884) (← links)
- (Q2778854) (← links)
- (Q2778861) (← links)
- Selective private function evaluation with applications to private statistics (Q2787694) (← links)
- On the Correlation Intractability of Obfuscated Pseudorandom Functions (Q2796135) (← links)
- Universally Composable Authentication and Key-Exchange with Global PKI (Q2798803) (← links)
- Fully succinct garbled RAM (Q2800563) (← links)
- Secure computation with honest-looking parties: what if nobody is truly honest? (extended abstract) (Q2819552) (← links)
- Reusable Fuzzy Extractors for Low-Entropy Distributions (Q2820480) (← links)
- Adaptive hardness and composable security in the plain model from standard assumptions (Q2821797) (← links)
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again (Q2826067) (← links)
- On the existence of extractable one-way functions (Q2829449) (← links)
- The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator (Q2874531) (← links)
- On Virtual Grey Box Obfuscation for General Circuits (Q2874533) (← links)
- Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity (Q2874545) (← links)
- Leakage-Tolerant Interactive Protocols (Q2891488) (← links)
- Efficient Password Authenticated Key Exchange via Oblivious Transfer (Q2900235) (← links)
- Universally Composable Security with Local Adversaries (Q2912802) (← links)
- Secure Key Exchange and Sessions without Credentials (Q2922652) (← links)
- Succinct Garbling and Indistinguishability Obfuscation for RAM Programs (Q2941535) (← links)
- Towards a Game Theoretic View of Secure Computation (Q3003396) (← links)
- The random oracle methodology, revisited (Q3069902) (← links)
