
浏览量:1905
Ran Canetti
Professor
点击登录, 查看更多内容

论文共 234 篇
EasyUC: Using EasyCrypt to Mechanize Proofs of Universally Composable Security.
Fiat-Shamir: from practice to theory
On the Universally Composable Security of OpenStack.
Fiat-Shamir From Simpler Assumptions.
Universally Composable Accumulators.
Non-Interactive Zero Knowledge and Correlation Intractability from Circular-Secure FHE.
Fully Bideniable Interactive Encryption.
Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model.
Better Two-Round Adaptive Multi-party Computation.
Chosen-Ciphertext Secure Fully Homomorphic Encryption.
Constraint-hiding Constrained PRFs for NC1 from LWE.
Towards Doubly Efficient Private Information Retrieval.
Certifying Trapdoor Permutations, Revisited.
A Universally Composable Treatment of Network Time.
Optimal-Rate Non-Committing Encryption.
Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
On the existence of extractable one-way functions
Universally Composable Authentication and Key-Exchange with Global PKI.
Towards a game theoretic view of secure computation
Succinct Garbling and Indistinguishability Obfuscation for RAM Programs
A Simpler Variant of Universally Composable Security for Standard Multiparty Computation.
Modular Order-Preserving Encryption, Revisited
On Strong Simulation and Composable Point Obfuscation
Indistinguishability Obfuscation of Iterated Circuits and RAM Programs.
The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator.
Public-Coin concurrent zero-knowledge in the global hash model
Obfuscating Branching Programs Using Black-Box Pseudo-Free Groups.
Security and Composition of Cryptographic Protocols: A Tutorial.
Recursive composition and bootstrapping for SNARKS and proof-carrying data
From Unprovability to Environmentally Friendly Protocols
Universally composable security with local adversaries
Leakage-Tolerant interactive protocols
Two protocols for delegation of computation
Efficient password authenticated key exchange via oblivious transfer
Secure computation without authentication
Two 1-Round Protocols for Delegation of Computation.
Composable security analysis of OS services
Practical delegation of computation using multiple servers
Program obfuscation with leaky hardware
Towards a game theoretic view of secure computation
Obfuscation of Hyperplane Membership
On symmetric encryption and point obfuscation
Modeling Computational Security in Long-Lived Systems, Version 2
Towards a Theory of Extractable Functions
Universally Composable Symbolic Security Analysis
Proceedings of the 5th conference on Theory of cryptography
POSH: a generalized captcha with security applications
Extractable Perfectly One-Way Functions
How to Protect Yourself without Perfect Shredding
Analyzing Security Protocols Using Time-Bounded Task-PIOAs
Modeling Computational Security in Long-Lived Systems.
Obfuscating point functions with multibit output
Composable Formal Security Analysis: Juggling Soundness, Simplicity and Efficiency
Universally composable security with global setup
Secure Computation Without Authentication
Amplifying Collision Resistance: A Complexity-Theoretic Treatment
Cryptography from Sunspots: How to Use an Imperfect Reference String
Chosen-ciphertext secure proxy re-encryption
Obtaining universally compoable security: towards the bare bones of trust
A Forward-Secure Public-Key Encryption Scheme
Security and composition of cryptographic protocols: a tutorial (part I)
Time-bounded task-PIOAs: a framework for analyzing security protocols
Mitigating dictionary attacks on password-protected local storage
Using Task-Structured Probabilistic I/O Automata to Analyze Cryptographic Protocols
Task-Structured Probabilistic I/O Automata
Universally composable symbolic analysis of mutual authentication and key-exchange protocols
Chosen-Ciphertext Security from Identity-Based Encryption
Chosen-Ciphertext Security from Identity-Based Encryption.
Sequencing batch reactor as a post-treatment of anaerobically treated dairy effluent.
Securing communication of dynamic groups in dynamic network-centric environments
Task-Structured Probabilistic I/O Automata
Universally composable password-based key exchange
Hardness amplification of weakly verifiable puzzles
Adaptively-secure, non-interactive public-key encryption
On the limitations of universally composable two-party computation without set-up assumptions
Using Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol.