Ran Canetti

Pratik Sarkar

Xiao Wang

Proceedings of the Advances in Cryptology - ASIACRYPT 2022, 2022

2021

Covert Learning: How to Learn with an Untrusted Intermediary.

[BibT_eX]

[DOI]

Ari Karchmer

Proceedings of the Theory of Cryptography - 19th International Conference, 2021

2020

Universally Composable Security.

[BibT_eX]

[DOI]

J. ACM, 2020

UC Non-Interactive, Proactive, Threshold ECDSA.

[BibT_eX]

[DOI]

Nikolaos Makriyannis

Udi Peled

IACR Cryptol. ePrint Arch., 2020

Privacy-Preserving Automated Exposure Notification.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Anonymous Collocation Discovery: Taming the Coronavirus While Preserving Privacy.

[BibT_eX]

[DOI]

Ari Trachtenberg

CoRR, 2020

Towards Multiparty Computation Withstanding Coercion of All Parties.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Universal Composition with Global Subroutines: Capturing Global Setup Within Plain UC.

[BibT_eX]

[DOI]

Christian Badertscher

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Blazing Fast OT for Three-Round UC OT Extension.

[BibT_eX]

[DOI]

Pratik Sarkar

Xiao Wang

Proceedings of the Public-Key Cryptography - PKC 2020, 2020

Using Universal Composition to Design and Analyze Secure Complex Hardware Systems.

[BibT_eX]

[DOI]

Proceedings of the 2020 Design, Automation & Test in Europe Conference & Exhibition, 2020

Universally Composable Accumulators.

[BibT_eX]

[DOI]

Foteini Baldimtsi

Sophia Yakoubov

Proceedings of the Topics in Cryptology - CT-RSA 2020, 2020

Fully Deniable Interactive Encryption.

[BibT_eX]

[DOI]

Sunoo Park

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

UC Non-Interactive, Proactive, Threshold ECDSA with Identifiable Aborts.

[BibT_eX]

[DOI]

Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security.

[BibT_eX]

[DOI]

Pratik Sarkar

Xiao Wang

Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019

Fiat-Shamir: from practice to theory.

[BibT_eX]

[DOI]

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

On the Universally Composable Security of OpenStack.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Cybersecurity Development, 2019

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

[BibT_eX]

[DOI]

Proceedings of the Conference on Fairness, Accountability, and Transparency, 2019

EasyUC: Using EasyCrypt to Mechanize Proofs of Universally Composable Security.

[BibT_eX]

[DOI]

Alley Stoughton

Proceedings of the 32nd IEEE Computer Security Foundations Symposium, 2019

2018

Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings.

[BibT_eX]

[DOI]

SIAM J. Comput., 2018

Task-structured probabilistic I/O automata.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2018

Fully Bideniable Interactive Encryption.

[BibT_eX]

[DOI]

Sunoo Park

IACR Cryptol. ePrint Arch., 2018

Non-Interactive Zero Knowledge and Correlation Intractability from Circular-Secure FHE.

[BibT_eX]

[DOI]

Alex Lombardi

Daniel Wichs

IACR Cryptol. ePrint Arch., 2018

Fiat-Shamir From Simpler Assumptions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Certifying Trapdoor Permutations, Revisited.

[BibT_eX]

[DOI]

Amit Lichtenberg

Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption.

[BibT_eX]

[DOI]

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

Constraint-hiding Constrained PRFs for NC1 from LWE.

[BibT_eX]

[DOI]

Yilei Chen

IACR Cryptol. ePrint Arch., 2017

Towards Doubly Efficient Private Information Retrieval.

[BibT_eX]

[DOI]

Justin Holmgren

Silas Richelson

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model.

[BibT_eX]

[DOI]

Muthuramakrishnan Venkitasubramaniam

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Chosen-Ciphertext Secure Fully Homomorphic Encryption.

[BibT_eX]

[DOI]

Srinivasan Raghuraman

Silas Richelson

Vinod Vaikuntanathan

Proceedings of the Public-Key Cryptography - PKC 2017, 2017

Better Two-Round Adaptive Multi-party Computation.

[BibT_eX]

[DOI]

Muthuramakrishnan Venkitasubramaniam

Proceedings of the Public-Key Cryptography - PKC 2017, 2017

Constraint-Hiding Constrained PRFs for NC<sup>1</sup> from LWE.

