Tel Aviv University
|Professor
Israel
→
Rafael Pass
Work
Cornell Tech
|Professor
US
→
Cornell Tech
|Associate Professor
US
→
Cornell University
|Associate Professor
US
→
Cornell University
|Assistant Professor
US
→
Education
Massachusetts Institute of Technology
United States of America
→
Ph.D
Publications
Communication complexity of byzantine agreement, revisited
Distributed Computing
journal-article
Incrementally Verifiable Computation via Rate-1 Batch Arguments
Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
conference-paper
Locality-Preserving Oblivious RAM
Journal of Cryptology
journal-article
ONE-WAY FUNCTIONS AND (IM)PERFECT OBFUSCATION
SIAM Journal on Computing
journal-article
On One-Way Functions from NP-Complete Problems
Leibniz International Proceedings in Informatics, LIPIcs
conference-paper
On the Complexity of Compressing Obfuscation
Journal of Cryptology
journal-article
Parallelizable Delegation from LWE
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Universal Reductions: Reductions Relative to Stateful Oracles
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Characterizing Derandomization Through Hardness of Levin-Kolmogorov Complexity
Leibniz International Proceedings in Informatics, LIPIcs
conference-paper
Concurrently Composable Non-interactive Secure Computation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Preface
OpenAccess Series in Informatics
conference-paper
Cryptography from sublinear-time average-case hardness of time-bounded Kolmogorov complexity
Proceedings of the Annual ACM Symposium on Theory of Computing
conference-paper
Indistinguishability obfuscation from circular security
Proceedings of the Annual ACM Symposium on Theory of Computing
conference-paper
Non-malleable Codes for Bounded Parallel-Time Tampering
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Non-malleable Time-Lock Puzzles and Applications
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
On the Possibility of Basing Cryptography on EXP≠ BPP
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Sequential Equilibrium in Games of Imperfect Recall
ACM Transactions on Economics and Computation
journal-article
Unprovability of leakage-resilient cryptography beyond the information-theoretic limit
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Bucket oblivious sort: An extremely simple oblivious sort
arXiv
other
Continuous verifiable delay functions
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Impossibility of strong kdm security with auxiliary input
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Is it easier to prove theorems that are guaranteed to be true?
Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
conference-paper
On One-way functions and kolmogorov complexity
arXiv
other
On one-way functions and kolmogorov complexity
Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
conference-paper
On the Adaptive Security of MACs and PRFs
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Preface
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Preface
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Preface
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Sparks: Succinct parallelizable arguments of knowledge
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Sublinear-Round Byzantine Agreement Under Corrupt Majority
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Succinct Non-interactive Secure Computation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
SIAM Journal on Computing
journal-article
Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
A Conceptually Well-Founded Characterization of Iterated Admissibility Using an “All I Know” Operator
arXiv
other
A conceptually well-founded characterization of iterated admissibility using an “all I know” operator
Electronic Proceedings in Theoretical Computer Science, EPTCS
conference-paper
Blind certificate authorities
Proceedings - IEEE Symposium on Security and Privacy
conference-paper
Communication complexity of byzantine agreement, revisited
Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
conference-paper
Consensus through herding
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Is it easier to prove theorems that are guaranteed to be true?
arXiv
other
Locality-preserving oblivious RAM
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Minimizing Trust in Hardware Wallets with Two Factor Signatures
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
On the Existence of Nash Equilibrium in Games with Resource-Bounded Players
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Paradoxes in fair computer-aided decision making
AIES 2019 - Proceedings of the 2019 AAAI/ACM Conference on AI, Ethics, and Society
conference-paper
Sequential equilibrium in computational games
ACM Transactions on Economics and Computation
journal-article
Snow White: Robustly Reconfigurable Consensus and Applications to Provably Secure Proof of Stake
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Synchronous, with a Chance of Partition Tolerance
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
The truth behind the myth of the Folk theorem
Games and Economic Behavior
journal-article
On the security loss of unique signatures
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Thunderella: Blockchains with optimistic instant confirmation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Communication complexity of byzantine agreement, revisited
arXiv
other
Game theoretic notions of fairness in multi-party coin toss
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Achieving fair treatment in algorithmic classification
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Game theory with translucent players
International Journal of Game Theory
journal-article
Indistinguishability obfuscation for ram programs and succinct randomized encodings
SIAM Journal on Computing
journal-article
On the complexity of compressing obfuscation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Hybrid consensus: Efficient consensus in the permissionless model
Leibniz International Proceedings in Informatics, LIPIcs
conference-paper
On the Impossibility of Cryptography with Tamperable Randomness
Algorithmica
journal-article
Paradoxes in fair computer-aided decision making
arXiv
other
Reasoning about rationality
Games and Economic Behavior
journal-article
Rethinking Large-Scale Consensus
Proceedings - IEEE Computer Security Foundations Symposium
conference-paper
Socially optimal mining pools
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
The sleepy model of consensus
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Socially optimal mining pools
arXiv
other
Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
Annual Symposium on Foundations of Computer Science - Proceedings
conference-paper
A knowledge-based analysis of the blockchain protocol
Electronic Proceedings in Theoretical Computer Science, EPTCS
conference-paper
A knowledge-based analysis of the blockchain protocol
arXiv
other
Analysis of the blockchain protocol in asynchronous networks
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Can we access a database both locally and privately?
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Formal abstractions for attested execution secure processors
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
FruitChains: A fair blockchain
Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
conference-paper
Oblivious parallel RAM and applications
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments
Computational Complexity
journal-article
Adaptive hardness and composable security in the plain model from standard assumptions
SIAM Journal on Computing
journal-article
Bayesian games with intentions
Electronic Proceedings in Theoretical Computer Science, EPTCS
conference-paper
Bounded KDM security from iO and OWF
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Computational extensive-form games
EC 2016 - Proceedings of the 2016 ACM Conference on Economics and Computation
conference-paper
Cryptography and game theory
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Sequential equilibrium in games of imperfect recall
Proceedings of the International Conference on Knowledge Representation and Reasoning
conference-paper
Impossibility of VBB obfuscation with ideal constant-degree graded encodings
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Indistinguishability obfuscation with non-trivial efficiency
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Lower bounds on assumptions behind indistinguishability obfuscation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Non-black-box simulation from one-way functions and applications to resettable security
SIAM Journal on Computing
journal-article
Output-compressing randomized encodings and applications
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Round-efficient concurrently composable secure computation via a robust extraction lemma
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Algorithmic rationality: Game theory with costly computation
Journal of Economic Theory
journal-article
An overview of ANONIZE: A large-scale anonymous survey system
IEEE Security and Privacy
journal-article
Constant-round concurrent zero-knowledge from indistinguishability obfuscation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Constant-round nonmalleable commitments from any one-way function
Journal of the ACM
journal-article
From weak to Strong Zero-knowledge and applications
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Large-scale secure computation: Multi-party computation for (parallel) RAM programs
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Limits of extractability assumptions with distributional auxiliary input
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Micropayments for Decentralized Currencies
Proceedings of the ACM Conference on Computer and Communications Security
conference-paper
Outlier privacy
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Succinct randomized encodings and their applications
Proceedings of the Annual ACM Symposium on Theory of Computing
conference-paper
Tight Revenue Bounds With Possibilistic Beliefs and Level-k Rationality
Econometrica
journal-article
Tight parallel repetition theorems for public-coin arguments using kl-divergence
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
4-round resettably-sound zero knowledge
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
ANONIZE: A large-scale anonymous survey system
Proceedings - IEEE Symposium on Security and Privacy
conference-paper
Axiomatizing rationality
Proceedings of the International Conference on Knowledge Representation and Reasoning
conference-paper
Concurrent zero knowledge, revisited
Journal of Cryptology
journal-article
Decision theory with resource-bounded agents
Topics in Cognitive Science
journal-article
Indistinguishability obfuscation from semantically-secure multilinear encodings
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Not just an empty threat: Subgame-perfect equilibrium in repeated games played by computationally bounded players
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
On extractability obfuscation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
On the impossibility of black-box transformations in mechanism design
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
On the impossibility of cryptography with tamperable randomness
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
One-way functions and (im)perfect obfuscation
Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
conference-paper
Statistically-secure ORAM with Õ(log2 n) overhead
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
The truth behind the myth of the folk theorem
ITCS 2014 - Proceedings of the 2014 Conference on Innovations in Theoretical Computer Science
conference-paper
Can theories be tested? A cryptographic treatment of forecast testing
ITCS 2013 - Proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science
conference-paper
Constant-round concurrent zero knowledge from P-certificates
Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
conference-paper
From unprovability to environmentally friendly protocols
Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
conference-paper
Game theory with translucent players
Proceedings of the 14th Conference on Theoretical Aspects of Rationality and Knowledge, TARK 2013
conference-paper
Knowledge-preserving interactive coding
Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
conference-paper
Language-based games
IJCAI International Joint Conference on Artificial Intelligence
conference-paper
Language-based games
Proceedings of the 14th Conference on Theoretical Aspects of Rationality and Knowledge, TARK 2013
conference-paper
Non-black-box simulation from one-way functions and applications to resettable security
Proceedings of the Annual ACM Symposium on Theory of Computing
conference-paper
On the power of many one-bit provers
ITCS 2013 - Proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science
conference-paper
On the power of nonuniformity in proofs of security
ITCS 2013 - Proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science
conference-paper
Public-coin parallel zero-knowledge for NP
Journal of Cryptology
journal-article
Randomness-dependent message security
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Sequential equilibrium in computational games
IJCAI International Joint Conference on Artificial Intelligence
conference-paper
Simultaneous resettability from one-way functions
Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
conference-paper
Unprovable security of perfect NIZK and non-interactive non-malleable commitments
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Conservative belief and rationality
Games and Economic Behavior
journal-article
A parallel repetition theorem for constant-round Arthur-Merlin Proofs
ACM Transactions on Computation Theory
journal-article
A unified framework for UC from only OT
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Black-box constructions of composable protocols without set-up
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Crowd-blending privacy
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
I'm doing as well as I can: Modeling people as rational finite automata
Proceedings of the National Conference on Artificial Intelligence
conference-paper
Iterated regret minimization: A new solution concept
Games and Economic Behavior
journal-article
Multi-verifier signatures
Journal of Cryptology
journal-article
The curious case of non-interactive commitments - On the power of black-box vs. non-black-box use of primitives
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
The knowledge tightness of parallel zero-knowledge
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Approximately strategy-proof voting
IJCAI International Joint Conference on Artificial Intelligence
conference-paper
Concurrent non-malleable zero knowledge with adaptive inputs
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Concurrent security and non-malleability
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Constant-round non-malleable commitments from any one-way function
Proceedings of the Annual ACM Symposium on Theory of Computing
conference-paper
Limits of provable security from standard assumptions
Proceedings of the Annual ACM Symposium on Theory of Computing
conference-paper
On the composition of public-coin zero-knowledge protocols
SIAM Journal on Computing
journal-article
Reasoning about justified belief
ACM International Conference Proceeding Series
conference-paper
Secure computation without authentication
Journal of Cryptology
journal-article
The randomness complexity of parallel repetition
Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
conference-paper
Towards non-black-box lower bounds in cryptography
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Towards privacy for social networks: A zero-knowledge based definition of privacy
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Adaptive hardness and composable security in the plain model from standard assumptions
Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
conference-paper
An efficient parallel repetition theorem
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Concurrent non-malleable zero knowledge proofs
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Constant-round non-malleable commitments from sub-exponential one-way functions
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Eye for an eye: Efficient concurrent zero-knowledge in the timing model
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
I don't want to think about it now: Decision theory with costly computation
Proceedings of the International Conference on Knowledge Representation and Reasoning
conference-paper
Private coins versus public coins in zero-knowledge proof systems
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
A logical characterization of iterated admissibility
Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge, TARK '09
conference-paper
A unified framework for concurrent security: Universal composability from stand-alone non-malleability
Proceedings of the Annual ACM Symposium on Theory of Computing
conference-paper
An epistemic characterization of zero knowledge
Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge, TARK '09
conference-paper
Black-box constructions of two-party protocols from one-way functions
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Iterated regret minimization: A new solution concept
IJCAI International Joint Conference on Artificial Intelligence
conference-paper
Non-malleability amplification
Proceedings of the Annual ACM Symposium on Theory of Computing
conference-paper
On the composition of public-coin zero-knowledge protocols
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Adaptive one-way functions and applications
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Concurrent non-malleable commitments from any one-way function
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
New and improved constructions of nonmalleable cryptographic protocols
SIAM Journal on Computing
journal-article
On constant-round concurrent zero-knowledge
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Precise concurrent zero knowledge
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
An efficient parallel repetition theorem for Arthur-Merlin games
Proceedings of the Annual ACM Symposium on Theory of Computing
conference-paper
Bounded CCA2-secure encryption
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Concurrent nonmalleable commitments
SIAM Journal on Computing
journal-article
Cryptography from sunspots: How to use an imperfect reference string
Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
conference-paper
Relations among notions of non-malleability for encryption
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Universally composable security with global setup
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Construction of a non-malleable encryption scheme from any semantically secure one
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Input-indistinguishable computation
Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
conference-paper
Local zero knowledge
Proceedings of the Annual ACM Symposium on Theory of Computing
conference-paper
Parallel repetition of zero-knowledge proofs and the possibility of basing cryptography on NP-hardness
Proceedings of the Annual IEEE Conference on Computational Complexity
conference-paper
Secure computation without authentication
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Unconditional characterizations of non-interactive zero-knowledge
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Concurrent non-malleable commitments
Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
conference-paper
New and improved constructions of non-malleable cryptographic protocols
Proceedings of the Annual ACM Symposium on Theory of Computing
conference-paper
Bounded-concurrent secure multi-party computation with a dishonest majority
Conference Proceedings of the Annual ACM Symposium on Theory of Computing
conference-paper
On the possibility of one-message weak zero-knowledge
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Universally composable protocols with relaxed set-up assumptions
Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
conference-paper
Bounded-concurrent secure two-party computation in a constant number of rounds
Annual Symposium on Foundations of Computer Science - Proceedings
conference-paper
Bounded-concurrent secure two-party computation in a constant number of rounds
Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
conference-paper
On deniability in the common reference string and random oracle model
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book
Simulation in quasi-polynomial time, and its application to protocol composition
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
book