Ran Canetti

According to our database1, Ran Canetti authored at least 249 papers between 1990 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
EasyUC: Using EasyCrypt to Mechanize Proofs of Universally Composable Security.
IACR Cryptology ePrint Archive, 2019

Fiat-Shamir: from practice to theory.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

From Soft Classifiers to Hard Decisions: How fair can we be?
Proceedings of the Conference on Fairness, Accountability, and Transparency, 2019

EasyUC: Using EasyCrypt to Mechanize Proofs of Universally Composable Security.
Proceedings of the 32nd IEEE Computer Security Foundations Symposium, 2019

2018
Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings.
SIAM J. Comput., 2018

Task-structured probabilistic I/O automata.
J. Comput. Syst. Sci., 2018

On the Universally Composable Security of OpenStack.
IACR Cryptology ePrint Archive, 2018

Fully Bideniable Interactive Encryption.
IACR Cryptology ePrint Archive, 2018

Non-Interactive Zero Knowledge and Correlation Intractability from Circular-Secure FHE.
IACR Cryptology ePrint Archive, 2018

Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption.
IACR Cryptology ePrint Archive, 2018

Fiat-Shamir From Simpler Assumptions.
IACR Cryptology ePrint Archive, 2018

Universally Composable Accumulators.
IACR Cryptology ePrint Archive, 2018

From Soft Classifiers to Hard Decisions: How fair can we be?
CoRR, 2018

Certifying Trapdoor Permutations, Revisited.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

2017
The Hunting of the SNARK.
J. Cryptology, 2017

Certifying Trapdoor Permutations, Revisited.
IACR Cryptology ePrint Archive, 2017

Towards Doubly Efficient Private Information Retrieval.
IACR Cryptology ePrint Archive, 2017

A Universally Composable Treatment of Network Time.
IACR Cryptology ePrint Archive, 2017

Constraint-hiding Constrained PRFs for NC1 from LWE.
IACR Cryptology ePrint Archive, 2017

On Virtual Grey Box Obfuscation for General Circuits.
Algorithmica, 2017

Towards Doubly Efficient Private Information Retrieval.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Chosen-Ciphertext Secure Fully Homomorphic Encryption.
Proceedings of the Public-Key Cryptography - PKC 2017, 2017

Better Two-Round Adaptive Multi-party Computation.
Proceedings of the Public-Key Cryptography - PKC 2017, 2017

Constraint-Hiding Constrained PRFs for NC1 from LWE.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

A Universally Composable Treatment of Network Time.
Proceedings of the 30th IEEE Computer Security Foundations Symposium, 2017

Optimal-Rate Non-Committing Encryption.
Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016
Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions.
SIAM J. Comput., 2016

On the Existence of Extractable One-Way Functions.
SIAM J. Comput., 2016

Toward a Game Theoretic View of Secure Computation.
J. Cryptology, 2016

Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model.
IACR Cryptology ePrint Archive, 2016

Optimal-Rate Non-Committing Encryption in a CRS Model.
IACR Cryptology ePrint Archive, 2016

Better Two-Round Adaptive Multiparty Computation.
IACR Cryptology ePrint Archive, 2016

On the Correlation Intractability of Obfuscated Pseudorandom Functions.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Adaptive Succinct Garbled RAM or: How to Delegate Your Database.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Universally Composable Authentication and Key-Exchange with Global PKI.
Proceedings of the Public-Key Cryptography - PKC 2016, 2016

Fully Succinct Garbled RAM.
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

Reusable Fuzzy Extractors for Low-Entropy Distributions.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

2015
On Obfuscation with Random Oracles.
IACR Cryptology ePrint Archive, 2015

Fully Succinct Garbled RAM.
IACR Cryptology ePrint Archive, 2015

Concurrent Secure Computation with Optimal Query Complexity.
IACR Cryptology ePrint Archive, 2015

On the Correlation Intractability of Obfuscated Pseudorandom Functions.
IACR Cryptology ePrint Archive, 2015

Succinct Adaptive Garbled RAM.
IACR Cryptology ePrint Archive, 2015

Obfuscation of Probabilistic Circuits and Applications.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

On Obfuscation with Random Oracles.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Succinct Garbling and Indistinguishability Obfuscation for RAM Programs.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Modular Order-Preserving Encryption, Revisited.
Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31, 2015

Concurrent Secure Computation with Optimal Query Complexity.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

A Simpler Variant of Universally Composable Security for Standard Multiparty Computation.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014
On Strong Simulation and Composable Point Obfuscation.
J. Cryptology, 2014

Composable Authentication with Global PKI.
IACR Cryptology ePrint Archive, 2014