[BibT_eX]

[DOI]

Yilei Chen

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.

[BibT_eX]

[DOI]

Proceedings of the 30th IEEE Computer Security Foundations Symposium, 2017

Optimal-Rate Non-Committing Encryption.

[BibT_eX]

[DOI]

Mariana Raykova

Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016

Toward a Game Theoretic View of Secure Computation.

[BibT_eX]

[DOI]

Gilad Asharov

Carmit Hazay

J. Cryptol., 2016

Optimal-Rate Non-Committing Encryption in a CRS Model.

[BibT_eX]

[DOI]

Mariana Raykova

IACR Cryptol. ePrint Arch., 2016

Better Two-Round Adaptive Multiparty Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

On the Correlation Intractability of Obfuscated Pseudorandom Functions.

[BibT_eX]

[DOI]

Yilei Chen

Leonid Reyzin

Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Adaptive Succinct Garbled RAM or: How to Delegate Your Database.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Universally Composable Authentication and Key-Exchange with Global PKI.

[BibT_eX]

[DOI]

Daniel Shahaf

Margarita Vald

Proceedings of the Public-Key Cryptography - PKC 2016, 2016

Fully Succinct Garbled RAM.

[BibT_eX]

[DOI]

Justin Holmgren

Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

Reusable Fuzzy Extractors for Low-Entropy Distributions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

2015

Succinct Adaptive Garbled RAM.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Obfuscation of Probabilistic Circuits and Applications.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

On Obfuscation with Random Oracles.

[BibT_eX]

[DOI]

Yael Tauman Kalai

Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation.

[BibT_eX]

[DOI]

Shafi Goldwasser

Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Succinct Garbling and Indistinguishability Obfuscation for RAM Programs.

[BibT_eX]

[DOI]

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Modular Order-Preserving Encryption, Revisited.

[BibT_eX]

[DOI]

Charalampos Mavroforakis

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.

[BibT_eX]

[DOI]

Vipul Goyal

Abhishek Jain

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

A Simpler Variant of Universally Composable Security for Standard Multiparty Computation.

[BibT_eX]

[DOI]

Asaf Cohen

Yehuda Lindell

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014

Composable Authentication with Global PKI.

[BibT_eX]

[DOI]

Daniel Shahaf

Margarita Vald

IACR Cryptol. ePrint Arch., 2014

Indistinguishability Obfuscation of Iterated Circuits and RAM Programs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Key Derivation From Noisy Sources With More Errors Than Entropy.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

The Hunting of the SNARK.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Obfuscation for Evasive Functions.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

On the existence of extractable one-way functions.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing, 2014

Secure Key Exchange and Sessions without Credentials.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

Verifiable Set Operations over Outsourced Databases.

[BibT_eX]

[DOI]

Dimitrios Papadopoulos

Nikos Triandopoulos

Proceedings of the Public-Key Cryptography - PKC 2014, 2014

Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity.

[BibT_eX]

[DOI]

Abhishek Jain

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

On Virtual Grey Box Obfuscation for General Circuits.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

Practical UC security with a Global Random Oracle.

[BibT_eX]

[DOI]

Abhishek Jain

Alessandra Scafuro

Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014

2013

Security and Composition of Cryptographic Protocols: A Tutorial.

[BibT_eX]

[DOI]

Proceedings of the Secure Multi-Party Computation, 2013

Refereed delegation of computation.

[BibT_eX]

[DOI]

Inf. Comput., 2013

Obfuscating Branching Programs Using Black-Box Pseudo-Free Groups.

[BibT_eX]

[DOI]

Vinod Vaikuntanathan

IACR Cryptol. ePrint Arch., 2013

More on the Impossibility of Virtual-Black-Box Obfuscation with Auxiliary Input.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Indistinguishability Obfuscation vs. Auxiliary-Input Extractable Functions: One Must Fall.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

How To Construct Extractable One-Way Functions Against Uniform Adversaries.

[BibT_eX]

[DOI]

Nir Bitansky

IACR Cryptol. ePrint Arch., 2013

Public-Coin Concurrent Zero-Knowledge in the Global Hash Model.

[BibT_eX]

[DOI]

Huijia Lin

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Recursive composition and bootstrapping for SNARKS and proof-carrying data.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing Conference, 2013

From Unprovability to Environmentally Friendly Protocols.

[BibT_eX]

