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
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
Proceedings of the eighth 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
Journal of the ACM (JACM)
Communications of the ACM
Fundamentals of Parallel Processing
Fundamentals of Parallel Processing
Lower Bounds for Constant Depth Circuits for Prefix Problems
Proceedings of the 10th Colloquium on Automata, Languages and Programming
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Sharing Decryption in the Context of Voting or Lotteries
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
Unbounded fan-in circuits and associative functions
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Optimizing robustness while generating shared secret safe primes
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Share conversion, pseudorandom secret-sharing and applications to secure computation
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
A practical implementation of secure auctions based on multiparty integer computation
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
Efficient binary conversion for paillier encrypted values
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
TCC'06 Proceedings of the Third 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
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
CRYPTO'07 Proceedings of the 27th annual international cryptology 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
Leakage quantification of cryptographic operations
OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems - Volume Part I
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
Secure data structures based on multi-party computation
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Privacy-preserving distributed network troubleshooting—bridging the gap between theory and practice
ACM Transactions on Information and System Security (TISSEC)
Secure computation with fixed-point numbers
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
Private similarity computation in distributed systems: from cryptography to differential privacy
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
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
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
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
Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security
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
Lessons learned with PCF: scaling secure computation
Proceedings of the First ACM workshop on Language support for privacy-enhancing technologies
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
Secure outsourced computation of iris matching
Journal of Computer Security
| Hi-index | 0.00 |
Damgård et al. [11] showed a novel technique to convert a polynomial sharing of secret a into the sharings of the bits of a in constant rounds, which is called the bit-decomposition protocol. The bit-decomposition protocol is a very powerful tool because it enables bitoriented operations even if shared secrets are given as elements in the field. However, the bit-decomposition protocol is relatively expensive. In this paper, we present a simplified bit-decomposition protocol by analyzing the original protocol. Moreover, we construct more efficient protocols for a comparison, interval test and equality test of shared secrets without relying on the bit-decomposition protocol though it seems essential to such bit-oriented operations. The key idea is that we do computation on secret a with c and r where c = a + r, c is a revealed value, and r is a random bitwise-shared secret. The outputs of these protocols are also shared without being revealed. The realized protocols as well as the original protocol are constantround and run with less communication rounds and less data communication than those of [11]. For example, the round complexities are reduced by a factor of approximately 3 to 10.