STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of 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
Optimal algorithms for Byzantine agreement
STOC '88 Proceedings of the twentieth 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
Robust sharing of secrets when the dealer is honest or cheating
Journal of the ACM (JACM)
Adaptively secure multi-party computation
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Fair Computation of General Functions in Presence of Immoral Majority
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Protocols for secure computations
SFCS '82 Proceedings of the 23rd 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
On the complexity of verifiable secret sharing and multiparty computation
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
From partial consistency to global broadcast
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The round complexity of verifiable secret sharing and secure multicast
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Asynchronous Perfectly Secure Computation Tolerating Generalized Adversaries
ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
Adaptive Security for Threshold Cryptosystems
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Robustness for Free in Unconditional Multi-party Computation
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
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Secure Distributed Linear Algebra in a Constant Number of Rounds
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
On 2-Round Secure Multiparty Computation
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Efficient Asynchronous Secure Multiparty Distributed Computation
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
Mix and Match: Secure Function Evaluation via Ciphertexts
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Efficient Secure Multi-party Computation
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Traffic Analysis Attacks and Trade-Offs in Anonymity Providing Systems
IHW '01 Proceedings of the 4th International Workshop on Information Hiding
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Robust Distributed Multiplicaton with out Interaction
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Adaptive Security in the Threshold Setting: From Cryptosystems to Signature Schemes
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Information-theoretically secure protocols and security under composition
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Secure multi-party computation made simple
Discrete Applied Mathematics - Special issue: Coding and cryptography
Anonymous communications in the Internet
Cluster Computing
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Secure Computation from Random Error Correcting Codes
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Round-Efficient Secure Computation in Point-to-Point Networks
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Round Efficient Unconditionally Secure Multiparty Computation Protocol
INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
MPC vs. SFE: Unconditional and Computational Security
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
On expected constant-round protocols for Byzantine agreement
Journal of Computer and System Sciences
Perfectly reliable and secure message transmission tolerating mobile adversary
International Journal of Applied Cryptography
On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Simple and efficient asynchronous byzantine agreement with optimal resilience
Proceedings of the 28th ACM symposium on Principles of distributed computing
Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
Secure multi-party computation made simple
Discrete Applied Mathematics - Special issue: Coding and cryptography
Adaptively secure threshold cryptography: introducing concurrency, removing erasures
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
General secure multi-party computation from any linear secret-sharing scheme
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Two-threshold broadcast and detectable multi-party computation
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Secure multi-party computation made simple
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Scalable and unconditionally secure multiparty computation
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Secure protocols with asymmetric trust
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Efficient Byzantine agreement with faulty minority
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Secure multiparty computation of DNF
ICICS'07 Proceedings of the 9th international conference on Information and communications security
Efficient simultaneous broadcast
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Hybrid-secure MPC: trading information-theoretic robustness for computational privacy
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Efficient statistical asynchronous verifiable secret sharing with optimal resilience
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
Secure multiparty computation with minimal interaction
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Communication optimal multi-valued asynchronous broadcast protocol
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
Multiparty computation with full computation power and reduced overhead
HASE'04 Proceedings of the Eighth IEEE international conference on High assurance systems engineering
International Journal of Applied Cryptography
Communication efficient statistical asynchronous multiparty computation with optimal resilience
Inscrypt'09 Proceedings of the 5th international conference on Information security and cryptology
Information-Theoretically Secure Protocols and Security under Composition
SIAM Journal on Computing
Adaptively secure non-interactive threshold cryptosystems
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
On Achieving the “Best of Both Worlds” in Secure Multiparty Computation
SIAM Journal on Computing
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Constant-round multiparty computation using a black-box pseudorandom generator
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Approximate quantum error-correcting codes and secret sharing schemes
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
An efficient and verifiable solution to the millionaire problem
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Hybrid approach for secure mobile agent computations
MADNES'05 Proceedings of the First international conference on Secure Mobile Ad-hoc Networks and Sensors
A private stable matching algorithm
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
Universally composable simultaneous broadcast
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Theory and practice of multiparty computation
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Robust multiparty computation with linear communication complexity
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
Algebraic geometric secret sharing schemes and secure multi-party computations over small fields
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Efficient multi-party computation with dispute control
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Secure computation with partial message loss
TCC'06 Proceedings of the Third conference on Theory of Cryptography
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security
On the amortized complexity of zero knowledge protocols for multiplicative relations
ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security
Passive corruption in statistical multi-party computation
ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security
Adaptively secure forward-secure non-interactive threshold cryptosystems
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
Black-Box proof of knowledge of plaintext and multiparty computation with low communication overhead
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Adaptively secure non-interactive threshold cryptosystems
Theoretical Computer Science
On the complexity of broadcast setup
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Secure outsourced computation of iris matching
Journal of Computer Security
| Hi-index | 0.00 |
We consider verifiable secret sharing (VSS) and multiparty computation (MPC) in the secure-channels model, where a broadcast channel is given and a non-zero error probability is allowed. In this model Rabin and Ben-Or proposed VSS and MPC protocols secure against an adversary that can corrupt any minority of the players. In this paper, we first observe that a subprotocol of theirs, known as weak secret sharing (WSS), is not secure against an adaptive adversary, contrary to what was believed earlier. We then propose new and adaptively secure protocols for WSS, VSS and MPC that are substantially more efficient than the original ones. Our protocols generalize easily to provide security against general Q2-adversaries.