Obfuscation of Probabilistic Circuits and Applications.
IACR Cryptology ePrint Archive, 2014

Indistinguishability Obfuscation of Iterated Circuits and RAM Programs.
IACR Cryptology ePrint Archive, 2014

Adaptively Secure Two-party Computation From Indistinguishability Obfuscation.
IACR Cryptology ePrint Archive, 2014

Key Derivation From Noisy Sources With More Errors Than Entropy.
IACR Cryptology ePrint Archive, 2014

A Simpler Variant of Universally Composable Security for Standard Multiparty Computation.
IACR Cryptology ePrint Archive, 2014

Practical UC security with a Global Random Oracle.
IACR Cryptology ePrint Archive, 2014

Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity.
IACR Cryptology ePrint Archive, 2014

On the Existence of Extractable One-Way Functions.
IACR Cryptology ePrint Archive, 2014

On Virtual Grey Box Obfuscation for General Circuits.
IACR Cryptology ePrint Archive, 2014

The Hunting of the SNARK.
IACR Cryptology ePrint Archive, 2014

Obfuscation for Evasive Functions.
Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

On the existence of extractable one-way functions.
Proceedings of the Symposium on Theory of Computing, 2014

Secure Key Exchange and Sessions without Credentials.
Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

Verifiable Set Operations over Outsourced Databases.
Proceedings of the Public-Key Cryptography - PKC 2014, 2014

Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

On Virtual Grey Box Obfuscation for General Circuits.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

Practical UC security with a Global Random Oracle.
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014

2013
Security and Composition of Cryptographic Protocols: A Tutorial.
Proceedings of the Secure Multi-Party Computation, 2013

Refereed delegation of computation.
Inf. Comput., 2013

Obfuscating Branching Programs Using Black-Box Pseudo-Free Groups.
IACR Cryptology ePrint Archive, 2013

Verifiable Set Operations over Outsourced Databases.
IACR Cryptology ePrint Archive, 2013

Secure Key Exchange and Sessions Without Credentials.
IACR Cryptology ePrint Archive, 2013

More on the Impossibility of Virtual-Black-Box Obfuscation with Auxiliary Input.
IACR Cryptology ePrint Archive, 2013

Indistinguishability Obfuscation vs. Auxiliary-Input Extractable Functions: One Must Fall.
IACR Cryptology ePrint Archive, 2013

How To Construct Extractable One-Way Functions Against Uniform Adversaries.
IACR Cryptology ePrint Archive, 2013

Obfuscation for Evasive Functions.
IACR Cryptology ePrint Archive, 2013

Public-Coin Concurrent Zero-Knowledge in the Global Hash Model.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Recursive composition and bootstrapping for SNARKS and proof-carrying data.
Proceedings of the Symposium on Theory of Computing Conference, 2013

From Unprovability to Environmentally Friendly Protocols.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012
Universally Composable Security With Local Adversaries.
IACR Cryptology ePrint Archive, 2012

Recursive Composition and Bootstrapping for SNARKs and Proof-Carrying Data.
IACR Cryptology ePrint Archive, 2012

Leakage-Tolerant Interactive Protocols.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Universally Composable Security with Local Adversaries.
Proceedings of the Security and Cryptography for Networks - 8th International Conference, 2012

Efficient Password Authenticated Key Exchange via Oblivious Transfer.
Proceedings of the Public Key Cryptography - PKC 2012, 2012

From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

Two Protocols for Delegation of Computation.
Proceedings of the Information Theoretic Security - 6th International Conference, 2012

2011
Decisional Diffie-Hellman Problem.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Universally Composable Symbolic Security Analysis.
J. Cryptology, 2011

Secure Computation Without Authentication.
J. Cryptology, 2011

Two 1-Round Protocols for Delegation of Computation.
IACR Cryptology ePrint Archive, 2011

Leakage Tolerant Interactive Protocols.
IACR Cryptology ePrint Archive, 2011

Program Obfuscation with Leaky Hardware.
IACR Cryptology ePrint Archive, 2011

From Extractable Collision Resistance to Succinct Non-Interactive Arguments of Knowledge, and Back Again.
IACR Cryptology ePrint Archive, 2011

Towards a Game Theoretic View of Secure Computation.
IACR Cryptology ePrint Archive, 2011

Towards a Game Theoretic View of Secure Computation.
Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

Practical delegation of computation using multiple servers.
Proceedings of the 18th ACM Conference on Computer and Communications Security, 2011

Program Obfuscation with Leaky Hardware.
Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

Composable Security Analysis of OS Services.
Proceedings of the Applied Cryptography and Network Security, 2011

