173 Hits in 4.6 sec

Efficient Multiparty Protocols via Log-Depth Threshold Formulae [chapter]

Gil Cohen, Ivan Bjerre Damgård, Yuval Ishai, Jonas Kölker, Peter Bro Miltersen, Ran Raz, Ron D. Rothblum
2013 Lecture Notes in Computer Science  
We put forward a new approach for the design of efficient multiparty protocols: 1.  ...  Cryptology, 2000) with constructions of logarithmic-depth formulae which compute threshold functions using only constant fan-in threshold gates.  ...  From Threshold Formulae to Secure Multiparty Computation In this section we show how to use logarithmic depth threshold formulae to obtain an efficient generic reduction from multiparty MPC protocols to  ... 
doi:10.1007/978-3-642-40084-1_11 fatcat:a7lwyvx6d5a2xbujlmoe6b7npe

Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic [chapter]

Yashvanth Kondi, Arpita Patra
2017 Lecture Notes in Computer Science  
Namely, we show how to garble threshold and high fan-in gates.  ...  Our scheme directly finds application in ZK protocols where the verification function of the language is representable by a formulaic circuit. Such examples include Boolean formula satisfiability.  ...  The efficiency study of GCs are further enriched and extended by considering a number of interesting relaxations that lead to further optimizations.  ... 
doi:10.1007/978-3-319-63688-7_7 fatcat:gae6qdbna5b7xokp2uoc7afiq4

Polynomial AND homomorphic cryptosystem and applications

Shundong Li, Sufang Zhou, Jiawei Dou, Wenli Wang
2019 Science China Information Sciences  
This polynomial AND homomorphic cryptosystem is a highly effective tool for designing various cryptographic protocols.  ...  and highly effective cryptographic primitives for addressing security problems arising in information processing, data analysis and data applications, particularly in secure cloud computing and secure multiparty  ...  The above-mentioned protocols for this problem are applicable only to two parties, i.e., t = 2; moreover, it is highly challenging to extend these protocols to multiparty (over two parties) cases.  ... 
doi:10.1007/s11432-018-9789-y fatcat:qipqsltknbg2rgljcqqm42dq6m

The Pattern Matrix Method (Journal Version) [article]

Alexander A. Sherstov
2009 arXiv   pre-print
The method of this paper has recently enabled important progress in multiparty communication complexity.  ...  A further advantage of the pattern matrix method is that it extends in a straightforward way to the multiparty model [41, 14, 15, 16, 6] .  ...  In particular, it fully characterizes membership in PP cc , the class of communication problems with efficient small-bias protocols [30] .  ... 
arXiv:0906.4291v1 fatcat:5gbybmh7obbovas6nnnft4offu

Secure Multiparty Computation and Trusted Hardware: Examining Adoption Challenges and Opportunities

Joseph I. Choi, Kevin R. B. Butler
2019 Security and Communication Networks  
When two or more parties need to compute a common result while safeguarding their sensitive inputs, they use secure multiparty computation (SMC) techniques such as garbled circuits.  ...  To produce efficient circuits, CBMC attempts to minimize the size of Boolean formulas. Kamara et al. propose Salus [62] for server-aided, GCbased SFE.  ...  [56] achieve 2 − + (log ) ) while reducing by a factor of 3.  ... 
doi:10.1155/2019/1368905 fatcat:izynm6msrvehfa3ghkw7tykk34

Polymath: Low-Latency MPC via Secure Polynomial Evaluations and Its Applications

Donghang Lu, Albert Yu, Aniket Kate, Hemanta Maji
2021 Proceedings on Privacy Enhancing Technologies  
This work follows the design principle of identifying and constructing fast and provably-secure MPC protocols to evaluate useful high-level algebraic abstractions; thus, improving the efficiency of all  ...  For the decision tree evaluation problem, we demonstrate the feasibility of evaluating high-depth decision tree models in a general n-party setting.  ...  However, we find out that by extending the protocol in [3] , we can achieve a very efficient protocol for matrix powering.  ... 
doi:10.2478/popets-2022-0020 fatcat:77tlblswjbaxzppdqw77tzle7e

Multicenter privacy-preserving Cox analysis based on homomorphic encryption

Yao Lu, Yu Tian, Tianshu Zhou, Shiqiang Zhu, Jingsong Li
2021 IEEE journal of biomedical and health informatics  
Our protocol utilizes threshold homomorphic encryption to guarantee security.  ...  the same as that obtained with the original nonsecure Cox regression protocol; therefore, our protocol is a potential candidate for practical real-world applications in multicenter medical research.  ...  Third, both schemes can be extended to threshold homomorphic encryption.  ... 
doi:10.1109/jbhi.2021.3071270 pmid:33822728 fatcat:tr3rrb2hrzbvndxwohticwxr2y

Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC^0 [article]