[DOI]

Huijia Lin

Rafael Pass

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012

Leakage-Tolerant Interactive Protocols.

[BibT_eX]

[DOI]

Nir Bitansky

Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Universally Composable Security with Local Adversaries.

[BibT_eX]

[DOI]

Margarita Vald

Proceedings of the Security and Cryptography for Networks - 8th International Conference, 2012

Efficient Password Authenticated Key Exchange via Oblivious Transfer.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography - PKC 2012, 2012

From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

Two Protocols for Delegation of Computation.

[BibT_eX]

[DOI]

Proceedings of the Information Theoretic Security - 6th International Conference, 2012

2011

Decisional Diffie-Hellman Problem.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Universally Composable Symbolic Security Analysis.

[BibT_eX]

[DOI]

Jonathan Herzog

J. Cryptol., 2011

Two 1-Round Protocols for Delegation of Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Towards a Game Theoretic View of Secure Computation.

[BibT_eX]

[DOI]

Gilad Asharov

Carmit Hazay

Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

Practical delegation of computation using multiple servers.

[BibT_eX]

[DOI]

Proceedings of the 18th ACM Conference on Computer and Communications Security, 2011

Program Obfuscation with Leaky Hardware.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

Composable Security Analysis of OS Services.

[BibT_eX]

[DOI]

Proceedings of the Applied Cryptography and Network Security, 2011

2010

Universally Composable Symbolic Analysis of Diffie-Hellman based Key Exchange.

[BibT_eX]

[DOI]

Sebastian Gajek

IACR Cryptol. ePrint Arch., 2010

Obfuscation of Hyperplane Membership.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

On Symmetric Encryption and Point Obfuscation.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions.

[BibT_eX]

[DOI]

Huijia Lin

Rafael Pass

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

On Strong Simulation and Composable Point Obfuscation.

[BibT_eX]

[DOI]

Nir Bitansky

Proceedings of the Advances in Cryptology, 2010

2009

Non-malleable Obfuscation.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Towards a Theory of Extractable Functions.

[BibT_eX]

[DOI]

Ronny Ramzi Dakdouk

Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

2008

Modeling Computational Security in Long-Lived Systems, Version 2.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

Analyzing Security Protocols Using Time-Bounded Task-PIOAs.

[BibT_eX]

[DOI]

Discret. Event Dyn. Syst., 2008

How to Protect Yourself without Perfect Shredding.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Extractable Perfectly One-Way Functions.

[BibT_eX]

[DOI]

Ronny Ramzi Dakdouk

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Composable Formal Security Analysis: Juggling Soundness, Simplicity and Efficiency.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Obfuscating Point Functions with Multibit Output.

[BibT_eX]

[DOI]

Ronny Ramzi Dakdouk

Proceedings of the Advances in Cryptology, 2008

08491 Executive Summary - Theoretical Foundations of Practical Information Security.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Foundations of Practical Information Security, 30.11., 2008

08491 Abstracts Collection - Theoretical Foundations of Practical Information Security.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Foundations of Practical Information Security, 30.11., 2008

Modeling Computational Security in Long-Lived Systems.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Foundations of Practical Information Security, 30.11., 2008

POSH: a generalized captcha with security applications.

[BibT_eX]

[DOI]

Waseem Daher

Proceedings of the 1st ACM Workshop on Security and Artificial Intelligence, 2008

2007

Chosen-Ciphertext Security from Identity-Based Encryption.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

On the Role of Scheduling in Simulation-Based Security.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2007

Obtaining Universally Composable Security: Towards the Bare Bones of Trust.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2007

Universally Composable Security with Global Setup.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007

Cryptography from Sunspots: How to Use an Imperfect Reference String.

[BibT_eX]

[DOI]

Rafael Pass

Abhi Shelat

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, 2007

Compositional Security for Task-PIOAs.

[BibT_eX]

[DOI]

Proceedings of the 20th IEEE Computer Security Foundations Symposium, 2007

Amplifying Collision Resistance: A Complexity-Theoretic Treatment.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2007

Chosen-ciphertext secure proxy re-encryption.

[BibT_eX]

[DOI]

Susan Hohenberger

Proceedings of the 2007 ACM Conference on Computer and Communications Security, 2007

Obtaining Universally Compoable Security: Towards the Bare Bones of Trust.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2007

2006

