Private coins versus public coins in interactive proof systems
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Achieving independence in logarithmic number of rounds
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Minimum disclosure proofs of knowledge
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Zero-knowledge proofs of identity
Journal of Cryptology
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Optimal algorithms for Byzantine agreement
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Minimum-knowledge interactive proofs for decision problems
SIAM Journal on Computing
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Verifiable secret sharing and multiparty protocols with honest majority
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Pseudo-random generators under uniform assumptions
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The round complexity of secure protocols
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Communications of the ACM
Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Multiparty Protocols Tolerating Half Faulty Processors
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Fair Computation of General Functions in Presence of Immoral Majority
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Foundations of Secure Interactive Computing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
On Defining Proofs of Knowledge
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Security, fault tolerance, and communication complexity in distributed systems
Security, fault tolerance, and communication complexity in distributed systems
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Random self-reducibility and zero knowledge interactive proofs of possession of information
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Multiparty computation with faulty majority
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Simple forward-secure signatures from any signature scheme
Proceedings of the 7th ACM conference on Computer and communications security
Adaptive Security for Threshold Cryptosystems
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
On Adaptive vs. Non-adaptive Security of Multiparty Protocols
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Adaptively Secure Oblivious Transfer
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Threshold Cryptosystems Based on Factoring
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Introduction to Secure Computation
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
Adaptive Security for the Additive-Sharing Based Proactive RSA
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Optimal resilient threshold GQ signatures
Information Sciences: an International Journal
On expected constant-round protocols for Byzantine agreement
Journal of Computer and System Sciences
Adaptively Secure Two-Party Computation with Erasures
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Non-committing Encryptions Based on Oblivious Naor-Pinkas Cryptosystems
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
Forward-security in private-key cryptography
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Credential authenticated identification and key exchange
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Adaptive and composable non-committing encryptions
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Public-key encryptions tolerating adaptive and composable adversaries
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
A non-committing encryption scheme based on quadratic residue
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Intrusion-Resilient secure channels
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Adaptively-secure, non-interactive public-key encryption
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Encryption schemes secure against chosen-ciphertext selective opening attacks
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
On expected constant-round protocols for byzantine agreement
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Trading static for adaptive security in universally composable zero-knowledge
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
We introduce new techniques for generating and reasoning about protocols. These techniques are based on protocol transformations that depend on the nature of the adversaries under consideration. We propose a set of definitions that, captures and unifies the intuitive notions of correctness, privacy, and robustness, and enables us to give concise and modular proofs that our protocols possess these desirable properties. Using these techniques, whose major purpose is to greatly simplify the design and verification of cryptographic protocols, we show how to construct a multiparty cryptographic protocol to compute any given feasible function of the parties' inputs. We prove that our protocol is secure against the malicious actions of any adversary, limited to feasible computation, but with the power to eavesdrop on all messages and to corrupt any dynamically chosen minority of the parties. This is the first proof of security against dynamic adversaries in the "cryptographic" model of multiparty protocols. We assume the existeuce of a one-way function and allow the participants to erase small portions of memory. Our result combines the superior resilience of the cryptographic setting of [GMW87] with the stronger (dynamic) fault pattern of the "non-cryptographic" setting of [BGW88, CCD88].