2010
On Symmetric Encryption and Point Obfuscation.
IACR Cryptology ePrint Archive, 2010

Universally Composable Symbolic Analysis of Diffie-Hellman based Key Exchange.
IACR Cryptology ePrint Archive, 2010

Composable Security Analysis of OS Services.
IACR Cryptology ePrint Archive, 2010

On Strong Simulation and Composable Point Obfuscation.
IACR Cryptology ePrint Archive, 2010

Obfuscation of Hyperplane Membership.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

On Symmetric Encryption and Point Obfuscation.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

On Strong Simulation and Composable Point Obfuscation.
Proceedings of the Advances in Cryptology, 2010

2009
Non-malleable Obfuscation.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Towards a Theory of Extractable Functions.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

2008
Non-Malleable Obfuscation.
IACR Cryptology ePrint Archive, 2008

How to Protect Yourself without Perfect Shredding.
IACR Cryptology ePrint Archive, 2008

Modeling Computational Security in Long-Lived Systems, Version 2.
IACR Cryptology ePrint Archive, 2008

Analyzing Security Protocols Using Time-Bounded Task-PIOAs.
Discrete Event Dynamic Systems, 2008

How to Protect Yourself without Perfect Shredding.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Extractable Perfectly One-Way Functions.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Composable Formal Security Analysis: Juggling Soundness, Simplicity and Efficiency.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Obfuscating Point Functions with Multibit Output.
Proceedings of the Advances in Cryptology, 2008

08491 Executive Summary - Theoretical Foundations of Practical Information Security.
Proceedings of the Theoretical Foundations of Practical Information Security, 30.11., 2008

08491 Abstracts Collection - Theoretical Foundations of Practical Information Security.
Proceedings of the Theoretical Foundations of Practical Information Security, 30.11., 2008

Modeling Computational Security in Long-Lived Systems.
Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

POSH: a generalized captcha with security applications.
Proceedings of the 1st ACM Workshop on Security and Artificial Intelligence, 2008

2007
Chosen-Ciphertext Security from Identity-Based Encryption.
SIAM J. Comput., 2007

A Forward-Secure Public-Key Encryption Scheme.
J. Cryptology, 2007

Chosen-Ciphertext Secure Proxy Re-Encryption.
IACR Cryptology ePrint Archive, 2007

On the Role of Scheduling in Simulation-Based Security.
IACR Cryptology ePrint Archive, 2007

Modeling Computational Security in Long-Lived Systems.
IACR Cryptology ePrint Archive, 2007

Obtaining Universally Composable Security: Towards the Bare Bones of Trust.
IACR Cryptology ePrint Archive, 2007

Secure Computation Without Authentication.
IACR Cryptology ePrint Archive, 2007

Universally Composable Security with Global Setup.
Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007

Cryptography from Sunspots: How to Use an Imperfect Reference String.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

Compositional Security for Task-PIOAs.
Proceedings of the 20th IEEE Computer Security Foundations Symposium, 2007

Amplifying Collision Resistance: A Complexity-Theoretic Treatment.
Proceedings of the Advances in Cryptology, 2007

Chosen-ciphertext secure proxy re-encryption.
Proceedings of the 2007 ACM Conference on Computer and Communications Security, 2007

Obtaining Universally Compoable Security: Towards the Bare Bones of Trust.
Proceedings of the Advances in Cryptology, 2007

2006
Security and composition of cryptographic protocols: a tutorial (part I).
SIGACT News, 2006

On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions.
J. Cryptology, 2006

Mitigating Dictionary Attacks on Password-Protected Local Storage.
IACR Cryptology ePrint Archive, 2006

Universally Composable Security with Global Setup.
IACR Cryptology ePrint Archive, 2006

Security and Composition of Cryptographic Protocols: A Tutorial.
IACR Cryptology ePrint Archive, 2006

Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

Mitigating Dictionary Attacks on Password-Protected Local Storage.
Proceedings of the Advances in Cryptology, 2006

2005
Timed Efficient Stream Loss-Tolerant Authentication (TESLA): Multicast Source Authentication Transform Introduction.
RFC, June, 2005

Multicast Security (MSEC) Group Key Management Architecture.
RFC, April, 2005

Decisional Diffie-Hellman Assumption.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Preface.
J. Cryptology, 2005

Universally Composable Password-Based Key Exchange.
IACR Cryptology ePrint Archive, 2005

Using Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol.
IACR Cryptology ePrint Archive, 2005

Hardness Amplification of Weakly Verifiable Puzzles.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Adaptively-Secure, Non-interactive Public-Key Encryption.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Universally Composable Password-Based Key Exchange.
Proceedings of the Advances in Cryptology, 2005

