Rafael Pass

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017

Two-Round Concurrent Non-Malleable Commitment from Time-Lock Puzzles.

[BibT_eX]

[DOI]

Pratik Soni

IACR Cryptol. ePrint Arch., 2017

Oblivious Computation with Data Locality.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Reasoning about rationality.

[BibT_eX]

[DOI]

Games Econ. Behav., 2017

A Knowledge-Based Analysis of the Blockchain Protocol.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Sixteenth Conference on Theoretical Aspects of Rationality and Knowledge, 2017

Socially Optimal Mining Pools.

[BibT_eX]

[DOI]

Ben Fisch

Proceedings of the Web and Internet Economics - 13th International Conference, 2017

Hybrid Consensus: Efficient Consensus in the Permissionless Model.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Distributed Computing, 2017

Can We Access a Database Both Locally and Privately?

[BibT_eX]

[DOI]

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

FruitChains: A Fair Blockchain.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles.

[BibT_eX]

[DOI]

Pratik Soni

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

Formal Abstractions for Attested Execution Secure Processors.

[BibT_eX]

[DOI]

Florian Tramèr

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

Analysis of the Blockchain Protocol in Asynchronous Networks.

[BibT_eX]

[DOI]

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

Rethinking Large-Scale Consensus.

[BibT_eX]

[DOI]

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

The Sleepy Model of Consensus.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016

Secure Channel Injection and Anonymous Proofs of Account Ownership.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

A Note on Black-Box Complexity of Indistinguishability Obfuscation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Snow White: Provably Secure Proofs of Stake.

[BibT_eX]

[DOI]

Iddo Bentov

IACR Cryptol. ePrint Arch., 2016

The Sleepy Model of Consensus.

[BibT_eX]

[DOI]

Iddo Bentov

IACR Cryptol. ePrint Arch., 2016

Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings.

[BibT_eX]

[DOI]

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

Lower Bounds on Assumptions Behind Indistinguishability Obfuscation.

[BibT_eX]

[DOI]

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

Output-Compressing Randomized Encodings and Applications.

[BibT_eX]

[DOI]

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

Oblivious Parallel RAM and Applications.

[BibT_eX]

[DOI]

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

Computational Extensive-Form Games.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Bounded KDM Security from iO and OWF.

[BibT_eX]

[DOI]

Antonio Marcedone

Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

Indistinguishability Obfuscation with Non-trivial Efficiency.

[BibT_eX]

[DOI]

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

Sequential Equilibrium in Games of Imperfect Recall.

[BibT_eX]

[DOI]

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, 2016

2015

Algorithmic rationality: Game theory with costly computation.

[BibT_eX]

[DOI]

J. Econ. Theory, 2015

Constant-Round Nonmalleable Commitments from Any One-Way Function.

[BibT_eX]

[DOI]

J. ACM, 2015

An Overview of ANONIZE: A Large-Scale Anonymous Survey System.

[BibT_eX]

[DOI]

IEEE Secur. Priv., 2015

How to Use SNARKs in Universally Composable Protocols.

[BibT_eX]

[DOI]

Charalampos Papamanthou

IACR Cryptol. ePrint Arch., 2015

Stronger Impossibility Results for Strategy-Proof Voting with i.i.d. Beliefs.

[BibT_eX]

[DOI]

Samantha Leung

CoRR, 2015

On the Non-Existence of Nash Equilibrium in Games with Resource-Bounded Players.

[BibT_eX]

[DOI]

Daniel Reichman

CoRR, 2015

Outlier Privacy.

[BibT_eX]

[DOI]

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

Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma.

[BibT_eX]

[DOI]

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

Tight Parallel Repetition Theorems for Public-Coin Arguments Using KL-Divergence.

[BibT_eX]

[DOI]

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

From Weak to Strong Zero-Knowledge and Applications.

[BibT_eX]

[DOI]

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

Succinct Randomized Encodings and their Applications.

[BibT_eX]

[DOI]

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

Voting with Coarse Beliefs.

[BibT_eX]

[DOI]

Samantha Leung

Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

Better Outcomes from More Rationality.

[BibT_eX]

[DOI]

Jing Chen

Silvio Micali

Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Micropayments for Decentralized Currencies.

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

Limits of Extractability Assumptions with Distributional Auxiliary Input.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

2014

Decision Theory with Resource-Bounded Agents.

[BibT_eX]

[DOI]

Top. Cogn. Sci., 2014

Concurrent Zero Knowledge, Revisited.

[BibT_eX]

[DOI]

J. Cryptol., 2014

Succinct Garbling Schemes and Applications.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Oblivious Parallel RAM.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Large-Scale Secure Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Not Just an Empty Threat: Subgame-Perfect Equilibrium in Repeated Games Played by Computationally Bounded Players.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

