16 Hits in 6.3 sec

Information Theoretically Secure Multi Party Set Intersection Re-visited [chapter]

Arpita Patra, Ashish Choudhary, C. Pandu Rangan
2009 Lecture Notes in Computer Science  
We re-visit the problem of secure multiparty set intersection in information theoretic settings.  ...  In [16] , Li have proposed a protocol for multiparty set intersection problem with n parties, that provides information theoretic security, when t < n 3 parties are corrupted by an active adversary  ...  It would be interesting to improve the resilience of the MPSI protocol of [16] and this paper, by designing an information theoretically secure MPSI protocol with optimal resilience (i.e., with n = 2t  ... 
doi:10.1007/978-3-642-05445-7_5 fatcat:6vjrgibnlbhjre7ymdgxy7t3sa

A subexponential construction of graph coloring for multiparty computation

Hassan Jameel Asghar, Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld
2014 Journal of Mathematical Cryptology  
AbstractWe show the first deterministic construction of an unconditionally secure multiparty computation (MPC) protocol in the passive adversarial model over black-box non-Abelian groups which is both  ...  optimal (secure against an adversary who possesses any  ...  Most protocols for unconditionally secure MPC, which is the adversarial model considered in this paper, involve performing multiplications and additions over a finite field.  ... 
doi:10.1515/jmc-2013-0035 fatcat:vm3j57sa35eivnaap3cgia32lq

Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation [chapter]

Elette Boyle, Niv Gilboa, Yuval Ishai
2017 Lecture Notes in Computer Science  
This should be contrasted with standard public-key encryption schemes and non-succinct secure computation protocols that can be easily (and unconditionally) realized in the generic group model.  ...  For any constant number of parties, we obtain 2-round MPC protocols based on a PKI setup under the DDH assumption.  ...  We also thank Geoffroy Couteau and the anonymous Eurocrypt reviewers for helpful comments.  ... 
doi:10.1007/978-3-319-56614-6_6 fatcat:bhgipsvgsvd53caixzg45iybem

Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography [chapter]

Ivan Damgård, Yuval Ishai, Mikkel Krøigaard
2010 Lecture Notes in Computer Science  
The best previous protocols in this setting could only offer computational security with a computational overhead of poly(k, log n, log s), where k is a computational security parameter, or perfect security  ...  The protocol provides perfect security with guaranteed output delivery in the presence of an active, adaptive adversary corrupting a (1/3 − ε) fraction of the players, for an arbitrary constant ε > 0 and  ...  In the case of unconditional security, all efficient MPC protocols from the literature require the round complexity to grow with the circuit depth d.  ... 
doi:10.1007/978-3-642-13190-5_23 fatcat:fwuhrsowirfmdli5726lvixrqi

Secure Multiparty Computation from SGX [chapter]

Raad Bahmani, Manuel Barbosa, Ferdinand Brasser, Bernardo Portela, Ahmad-Reza Sadeghi, Guillaume Scerri, Bogdan Warinschi
2017 Lecture Notes in Computer Science  
Our results Generic secure multiparty computation. The main result of the paper is a highly efficient protocol for the secure multiparty computation of an arbitrary reactive functionality F .  ...  In this paper we show how IEEs provide a new path to constructing general secure multiparty computation (MPC) protocols.  ...  Introduction Secure multiparty computation (MPC) allows a set of parties to collaboratively execute a distributed computation using a cryptographic protocol, with the same security and privacy guarantees  ... 
doi:10.1007/978-3-319-70972-7_27 fatcat:wunetkom2fbatjfy4ebzadb2d4

From Fairness to Full Security in Multiparty Computation [article]

Ran Cohen and Iftach Haitner and Eran Omri and Lior Rotem
2021 arXiv   pre-print
In the setting of secure multiparty computation (MPC), a set of mutually distrusting parties wish to jointly compute a function, while guaranteeing the privacy of their inputs and the correctness of the  ...  An MPC protocol is called fully secure if no adversary can prevent the honest parties from obtaining their outputs.  ...  The idea of electing a small committee to perform a computation has been used in several settings, such as leakage-resilient secure computation [8, 9] , large-scale MPC [10, 11, 25] , MPC with a non-expander  ... 
arXiv:2105.00962v2 fatcat:wpgsj7rb7zcrjeoaxgabxkvpge

Robust Pseudorandom Generators [chapter]

Yuval Ishai, Eyal Kushilevitz, Xin Li, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, David Zuckerman
2013 Lecture Notes in Computer Science  
constant-round secure two-party computation.  ...  We apply robust r-wise independent PRGs towards reducing the randomness complexity of private circuits and protocols for secure multiparty computation, as well as improving the "black-box complexity" of  ...  We thank Benny Applebaum and and Jean-Sebastien Coron for helpful discussions and comments, and an anonymous reviewer for pointing out the relevance of [4] .  ... 
doi:10.1007/978-3-642-39206-1_49 fatcat:hthwyxn2mngy5gjm6iq4474cva

Cryptography with constant computational overhead

Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai
2008 Proceedings of the fourtieth annual ACM symposium on Theory of computing - STOC 08  
of Alekhnovich (FOCS 2003), we get (public and private key) encryption schemes with constant overhead.  ...  Our protocols rely on non-black-box techniques, and suggest the intriguing possibility that the ultimate efficiency in this area of cryptography can be obtained via such techniques.  ...  We also thank Jon Feldman, Venkat Guruswami, Omer Reingold, Ronny Roth, and Avi Wigderson for helpful discussions and comments.  ... 
doi:10.1145/1374376.1374438 dblp:conf/stoc/IshaiKOS08 fatcat:llsycwqmbndejlj57fpvjgvcdy

Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead [chapter]

Satrajit Ghosh, Jesper Buus Nielsen, Tobias Nilges
2017 Lecture Notes in Computer Science  
We present a highly efficient and UC-secure construction of OLE in the OT-hybrid model that requires only O(1) OTs per OLE.  ...  OLE is a special case of oblivious polynomial evaluation (OPE) and deals with the oblivious evaluation of a linear function f (x) = ax + b.  ...  OPE has many applications, ranging from secure set intersection [26, 16] over RSA key generation [14] to oblivious keyword search [12] .  ... 
doi:10.1007/978-3-319-70694-8_22 fatcat:d5gd672xnbanjlp47oawhvfrpu

Practical Private Set Intersection Protocols for Privacy-Preserving Applications

Christian Weinert
Private set intersection (PSI) protocols are cryptographic protocols that allow two parties to securely compute the intersection of their private input sets without disclosing elements outside of the intersection  ...  To instead perform the matching procedure between address books and user databases in a privacy-preserving manner, we develop and optimize two PSI protocols that are significantly more efficient than the  ...  We thank Oleksandr Tkachenko for his invaluable help with the implementation and benchmarking. We also thank Moni Naor for suggesting the application to achieve differential privacy.  ... 
doi:10.26083/tuprints-00019295 fatcat:mcrri3mvh5a3jois3hzpolx3ae

Uncertainty modeling and analysis with intervals: Foundations, tools, applications (Dagstuhl Seminar 11371) Quantum Cryptanalysis (Dagstuhl Seminar 11381) Public-Key Cryptography (Dagstuhl Seminar 11391)

Markus Schneider, Gottfried Vossen, Esteban Zimányi, Isaac Elishakoff, Vladik Kreinovich, Wolfram Luther, Evgenija Popova, Serge Fehr, Michele Mosca, Martin Rötteler, Rainer, Marc Fischlin (+3 others)
2011 unpublished
Acknowledgements We would like to thank the staff of Schloss Dagstuhl for their help in organizing this seminar and for the excellent facilities.  ...  Thanks go to Martin Fuchs for his help in collecting abstracts of the talks and other related materials for these proceedings. -Public-Key  ...  We showcase the power of anonymity in the setting of secure multiparty computation (MPC) with resource-based corruptions and prove that anonymity can effectively be used to circumvent known impossibility  ... 

Privacy-Preserving Federated Analytics using Multiparty Homomorphic Encryption

David Jules Froelicher
MHE combines secure multiparty computation (SMC) techniques with homomorphic encryption (HE) by pooling the advantages of both SMC and HE, i.e., interactivity and flexibility, and by minimizing their disadvantages  ...  (2) to analyze and evaluate the proposed systems, thus showing that they provide an efficient, secure, scalable, and accurate alternative to existing solutions for federated analysis by proving their  ...  Henry Corrigan-Gibbs for his valuable feedback and the members of the DeDiS lab for their help with software engineering. Acknowledgements. This work is the result of a collaboration with Dr. Juan R.  ... 
doi:10.5075/epfl-thesis-8263 fatcat:74tfcap2nbd2dc4e2n37a3wmam

Protocols for Connecting Blockchains with Off-chain Systems

Fan Zhang
better performance, and impacting broader community by releasing open source tools and setting up public services.  ...  Worse yet, smart contracts inherit blockchains' lack of confidentiality and poor efficiency. This thesis introduces solutions to these problems by connecting blockchains with off-chain systems.  ...  decentralized secure multiparty computation (MPC).  ... 
doi:10.7298/jw55-g827 fatcat:2f6qobvuvzenllmhxgoubz7woe

Privacy and utility in secure computations: optimal trade-offs through quantitative information flow

Patrick Wong Fen Kin Ah-Fat, Michael Huth, Imperial College London
We formally investigate optimal trade-offs between privacy of inputs and utility of output under different assumptions.  ...  We conclude by discussing this scalability issue along with the adaptation of [...]  ...  This implies that there is no intersection in this setting and that |A| = (n + 1)(m + 1) = 28.  ... 
doi:10.25560/89931 fatcat:muizbcr3z5c7nipyrdig2bilju

The Moral Character of Cryptographic Work

Phillip Rogaway
2015 unpublished
Most academic cryptographers seem to think that our field is a fun, deep, and politically neutral game-a set of puzzles involving communicating parties and notional adversaries.  ...  For me, these questions came to a head with the Snowden disclosures of 2013.  ...  David Chaum, Claude Crépeau, Ivan Damgård: Multiparty unconditionally Secure protocols (extended abstract).  ... 
« Previous Showing results 1 — 15 out of 16 results