A randomized protocol for signing contracts
Communications of the ACM
Limits on the security of coin flips when half the processors are faulty
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
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
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Verifiable secret sharing and multiparty protocols with honest majority
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Uses of randomness in algorithms and protocols
Uses of randomness in algorithms and protocols
Multiparty computation with faulty majority
CRYPTO '89 Proceedings on Advances in cryptology
Communications of the ACM
Gradual and Verifiable Release of a Secret
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
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
How to Solve any Protocol Problem - An Efficiency Improvement
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Direct Minimum-Knowledge Computations
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Multiparty cryptographic computation: techniques and applications
Multiparty cryptographic computation: techniques and applications
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
A robust and verifiable cryptographically secure election scheme
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Verifiable secret sharing and achieving simultaneity in the presence of faults
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Information theoretic reductions among disclosure problems
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Achieving oblivious transfer using weakened security assumptions
SFCS '88 Proceedings of the 29th 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
Asynchronous secure computation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Practical and provably secure release of a secret and exchange of signatures
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
One-way accumulators: a decentralized alternative to digital signatures
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
How to simultaneously exchange secrets by general assumptions
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Correlated pseudorandomness and the complexity of private computations
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Adaptively secure multi-party computation
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Multi party computations: past and present
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Randomness vs. fault-tolerance
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Designs, Codes and Cryptography
Secure computation with honest-looking parties (extended abstract): what if nobody is truly honest?
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Composition and integrity preservation of secure reactive systems
Proceedings of the 7th ACM conference on Computer and communications security
Escrow services and incentives in peer-to-peer networks
Proceedings of the 3rd ACM conference on Electronic Commerce
Universally composable two-party and multi-party secure computation
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Secure multi-party quantum computation
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Detectable byzantine agreement secure against faulty majorities
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Secure Computation without Agreement
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Parallel Reducibility for Information-Theoretically Secure Computation
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Optimistic Fair Secure Computation
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Oblivious Transfer in the Bounded Storage Model
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Minimal Complete Primitives for Secure Multi-party Computation
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Universally Composable Commitments
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Efficient Multiparty Protocols Using Circuit Randomization
CRYPTO '91 Proceedings of the 11th 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
Committed Oblivious Transfer and Private Multi-Party Computation
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: 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
Universally Composable Notions of Key Exchange and Secure Channels
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications 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
Anonymous Fingerprinting Based on Committed Oblivious Transfer
PKC '99 Proceedings of the Second International Workshop on Practice and Theory in Public Key Cryptography
Bounded-concurrent secure two-party computation without setup assumptions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A composable cryptographic library with nested operations
Proceedings of the 10th ACM conference on Computer and communications security
Cryptography and cryptographic protocols
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Proceedings of the 2003 workshop on New security paradigms
Bounded-concurrent secure multi-party computation with a dishonest majority
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Completely fair SFE and coalition-safe cheap talk
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Information-theoretically secure protocols and security under composition
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Orchestrating fair exchanges between mutually distrustful web services
Proceedings of the 3rd ACM workshop on Secure web services
On achieving the "best of both worlds" in secure multiparty computation
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
The reactive simulatability (RSIM) framework for asynchronous systems
Information and Computation
Complete fairness in secure two-party computation
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Composable Formal Security Analysis: Juggling Soundness, Simplicity and Efficiency
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Statistical Security Conditions for Two-Party Secure Function Evaluation
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Journal of Computer Security - 20th IEEE Computer Security Foundations Symposium (CSF)
Constructions of truly practical secure protocols using standardsmartcards
Proceedings of the 15th ACM conference on Computer and communications security
Proceedings of the forty-first annual ACM symposium on Theory of computing
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
Local Sequentiality Does Not Help for Concurrent Composition
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Verifiable Threshold Secret Sharing and Full Fair Secure Two-Party Computation
AST '09 Proceedings of the 2009 International e-Conference on Advanced Science and Technology
Journal of Computer Security - 18th IEEE Computer Security Foundations Symposium (CSF 18)
Cryptographic protocols provably secure against dynamic adversaries
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Efficient multiparty computations secure against an adaptive adversary
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Universally composable security with global setup
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Security against covert adversaries: efficient protocols for realistic adversaries
TCC'07 Proceedings of the 4th conference on Theory of cryptography
On the necessity of rewinding in secure multiparty computation
TCC'07 Proceedings of the 4th conference on Theory of cryptography
On the limitations of universally composable two-party computation without set-up assumptions
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Fair secure two-party computation
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Round efficiency of multi-party computation with a dishonest majority
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Obtaining universally compoable security: towards the bare bones of trust
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Efficient fully-simulatable oblivious transfer
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
Legally-enforceable fairness in secure two-party computation
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Bridging game theory and cryptography: recent results and future directions
TCC'08 Proceedings of the 5th conference on Theory of cryptography
P4P: practical large-scale privacy-preserving distributed computation robust against malicious users
USENIX Security'10 Proceedings of the 19th USENIX conference on Security
Information-Theoretically Secure Protocols and Security under Composition
SIAM Journal on Computing
Secure two-party computation via cut-and-choose oblivious transfer
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Completeness theorems with constructive proofs for finite deterministic 2-party functions
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Towards a game theoretic view of secure computation
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
1/p-Secure multiparty computation without honest majority and the best of both worlds
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Complete Fairness in Secure Two-Party Computation
Journal of the ACM (JACM)
On Achieving the “Best of Both Worlds” in Secure Multiparty Computation
SIAM Journal on Computing
A non-committing encryption scheme based on quadratic residue
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
A topological condition for solving fair exchange in byzantine environments
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
A sender verifiable mix-net and a new proof of a shuffle
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Efficient privacy-preserving protocols for multi-unit auctions
FC'05 Proceedings of the 9th international conference on Financial Cryptography and Data Security
Fairness and correctness in case of a premature abort
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Justifying a dolev-yao model under active attacks
Foundations of Security Analysis and Design III
Universally composable DKG with linear number of exponentiations
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
Limits of the cryptographic realization of dolev-yao-style XOR
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Soundness of formal encryption in the presence of key-cycles
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
The marriage proposals problem: fair and efficient solution for two-party computations
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Text search protocols with simulation based security
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Partial fairness in secure two-party computation
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Formal methods and cryptography
FM'06 Proceedings of the 14th international conference on Formal Methods
Random selection with an adversarial majority
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
On combining privacy with guaranteed output delivery in secure multiparty computation
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Communication-efficient distributed oblivious transfer
Journal of Computer and System Sciences
Efficient secure computation with garbled circuits
ICISS'11 Proceedings of the 7th international conference on Information Systems Security
Universally composable symbolic analysis of mutual authentication and key-exchange protocols
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Resource fairness and composability of cryptographic protocols
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Secure two-party computation with low communication
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Statistically secure linear-rate dimension extension for oblivious affine function evaluation
ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security
Universally composable security with local adversaries
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
| Hi-index | 0.00 |
This paper describes a method for n players, a majority of which may be faulty, to compute correctly, privately, and fairly any computable function f(x1,... ,xn) where xi, is the input of the i-th. player. The method uses as a building block an oblivious transfer primitive.Previous methods achieved these properties, only for boolean functions, which, in particular, precluded composition of such protocols.We also propose a simpler definition of security for multi-player protocols which still implies previous definitions of privacy and correctness.