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
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
A characterization of span program size and improved lower bounds for monotone span programs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of 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
On the complexity of verifiable secret sharing and multiparty computation
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Communications of the ACM
Efficient Byzantine Agreement Secure Against General Adversaries
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
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
Generalized Secret Sharing and Monotone Functions
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
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
Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free?
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
A Construction of Practical Secret Sharing Schemes using Linear Block Codes
ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Theory and practice of verifiable secret sharing
Theory and practice of verifiable secret sharing
Verifiable secret sharing and achieving simultaneity in the presence of faults
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Efficient multiparty computations secure against an adaptive adversary
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
The round complexity of verifiable secret sharing and secure multicast
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On perfectly secure communication over arbitrary networks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Asynchronous Perfectly Secure Computation Tolerating Generalized Adversaries
ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Parallel Reducibility for Information-Theoretically Secure Computation
CRYPTO '00 Proceedings of the 20th 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
Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Multiparty Computation from Threshold Homomorphic Encryption
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
Efficient Asynchronous Secure Multiparty Distributed Computation
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
On Unconditionally Secure Distributed Oblivious Transfer
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress 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
Distributing Trust on the Internet
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Practical secret sharing scheme realizing generalized adversary structure
Journal of Computer Science and Technology
Secure multi-party computation made simple
Discrete Applied Mathematics - Special issue: Coding and cryptography
A proposal of encoded computations for distributed massively multiplayer online services
Proceedings of the 2006 ACM SIGCHI international conference on Advances in computer entertainment technology
Encoding for secure computations in distributed interactive real-time applications
Computer Communications
Secure Computation from Random Error Correcting Codes
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Improving the Round Complexity of VSS in Point-to-Point Networks
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
On Linear Secret Sharing for Connectivity in Directed Graphs
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Privacy-preserving social network analysis for criminal investigations
Proceedings of the 7th ACM workshop on Privacy in the electronic society
Counting Method for Multi-party Computation over Non-abelian Groups
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Graph Design for Secure Multiparty Computation over Non-Abelian Groups
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Secure Arithmetic Computation with No Honest Majority
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Secret Sharing and Non-Shannon Information Inequalities
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Improving the round complexity of VSS in point-to-point networks
Information and Computation
Distributing the Key Distribution Centre in Sakai---Kasahara Based Systems
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
Secure multi-party computation made simple
Discrete Applied Mathematics - Special issue: Coding and cryptography
Practical privacy-preserving protocols for criminal investigations
ISI'09 Proceedings of the 2009 IEEE international conference on Intelligence and security informatics
Cryptanalysis schemes against batch verification signature
CCDC'09 Proceedings of the 21st annual international conference on Chinese Control and Decision Conference
Threshold signature scheme with subliminal channel
CCDC'09 Proceedings of the 21st annual international conference on Chinese Control and Decision Conference
Weakly-private secret sharing schemes
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Efficient multi-party computation over rings
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
Trading players for efficiency in unconditional multiparty computation
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Flaws in some secret sharing schemes against cheating
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Efficient (k, n) threshold secret sharing schemes secure against cheating from n - 1 cheaters
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Scalable and unconditionally secure multiparty computation
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Strongly multiplicative ramp schemes from high degree rational points on curves
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Efficient simultaneous broadcast
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Key management scheme with bionic optimization
IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
OT-combiners via secure computation
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Strong (n,t,n) verifiable secret sharing scheme
Information Sciences: an International Journal
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
Improved primitives for secure multiparty integer computation
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Secure multiparty linear programming using fixed-point arithmetic
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
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
Cryptography and Communications
The round complexity of perfectly secure general VSS
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Secret-sharing schemes: a survey
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Ideal secret sharing schemes for useful multipartite access structures
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Perfectly-secure multiplication for any t n/3
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
The torsion-limit for algebraic function fields and its application to arithmetic secret sharing
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Generic constant-round oblivious sorting algorithm for MPC
ProvSec'11 Proceedings of the 5th international conference on Provable security
Round-efficient oblivious database manipulation
ISC'11 Proceedings of the 14th international conference on Information security
Almost optimum secret sharing schemes secure against cheating for arbitrary secret distribution
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
On proactive secret sharing schemes
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Parallel multi-party computation from linear multi-secret sharing schemes
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
On a relation between verifiable secret sharing schemes and a class of error-correcting codes
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
A round and communication efficient secure ranking protocol
CT-RSA'06 Proceedings of the 2006 The Cryptographers' Track at the RSA conference on Topics in Cryptology
Methods of encrypting monotonic access structures
Annales UMCS, Informatica - Cryptography and data protection
On the size of monotone span programs
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
Characterizing ideal weighted threshold secret sharing
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Privacy-preserving set operations
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
On codes, matroids and secure multi-party computation from linear secret sharing schemes
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Constant-round multiparty computation using a black-box pseudorandom generator
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Secure computation of constant-depth circuits with applications to database search problems
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Round-efficient perfectly secure message transmission scheme against general adversary
Designs, Codes and Cryptography
Secure computation with fixed-point numbers
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
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
TCC'06 Proceedings of the Third conference on Theory of Cryptography
On matroids and non-ideal secret sharing
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Efficient (n, t, n) secret sharing schemes
Journal of Systems and Software
Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
Journal of Complexity
iPIN and mTAN for secure eID applications
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
Coset bounds for algebraic geometric codes
Finite Fields and Their Applications
Linear multi-secret sharing schemes based on multi-party computation
Finite Fields and Their Applications
Heterogeneous secure multi-party computation
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part II
An efficient lattice-based secret sharing construction
WISTP'12 Proceedings of the 6th IFIP WG 11.2 international conference on Information Security Theory and Practice: security, privacy and trust in computing systems and ambient intelligent ecosystems
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
Active security in multiparty computation over black-box groups
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Expression rewriting for optimizing secure computation
Proceedings of the third ACM conference on Data and application security and privacy
An information-flow type-system for mixed protocol secure computation
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Secure outsourced computation of iris matching
Journal of Computer Security
Secret sharing schemes based on graphical codes
Cryptography and Communications
Hi-index | 0.00 |
We show that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) for the players, provided that the access structure of the LSSS allows MPC or VSS at all. Because an LSSS neither guarantees reconstructability when some shares are false, nor verifiability of a shared value, nor allows for the multiplication of shared values, an LSSS is an apparently much weaker primitive than VSS or MPC. Our approach to secure MPC is generic and applies to both the information-theoretic and the cryptographic setting. The construction is based on 1) a formalization of the special multiplicative property of an LSSS that is needed to perform a multiplication on shared values, 2) an efficient generic construction to obtain from any LSSS a multiplicative LSSS for the same access structure, and 3) an efficient generic construction to build verifiability into every LSSS (always assuming that the adversary structure allows for MPC or VSS at all). The protocols are efficient. In contrast to all previous information-theoretically secure protocols, the field size is not restricted (e.g, to be greater than n). Moreover, we exhibit adversary structures for which our protocols are polynomial in n while all previous approaches to MPC for non-threshold adversaries provably have super-polynomial complexity.