Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
A minimal model for secure computation (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Lower Bounds for Constant Depth Circuits for Prefix Problems
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Secure Distributed Linear Algebra in a Constant Number of Rounds
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Unbounded fan-in circuits and associative functions
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Private Simultaneous Messages Protocols with Applications
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
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
Minimal-latency secure function evaluation
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Secure computation of the mean and related statistics
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
A domain-specific programming language for secure multiparty computation
Proceedings of the 2007 workshop on Programming languages and analysis for security
Privacy preserving error resilient dna searching through oblivious automata
Proceedings of the 14th ACM conference on Computer and communications security
Non-interactive Proofs for Integer Multiplication
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Distributed Private Data Analysis: Simultaneously Solving How and What
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Sharemind: A Framework for Fast Privacy-Preserving Computations
ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
Privacy Preserving Computations without Public Key Cryptographic Operation
IWSEC '08 Proceedings of the 3rd International Workshop on Security: Advances in Information and Computer Security
Privacy-preserving data mining in the malicious model
International Journal of Information and Computer Security
Coercion-resistant tallying for STV voting
EVT'08 Proceedings of the conference on Electronic voting technology
Constant-Round Multiparty Computation for Interval Test, Equality Test, and Comparison
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Secure Arithmetic Computation with No Honest Majority
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
A Cryptographic Solution for Private Distributed Simple Meeting Scheduling
Proceedings of the 2009 conference on Artificial Intelligence Research and Development: Proceedings of the 12th International Conference of the Catalan Association for Artificial Intelligence
A Cryptographic Solution for Private Distributed Simple Meeting Scheduling
Proceedings of the 2009 conference on Artificial Intelligence Research and Development: Proceedings of the 12th International Conference of the Catalan Association for Artificial Intelligence
Practical and secure solutions for integer comparison
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Multiparty computation for interval, equality, and comparison without bit-decomposition protocol
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Multi-party indirect indexing and applications
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Multiparty computation for dishonest majority: from passive to active security at low cost
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Linear, constant-rounds bit-decomposition
ICISC'09 Proceedings of the 12th international conference on Information security and 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
SEPIA: privacy-preserving aggregation of multi-domain network events and statistics
USENIX Security'10 Proceedings of the 19th USENIX conference on Security
Efficient secure two-party exponentiation
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Sub-linear, secure comparison with two non-colluding parties
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Distributed privacy preserving data collection
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Generic constant-round oblivious sorting algorithm for MPC
ProvSec'11 Proceedings of the 5th international conference on Provable security
Privacy-preserving distributed network troubleshooting—bridging the gap between theory and practice
ACM Transactions on Information and System Security (TISSEC)
Practical PIR for electronic commerce
Proceedings of the 18th ACM conference on Computer and communications security
Round-efficient oblivious database manipulation
ISC'11 Proceedings of the 14th international conference on Information security
Secure computation with fixed-point numbers
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
Modulo reduction for paillier encryptions and application to secure statistical analysis
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
Our data, ourselves: privacy via distributed noise generation
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Efficient binary conversion for paillier encrypted values
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Distributed privacy-preserving methods for statistical disclosure control
DPM'09/SETOP'09 Proceedings of the 4th international workshop, and Second international conference on Data Privacy Management and Autonomous Spontaneous Security
Threshold and proactive pseudo-random permutations
TCC'06 Proceedings of the Third conference on Theory of Cryptography
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Accelerating multiparty computation by efficient random number bitwise-sharing protocols
WISA'11 Proceedings of the 12th international conference on Information Security Applications
Secure computation, i/o-efficient algorithms and distributed signatures
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
Practical private information aggregation in large networks
NordSec'10 Proceedings of the 15th Nordic conference on Information Security Technology for Applications
Assisting server for secure multi-party computation
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
Accelerating the secure distributed computation of the mean by a chebyshev expansion
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Multiparty proximity testing with dishonest majority from equality testing
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Batching multiple protocols to improve efficiency of multi-party computation
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
Practically efficient multi-party sorting protocols from comparison sort algorithms
ICISC'12 Proceedings of the 15th international conference on Information Security and Cryptology
Private over-threshold aggregation protocols
ICISC'12 Proceedings of the 15th international conference on Information Security and Cryptology
An efficient and probabilistic secure bit-decomposition
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Secure k-NN computation on encrypted cloud data without sharing key with query users
Proceedings of the 2013 international workshop on Security in cloud computing
A Privacy Preserving Markov Model for Sequence Classification
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
An architecture for practical actively secure MPC with dishonest majority
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Smart meter aggregation via secret-sharing
Proceedings of the first ACM workshop on Smart energy grid security
From oblivious AES to efficient and secure database join in the multiparty setting
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
Secure equality and greater-than tests with sublinear online complexity
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Privacy-preserving Kruskal-Wallis test
Computer Methods and Programs in Biomedicine
Secure k-NN query on encrypted cloud database without key-sharing
International Journal of Electronic Security and Digital Forensics
Secure outsourced computation of iris matching
Journal of Computer Security
| Hi-index | 0.00 |
We show that if a set of players hold shares of a value $a \in \mathbb{F}_p $ for some prime p (where the set of shares is written [a]p), it is possible to compute, in constant rounds and with unconditional security, sharings of the bits of a, i.e., compute sharings [a0]p, ..., [aℓ−−1]p such that ℓ = ⌈ log2p ⌉, a0,...,al−1∈{0,1} and a = ∑i=0ℓ−−1ai 2i. Our protocol is secure against active adversaries and works for any linear secret sharing scheme with a multiplication protocol. The complexity of our protocol is $\mathcal{O}(l {\rm log} l)$ invocations of the multiplication protocol for the underlying secret sharing scheme, carried out in $\mathcal{O}(1)$ rounds. This result immediately implies solutions to other long-standing open problems such as constant-rounds and unconditionally secure protocols for deciding whether a shared number is zero, comparing shared numbers, raising a shared number to a shared exponent and reducing a shared number modulo a shared modulus.