Security and composition of cryptographic protocols: a tutorial (part I).

[BibT_eX]

[DOI]

SIGACT News, 2006

Security and Composition of Cryptographic Protocols: A Tutorial.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2006

Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 20th International Symposium, 2006

Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols.

[BibT_eX]

[DOI]

Jonathan Herzog

Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

Mitigating Dictionary Attacks on Password-Protected Local Storage.

[BibT_eX]

[DOI]

Michael Steiner

Proceedings of the Advances in Cryptology, 2006

2005

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

[BibT_eX]

[DOI]

RFC, June, 2005

Multicast Security (MSEC) Group Key Management Architecture.

[BibT_eX]

[DOI]

Mark Baugher

Lakshminath R. Dondeti

Fredrik Lindholm

RFC, April, 2005

Decisional Diffie-Hellman Assumption.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Cryptography and Security, 2005

Preface.

[BibT_eX]

[DOI]

J. Cryptol., 2005

Using Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2005

Hardness Amplification of Weakly Verifiable Puzzles.

[BibT_eX]

[DOI]

Michael Steiner

Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Adaptively-Secure, Non-interactive Public-Key Encryption.

[BibT_eX]

[DOI]

Jonathan Katz

Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Universally Composable Password-Based Key Exchange.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2005

Secure Computation Without Authentication.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2005

2004

Just fast keying: Key agreement in a hostile internet.

[BibT_eX]

[DOI]

ACM Trans. Inf. Syst. Secur., 2004

Adaptive versus Non-Adaptive Security of Multi-Party Protocols.

[BibT_eX]

[DOI]

J. Cryptol., 2004

Universally Composable Symbolic Analysis of Cryptographic Protocols (The case of encryption-based mutual authentication and key exchange).

[BibT_eX]

[DOI]

Jonathan Herzog

IACR Cryptol. ePrint Arch., 2004

On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

Universally Composable Protocols with Relaxed Set-Up Assumptions.

[BibT_eX]

[DOI]

Proceedings of the 45th Symposium on Foundations of Computer Science, 2004

Chosen-Ciphertext Security from Identity-Based Encryption.

[BibT_eX]

[DOI]

Jonathan Katz

Proceedings of the Advances in Cryptology, 2004

Universally Composable Signature, Certification, and Authentication.

[BibT_eX]

[DOI]

Proceedings of the 17th IEEE Computer Security Foundations Workshop, 2004

2003

Universally Composable Signatures, Certification and Authentication.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2003

On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions.

[BibT_eX]

[DOI]

Eyal Kushilevitz

Yehuda Lindell

Proceedings of the Advances in Cryptology, 2003

A Forward-Secure Public-Key Encryption Scheme.

[BibT_eX]

[DOI]

Jonathan Katz

Proceedings of the Advances in Cryptology, 2003

Authenticating Mandatory Access Controls and Preserving Privacy for a High-Assurance Smart Card.

[BibT_eX]

[DOI]

Proceedings of the Computer Security, 2003

Universal Composition with Joint State.

[BibT_eX]

[DOI]

Tal Rabin

Proceedings of the Advances in Cryptology, 2003

Relaxing Chosen-Ciphertext Security.

[BibT_eX]

[DOI]

Jesper Buus Nielsen

Proceedings of the Advances in Cryptology, 2003

2002

Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds.

[BibT_eX]

[DOI]

SIAM J. Comput., 2002

Universally composable two-party and multi-party secure computation.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

A Two Layered Approach for Securing an Object Store Network.

[BibT_eX]

[DOI]

Proceedings of the First International IEEE Security in Storage Workshop, 2002

Environmental Requirements for Authentication Protocols.

[BibT_eX]

[DOI]

Catherine Meadows

Paul F. Syverson

Proceedings of the Software Security -- Theories and Systems, 2002

Universally Composable Notions of Key Exchange and Secure Channels.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2002

2001

A unified framework for analyzing security of protocols

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2001

Black-box concurrent zero-knowledge requires Omega~(log n) rounds.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Efficient, DoS-Resistant, Secure Key Exchange for Internet Protocols.

[BibT_eX]

[DOI]

Proceedings of the Security Protocols, 2001

Selective private function evaluation with applications to private statistics.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

Efficient and Secure Source Authentication for Multicast.

[BibT_eX]

[DOI]

Proceedings of the Network and Distributed System Security Symposium, 2001