Secure Computation Without Authentication.
Proceedings of the Advances in Cryptology, 2005

2004
Just fast keying: Key agreement in a hostile internet.
ACM Trans. Inf. Syst. Secur., 2004

Adaptive versus Non-Adaptive Security of Multi-Party Protocols.
J. Cryptology, 2004

The random oracle methodology, revisited.
J. ACM, 2004

On the Limitations of Universally Composable Two-Party Computation Without Set-up Assumptions.
IACR Cryptology ePrint Archive, 2004

Hardness amplification of weakly verifiable puzzles.
IACR Cryptology ePrint Archive, 2004

Adaptively-Secure, Non-Interactive Public-Key Encryption.
IACR Cryptology ePrint Archive, 2004

Universally Composable Symbolic Analysis of Cryptographic Protocols (The case of encryption-based mutual authentication and key exchange).
IACR Cryptology ePrint Archive, 2004

On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes.
Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

Universally Composable Protocols with Relaxed Set-Up Assumptions.
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

Chosen-Ciphertext Security from Identity-Based Encryption.
Proceedings of the Advances in Cryptology, 2004

Universally Composable Signature, Certification, and Authentication.
Proceedings of the 17th IEEE Computer Security Foundations Workshop, 2004

2003
Relaxing Chosen-Ciphertext Security.
IACR Cryptology ePrint Archive, 2003

Chosen-Ciphertext Security from Identity-Based Encryption.
IACR Cryptology ePrint Archive, 2003

A Forward-Secure Public-Key Encryption Scheme.
IACR Cryptology ePrint Archive, 2003

On the random-oracle methodology as applied to length-restricted signature schemes.
IACR Cryptology ePrint Archive, 2003

Universally Composable Signatures, Certification and Authentication.
IACR Cryptology ePrint Archive, 2003

On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions.
Proceedings of the Advances in Cryptology, 2003

A Forward-Secure Public-Key Encryption Scheme.
Proceedings of the Advances in Cryptology, 2003

Authenticating Mandatory Access Controls and Preserving Privacy for a High-Assurance Smart Card.
Proceedings of the Computer Security, 2003

Universal Composition with Joint State.
Proceedings of the Advances in Cryptology, 2003

Relaxing Chosen-Ciphertext Security.
Proceedings of the Advances in Cryptology, 2003

2002
Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds.
SIAM J. Comput., 2002

Universal Composition with Joint State.
IACR Cryptology ePrint Archive, 2002

Universally Composable Two-Party and Multi-Party Secure Computation.
IACR Cryptology ePrint Archive, 2002

Security Analysis of IKE's Signature-based Key-Exchange Protocol.
IACR Cryptology ePrint Archive, 2002

Universally Composable Notions of Key Exchange and Secure Channels.
IACR Cryptology ePrint Archive, 2002

Universally composable two-party and multi-party secure computation.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

A Two Layered Approach for Securing an Object Store Network.
Proceedings of the First International IEEE Security in Storage Workshop, 2002

Environmental Requirements for Authentication Protocols.
Proceedings of the Software Security -- Theories and Systems, 2002

Universally Composable Notions of Key Exchange and Secure Channels.
Proceedings of the Advances in Cryptology - EUROCRYPT 2002, International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, April 28, 2002

Security Analysis of IKE's Signature-Based Key-Exchange Protocol.
Proceedings of the Advances in Cryptology, 2002

2001
Black-Box Concurrent Zero-Knowledge Requires Omega(log n) Rounds.
IACR Cryptology ePrint Archive, 2001

Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels.
IACR Cryptology ePrint Archive, 2001

Universally Composable Commitments.
IACR Cryptology ePrint Archive, 2001

On adaptive vs. non-adaptive security of multiparty protocols.
IACR Cryptology ePrint Archive, 2001

Black-Box Concurrent Zero-Knowledge Requires ~Omega(log n) Rounds
Electronic Colloquium on Computational Complexity (ECCC), 2001

A unified framework for analyzing security of protocols
Electronic Colloquium on Computational Complexity (ECCC), 2001

Black-box concurrent zero-knowledge requires Omega~(log n) rounds.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Efficient, DoS-Resistant, Secure Key Exchange for Internet Protocols.
Proceedings of the Security Protocols, 2001

Selective private function evaluation with applications to private statistics.
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

Efficient and Secure Source Authentication for Multicast.
Proceedings of the Network and Distributed System Security Symposium, 2001

Universally Composable Security: A New Paradigm for Cryptographic Protocols.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels.
Proceedings of the Advances in Cryptology, 2001

