All-or-nothing disclosure of secrets
Proceedings on Advances in cryptology---CRYPTO '86
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
Journal of the ACM (JACM)
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Communications of the ACM
Priced Oblivious Transfer: How to Sell Digital Goods
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Robust Information-Theoretic Private Information Retrieval
Journal of Cryptology
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
FairplayMP: a system for secure multi-party computation
Proceedings of the 15th ACM conference on Computer and communications security
Sharemind: A Framework for Fast Privacy-Preserving Computations
ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
Asynchronous Multiparty Computation: Theory and Implementation
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Scalable onion routing with torsk
Proceedings of the 16th ACM conference on Computer and communications security
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
TASTY: tool for automating secure two-party computations
Proceedings of the 17th ACM conference on Computer and communications security
Randomized Shellsort: a simple oblivious sorting algorithm
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
SEPIA: privacy-preserving aggregation of multi-domain network events and statistics
USENIX Security'10 Proceedings of the 19th USENIX conference on Security
Round-efficient oblivious database manipulation
ISC'11 Proceedings of the 14th international conference on Information security
A formal treatment of onion routing
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 with fixed-point numbers
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Round-efficient oblivious database manipulation
ISC'11 Proceedings of the 14th international conference on Information security
Practically efficient multi-party sorting protocols from comparison sort algorithms
ICISC'12 Proceedings of the 15th international conference on Information Security and Cryptology
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
| Hi-index | 0.00 |
Most of the multi-party computation frameworks can be viewed as oblivious databases where data is stored and processed in a secret-shared form. However, data manipulation in such databases can be slow and cumbersome without dedicated protocols for certain database operations. In this paper, we provide efficient protocols for oblivious selection, filtering and shuffle--essential tools in privacy-preserving data analysis. As the first contribution, we present a 1-out-of n oblivious transfer protocol with O(log log n) rounds, which achieves optimal communication and time complexity and works over any ring ZN. Secondly, we show how to construct round-efficient shuffle protocols with optimal asymptotic computation complexity and provide several optimizations.