Universally Composable Security: A New Paradigm for Cryptographic Protocols.

[BibT_eX]

[DOI]

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2001

On Adaptive vs. Non-adaptive Security of Multiparty Protocols.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2001

Relating Cryptography and Cryptographic Protocols.

[BibT_eX]

[DOI]

Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW-14 2001), 2001

Universally Composable Commitments.

[BibT_eX]

[DOI]

Marc Fischlin

Proceedings of the Advances in Cryptology, 2001

2000

Security and Composition of Multiparty Cryptographic Protocols.

[BibT_eX]

[DOI]

J. Cryptol., 2000

Resettable zero-knowledge (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Efficient Authentication and Signing of Multicast Streams over Lossy Channels.

[BibT_eX]

[DOI]

Proceedings of the 2000 IEEE Symposium on Security and Privacy, 2000

An IPSec-based Host Architecture for Secure Internet Multicast.

[BibT_eX]

[DOI]

Pau-Chen Cheng

Frederique Giraud

Dimitrios E. Pendarakis

Josyula R. Rao

Pankaj Rohatgi

Debanjan Saha

Proceedings of the Network and Distributed System Security Symposium, 2000

Exposure-Resilient Functions and All-or-Nothing Transforms.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2000

1999

Resettable Zero-Knowledge.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1999

Secure Computation with Honest-Looking Parties: What If Nobody Is Truly Honest? (Extended Abstract).

[BibT_eX]

[DOI]

Rafail Ostrovsky

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Multicast Security: A Taxonomy and Some Efficient Constructions.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM '99, 1999

Efficient Communication-Storage Tradeoffs for Multicast Encryption.

[BibT_eX]

[DOI]

Tal Malkin

Kobbi Nissim

Proceedings of the Advances in Cryptology, 1999

An Efficient <i>Threshold</i> Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack.

[BibT_eX]

[DOI]

Shafi Goldwasser

Proceedings of the Advances in Cryptology, 1999

Adaptive Security for Threshold Cryptosystems.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1999

1998

Randomness versus Fault-Tolerance.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 1998

The Random Oracle Methodology, Revisited.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 1998

Security and Composition of Multi-party Cryptographic Protocols.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 1998

A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 1998

Perfectly One-Way Probabilistic Hash Functions (Preliminary Version).

[BibT_eX]

[DOI]

Daniele Micciancio

Omer Reingold

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

The Random Oracle Methodology, Revisited (Preliminary Version).

[BibT_eX]

[DOI]

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).

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

1997

HMAC: Keyed-Hashing for Message Authentication.

[BibT_eX]

[DOI]

RFC, February, 1997

Randomness vs. Fault-Tolerance.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

Maintaining Authenticated Communication in the Presence of Break-ins.

[BibT_eX]

[DOI]

Amir Herzberg

Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

Deniable Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1997

Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1997

1996

More on BPP and the Polynomial-Time Hierarchy.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1996

Incoercible Multiparty Computation.

[BibT_eX]

[DOI]

Rosario Gennaro

IACR Cryptol. ePrint Arch., 1996

Adaptively Secure Multi-Party Computation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Incoercible Multiparty Computation (extended abstract).

[BibT_eX]

[DOI]

Rosario Gennaro

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

Pseudorandom Functions Revisited: The Cascade Construction and Its Concrete Security.

[BibT_eX]

[DOI]

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

Keying Hash Functions for Message Authentication.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1996

1995

Lower Bounds for Sampling Algorithms for Estimating the Average.

[BibT_eX]

[DOI]

Guy Even

Inf. Process. Lett., 1995

Bounding the power of preemption in randomized scheduling.

[BibT_eX]

[DOI]

Sandy Irani

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Bandwidth allocation with preemption.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1994

Maintaining Security in the Presence of Transient Faults.

[BibT_eX]

[DOI]

Amir Herzberg

Proceedings of the Advances in Cryptology, 1994

1993

Fast asynchronous Byzantine agreement with optimal resilience.

[BibT_eX]

[DOI]

Tal Rabin

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Asynchronous secure computation.

[BibT_eX]

[DOI]

Michael Ben-Or

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

1991

The parallel C (pC) programming language.

[BibT_eX]

[DOI]

IBM J. Res. Dev., 1991

1990

Bounds on Tradeoffs between Randomness and Communication Complexity

[BibT_eX]

[DOI]