On Adaptive vs. Non-adaptive Security of Multiparty Protocols.
Proceedings of the Advances in Cryptology, 2001

Relating Cryptography and Cryptographic Protocols.
Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW-14 2001), 2001

Universally Composable Commitments.
Proceedings of the Advances in Cryptology, 2001

2000
Randomness versus Fault-Tolerance.
J. Cryptology, 2000

Maintaining Authenticated Communication in the Presence of Break-Ins.
J. Cryptology, 2000

Security and Composition of Multiparty Cryptographic Protocols.
J. Cryptology, 2000

Universally Composable Security: A New Paradigm for Cryptographic Protocols.
IACR Cryptology ePrint Archive, 2000

The Random Oracle Methodology, Revisited
CoRR, 2000

Resettable zero-knowledge (extended abstract).
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Efficient Authentication and Signing of Multicast Streams over Lossy Channels.
Proceedings of the 2000 IEEE Symposium on Security and Privacy, 2000

An IPSec-based Host Architecture for Secure Internet Multicast.
Proceedings of the Network and Distributed System Security Symposium, 2000

Exposure-Resilient Functions and All-or-Nothing Transforms.
Proceedings of the Advances in Cryptology, 2000

1999
Bandwidth Allocation with Preemption.
SIAM J. Comput., 1999

Resettable Zero-Knowledge.
IACR Cryptology ePrint Archive, 1999

Resettable Zero-Knowledge.
Electronic Colloquium on Computational Complexity (ECCC), 1999

Secure Computation with Honest-Looking Parties: What If Nobody Is Truly Honest? (Extended Abstract).
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Multicast Security: A Taxonomy and Some Efficient Constructions.
Proceedings of the Proceedings IEEE INFOCOM '99, 1999

Efficient Communication-Storage Tradeoffs for Multicast Encryption.
Proceedings of the Advances in Cryptology, 1999

An Efficient Threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack.
Proceedings of the Advances in Cryptology, 1999

Adaptive Security for Threshold Cryptosystems.
Proceedings of the Advances in Cryptology, 1999

1998
Bounding the Power of Preemption in Randomized Scheduling.
SIAM J. Comput., 1998

Randomness versus Fault-Tolerance.
IACR Cryptology ePrint Archive, 1998

Maintaining Authenticated Communication in the Presence of Break-ins.
IACR Cryptology ePrint Archive, 1998

The Random Oracle Methodology, Revisited.
IACR Cryptology ePrint Archive, 1998

Security and Composition of Multi-party Cryptographic Protocols.
IACR Cryptology ePrint Archive, 1998

A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols.
IACR Cryptology ePrint Archive, 1998

Perfectly One-Way Probabilistic Hash Functions (Preliminary Version).
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

The Random Oracle Methodology, Revisited (Preliminary Version).
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols (Extended Abstract).
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

1997
HMAC: Keyed-Hashing for Message Authentication.
RFC, February, 1997

Towards realizing random oracles: Hash functions that hide all partial information.
IACR Cryptology ePrint Archive, 1997

Randomness vs. Fault-Tolerance.
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

Maintaining Authenticated Communication in the Presence of Break-ins.
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

Deniable Encryption.
Proceedings of the Advances in Cryptology, 1997

Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information.
Proceedings of the Advances in Cryptology, 1997

1996
More on BPP and the Polynomial-Time Hierarchy.
Inf. Process. Lett., 1996

Incoercible Multiparty Computation.
IACR Cryptology ePrint Archive, 1996

Deniable Encryption.
IACR Cryptology ePrint Archive, 1996

Adaptively Secure Multi-Party Computation.
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Incoercible Multiparty Computation (extended abstract).
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

Pseudorandom Functions Revisited: The Cascade Construction and Its Concrete Security.
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

Keying Hash Functions for Message Authentication.
Proceedings of the Advances in Cryptology, 1996

1995
Lower Bounds for Sampling Algorithms for Estimating the Average.
Inf. Process. Lett., 1995

Bounding the power of preemption in randomized scheduling.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Bandwidth allocation with preemption.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1994
Maintaining Security in the Presence of Transient Faults.
Proceedings of the Advances in Cryptology, 1994

1993
Bounds on Tradeoffs Between Randomness and Communication Complexity.
Computational Complexity, 1993

Fast asynchronous Byzantine agreement with optimal resilience.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Asynchronous secure computation.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

1991
The parallel C (pC) programming language.
IBM Journal of Research and Development, 1991

1990
Bounds on Tradeoffs between Randomness and Communication Complexity
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990


  Loading...