4-Round Resettably-Sound Zero Knowledge.

[BibT_eX]

[DOI]

Rafail Ostrovsky

Ivan Visconti

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

On Extractability Obfuscation.

[BibT_eX]

[DOI]

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

ANONIZE: A Large-Scale Anonymous Survey System.

[BibT_eX]

[DOI]

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

On the Impossibility of Black-Box Transformations in Mechanism Design.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

Axiomatizing Rationality.

[BibT_eX]

[DOI]

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, 2014

The truth behind the myth of the folk theorem.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science, 2014

One-Way Functions and (Im)Perfect Obfuscation.

[BibT_eX]

[DOI]

Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

On the Impossibility of Cryptography with Tamperable Randomness.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

Statistically-secure ORAM with Õ(log<sup>2</sup> n) Overhead.

[BibT_eX]

[DOI]

Zhenming Liu

Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

2013

Guest column: parallel repetition theorems for interactive arguments.

[BibT_eX]

[DOI]

SIGACT News, 2013

Public-Coin Parallel Zero-Knowledge for NP.

[BibT_eX]

[DOI]

J. Cryptol., 2013

Obfuscation from Semantically-Secure Multi-linear Encodings.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Interactive Coding, Revisited.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

A Simple ORAM.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Simultaneous Resettable WI from One-way Functions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

On the (Im)Possibility of Tamper-Resilient Cryptography: Using Fourier Analysis in Computer Viruses.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Conservative belief and rationality.

[BibT_eX]

[DOI]

Games Econ. Behav., 2013

Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead.

[BibT_eX]

[DOI]

Zhenming Liu

CoRR, 2013

Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments.

[BibT_eX]

[DOI]

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

Randomness-Dependent Message Security.

[BibT_eX]

[DOI]

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

Game Theory with Translucent Players.

[BibT_eX]

[DOI]

Proceedings of the 14th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2013), 2013

Language-based Games.

[BibT_eX]

[DOI]

Proceedings of the 14th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2013), 2013

Non-black-box simulation from one-way functions and applications to resettable security.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing Conference, 2013

Can theories be tested?: a cryptographic treatment of forecast testing.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science, 2013

On the power of nonuniformity in proofs of security.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science, 2013

On the power of many one-bit provers.

[BibT_eX]

[DOI]

Per Austrin

Johan Håstad

Proceedings of the Innovations in Theoretical Computer Science, 2013

Sequential Equilibrium in Computational Games.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2013, 2013

Knowledge-Preserving Interactive Coding.

[BibT_eX]

[DOI]

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

Simultaneous Resettability from One-Way Functions.

[BibT_eX]

[DOI]

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

Constant-Round Concurrent Zero Knowledge from P-Certificates.

[BibT_eX]

[DOI]

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

From Unprovability to Environmentally Friendly Protocols.

[BibT_eX]

[DOI]

Ran Canetti

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

2012

A Parallel Repetition Theorem for Constant-Round Arthur-Merlin Proofs.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2012

Multi-Verifier Signatures.

[BibT_eX]

[DOI]

Tom Roeder

Fred B. Schneider

J. Cryptol., 2012

The Curious Case of Non-Interactive Commitments.

[BibT_eX]

[DOI]

Mohammad Mahmoody

IACR Cryptol. ePrint Arch., 2012

Constant-Round Concurrent Zero Knowledge From Falsifiable Assumptions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Unprovable Security of Two-Message Zero Knowledge.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

The Knowledge Tightness of Parallel Zero-Knowledge.

[BibT_eX]

[DOI]

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

The Curious Case of Non-Interactive Commitments - On the Power of Black-Box vs. Non-Black-Box Use of Primitives.

[BibT_eX]

[DOI]

Mohammad Mahmoody

Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

Black-Box Constructions of Composable Protocols without Set-Up.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

Crowd-Blending Privacy.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

A Unified Framework for UC from Only OT.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

I'm Doing as Well as I Can: Modeling People as Rational Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

Algorithmic rationality: adding cost of computation to game theory.

[BibT_eX]

[DOI]

SIGecom Exch., 2011

I Don't Want to Think About it Now:Decision Theory With Costly Computation

[BibT_eX]

[DOI]

CoRR, 2011

Towards Non-Black-Box Lower Bounds in Cryptography.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

Concurrent Security and Non-malleability.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

Concurrent Non-Malleable Zero Knowledge with Adaptive Inputs.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

Towards Privacy for Social Networks: A Zero-Knowledge Based Definition of Privacy.

[BibT_eX]

[DOI]

Johannes Gehrke

Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

Reasoning about justified belief.

[BibT_eX]