Alexander A. Sherstov, Pei Wu
2019 arXiv   pre-print
Our results subsume all previous lower bounds on the threshold degree and sign-rank of AC^0 circuits of any given depth, with a strict improvement starting at depth 4.  ...  Determining the maximum threshold degree and sign-rank achievable by constant-depth circuits (AC^0) is a well-known and extensively studied open problem, with complexity-theoretic and algorithmic applications  ...  [3] for arbitrary depth. Their algorithm runs in time exp(Õ(n (2 k−1 −1)/(2 k −1) )) for formulas of size n and constant depth k, and in time exp(Õ( √ n)) for formulas of unbounded depth.  ... 
arXiv:1901.00988v1 fatcat:o65akt5l2nelbijguyjja4tuqi

Communication Lower Bounds Using Directional Derivatives

Alexander A. Sherstov
2014 Journal of the ACM  
The proof contributes a novel technique for lower bounds on multiparty communication, based on directional derivatives of protocols over the reals. ACM Reference Format: Alexander A. Sherstov, 2013.  ...  Proving this bound was a longstanding open problem even in restricted settings, such as one-way classical protocols with k = 4 parties (Wigderson 1997).  ...  Using it, we will now prove that repeated discrepancy gives a highly efficient way to approximate multiparty protocols by polynomials. THEOREM 4.2.  ... 
doi:10.1145/2629334 fatcat:a4b3onimtzcodkus6zzsxnpd6i

Multiparty Computation from Somewhat Homomorphic Encryption [chapter]

Ivan Damgård, Valerio Pastro, Nigel Smart, Sarah Zakarias
2012 Lecture Notes in Computer Science  
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players.  ...  Our protocol consists of a preprocessing phase that is both independent of the function to be computed and of the inputs, and a much more efficient online phase where the actual computation takes place  ...  An Efficient Preprocessing Protocol.  ... 
doi:10.1007/978-3-642-32009-5_38 fatcat:iy5rabmo6fexvpb376pptcmxvm

Selective private function evaluation with applications to private statistics

Ran Canetti, Yuval Ishai, Ravi Kumar, Michael K. Reiter, Ronitt Rubinfeld, Rebecca N. Wright
2001 Proceedings of the twentieth annual ACM symposium on Principles of distributed computing - PODC '01  
We present various approaches for constructing sublinear-communication $PFE protocols, both for the general problem and for special cases of interest.  ...  For lack of space, we omit more formal definitions from this extended abstract. On the definition of SPIR.  ...  If f can be computed by a formula of size s, the above protocol is a 1-round SPFE protocol secure against a semi-honest chent and t mahcious servers, where the total number of servers is k = ts log n +  ... 
doi:10.1145/383962.384047 dblp:conf/podc/CanettiIKRRW01 fatcat:t2k74lp2lza7xg3oyoghk3fe6q

From Information Theory Puzzles in Deletion Channels to Deniability in Quantum Cryptography [article]

Arash Atashpendar
2020 arXiv   pre-print
Finally, we present an efficient coercion-resistant and quantum-secure voting scheme, based on fully homomorphic encryption.  ...  By viewing ρ as a parameter of the model, the goal is to determine for which ρ, UQC can be efficiently simulated via purification protocols that consume several copies of ρ to produce, in the asymptotic  ...  Moreover, deniability is intimately related to fundamental concepts such as secure multiparty computation [73] and incoercible multiparty computation [74] .  ... 
arXiv:2003.11663v1 fatcat:7ul4q6mupjcyzfyspus6xwh2ai

Adaptive Oblivious Transfer with Access Control from Lattice Assumptions [chapter]

Benoît Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen, Huaxiong Wang
2017 Lecture Notes in Computer Science  
Adaptive oblivious transfer (OT) is a protocol where a sender initially commits to a database {Mi} N i=1 .  ...  The security of our protocol is proved under the Learning-with-Errors (LWE) and Short-Integer-Solution (SIS) assumptions.  ...  Moreover, this approach does not efficiently extend to, e.g., threshold policies. By handling access control via branching programs, we directly enable access control for policies in NC1.  ... 
doi:10.1007/978-3-319-70694-8_19 fatcat:m5p2vin7pvbhvjz2wbzdwqekaq

Correlated Pseudorandom Functions from Variable-Density LPN

Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl
2020 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)  
We also present several cryptographic applications that motivate our efficient PCF constructions. The VDLPN assumption is independently motivated by two additional applications.  ...  This is contrasted with the quasipolynomial security of previous (higher-depth) AC 0 [⊕] candidates. We support our conjectures by proving resilience to several classes of attacks.  ...  Algebraic attacks have been introduced in [Pat95] and were later extended and abstracted in [Cou01, CM03, Cou03] .  ... 
doi:10.1109/focs46700.2020.00103 fatcat:eqi522uulnbrtfgl6j2gvsvkra

Specification Of Security Enablers For Data Management

Marko Vukolic
2016 Zenodo  
Chapter 4 introduces a novel model for developing reliable distributed protocols called XFT, as well as the rst state-machine replication protocol in this model -XPaxos.  ...  Then, we introduce novel distributed protocols for state-machine replication developed in the context of SUPERCLOUD.  ...  In this chapter we proposed a specialized abstraction and a (safe and live) protocol for transferring partitions as efficiently as possible, and explained how it could be integrated with the multi-partition  ... 
doi:10.5281/zenodo.263831 fatcat:ksk4ze2tuncfbexjzsorjnoabe
« Previous Showing results 1 — 15 out of 173 results