[DOI]

Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2011), 2011

Limits of provable security from standard assumptions.

[BibT_eX]

[DOI]

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Constant-round non-malleable commitments from any one-way function.

[BibT_eX]

[DOI]

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Renegotiation-Safe Protocols.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Computer Science, 2011

Approximately Strategy-Proof Voting.

[BibT_eX]

[DOI]

Eleanor Birrell

Proceedings of the IJCAI 2011, 2011

The Randomness Complexity of Parallel Repetition.

[BibT_eX]

[DOI]

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

Private Coins versus Public Coins in Zero-Knowledge Proof Systems.

[BibT_eX]

[DOI]

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

Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model.

[BibT_eX]

[DOI]

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

An Efficient Parallel Repetition Theorem.

[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]

Ran Canetti

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

Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions.

[BibT_eX]

[DOI]

Hoeteck Wee

Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

Concurrent Non-Malleable Zero Knowledge Proofs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2010

Game theory with costly computation: formulation and application to protocol security.

[BibT_eX]

[DOI]

Joe Halpern

Proceedings of the Behavioral and Quantitative Game Theory, 2010

2009

Black-Box Constructions of Two-Party Protocols from One-Way Functions.

[BibT_eX]

[DOI]

Hoeteck Wee

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

An epistemic characterization of zero knowledge.

[BibT_eX]

[DOI]

Vasumathi Raman

Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2009), 2009

A logical characterization of iterated admissibility.

[BibT_eX]

[DOI]

Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2009), 2009

A unified framework for concurrent security: universal composability from stand-alone non-malleability.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Non-malleability amplification.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Iterated Regret Minimization: A New Solution Concept.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2009, 2009

On the Composition of Public-Coin Zero-Knowledge Protocols.

[BibT_eX]

[DOI]

Douglas Wikström

Proceedings of the Advances in Cryptology, 2009

2008

New and Improved Constructions of Nonmalleable Cryptographic Protocols.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

Concurrent Nonmalleable Commitments.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

Iterated Regret Minimization: A More Realistic Solution Concept

[BibT_eX]

[DOI]

CoRR, 2008

Game Theory with Costly Computation

[BibT_eX]

[DOI]

CoRR, 2008

On Constant-Round Concurrent Zero-Knowledge.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Concurrent Non-malleable Commitments from Any One-Way Function.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Precise Concurrent Zero Knowledge.

[BibT_eX]

[DOI]

Omkant Pandey

Amit Sahai

Proceedings of the Advances in Cryptology, 2008

Adaptive One-Way Functions and Applications.

[BibT_eX]

[DOI]

Omkant Pandey

Vinod Vaikuntanathan

Proceedings of the Advances in Cryptology, 2008

2007

Universally Composable Security with Global Setup.

[BibT_eX]

[DOI]

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

An efficient parallel repetition theorem for Arthur-Merlin games.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

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

[BibT_eX]

[DOI]

Ran Canetti

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

Relations Among Notions of Non-malleability for Encryption.

[BibT_eX]

[DOI]

Vinod Vaikuntanathan

Proceedings of the Advances in Cryptology, 2007

Bounded CCA2-Secure Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2007

2006

A precise computational approach to knowledge.

[BibT_eX]

[DOI]

PhD thesis, 2006

Local zero knowledge.

[BibT_eX]

[DOI]

Silvio Micali

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Input-Indistinguishable Computation.

[BibT_eX]

[DOI]

Silvio Micali

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, 2006

Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One.

[BibT_eX]

[DOI]

Vinod Vaikuntanathan

Proceedings of the Advances in Cryptology, 2006

Parallel Repetition of Zero-Knowledge Proofs and the Possibility of Basing Cryptography on NP-Hardness.

[BibT_eX]

[DOI]

Proceedings of the 21st Annual IEEE Conference on Computational Complexity (CCC 2006), 2006

2005

New and improved constructions of non-malleable cryptographic protocols.

[BibT_eX]

[DOI]

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Concurrent Non-Malleable Commitments.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005

Unconditional Characterizations of Non-interactive Zero-Knowledge.

[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

On the Possibility of One-Message Weak Zero-Knowledge.

[BibT_eX]

[DOI]

Boaz Barak

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

Bounded-concurrent secure multi-party computation with a dishonest majority.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Universally Composable Protocols with Relaxed Set-Up Assumptions.

[BibT_eX]

[DOI]

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

2003

Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds.

[BibT_eX]

[DOI]

Proceedings of the 44th Symposium on Foundations of Computer Science, 2003

Simulation in Quasi-Polynomial Time, and Its Application to Protocol Composition.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2003

On Deniability in the Common Reference String and Random Oracle Model.

[BibT_eX]

[DOI]