A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Designing Fully Secure Protocols for Secure Two-Party Computation of Constant-Domain Functions
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
Finally, we mention that Gordon and Katz [11] constructed a fully-secure three-party protocol for the majority function and a t-party protocol for the AND of t bits. ...
In this paper, we propose a generic construction of a fully secure (fair) protocol, starting with a constant-round protocol satisfying limited security requirements. ...
In particular, we propose a methodology for designing fully secure protocols. ...
doi:10.1007/978-3-319-70500-2_20
fatcat:ih4qjwk7ebc4lfy3qt4mqw6qte
1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
For two parties, they construct 1/p-secure protocols for functionalities for which the size of either their domain or their range is polynomial (in the security parameter). ...
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation, where parties give their inputs to a trusted party which returns ...
Finally, the reconstruction is fully secure in the presence of an honest majority. 7 Impossibility of 1/p-secure Computation with Non-Constant Number of Parties For deterministic functions, our protocols ...
doi:10.1007/978-3-642-22792-9_16
fatcat:x46quk7povbjvhtkileictqlui
Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This translates into a very efficient compilation of semiadaptively secure protocols for tasks with small input/output domains (such as bit-OT) into fully adaptively secure protocols. ...
Designing efficient cryptographic protocols tolerating adaptive adversaries, who are able to corrupt parties on the fly as the computation proceeds, has been an elusive task. ...
We thank Ran Canetti, Yevgeniy Dodis, Yuval Ishai, Stas Jarecki, and Aggelos Kiayias for useful discussions. We also thank the anonymous referees for their constructive comments. ...
doi:10.1007/978-3-642-03356-8_30
fatcat:r6cuynclera67nj22acjec2n44
Secure Two-Party Computation with Fairness - A Necessary Design Principle
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Protocols for secure two-party computation enable a pair of mutually distrustful parties to carry out a joint computation of their private inputs without revealing anything but the output. ...
One important security property that has been considered is that of fairness which guarantees that if one party learns the output then so does the other. ...
Proof of Impossibility of Fairness Theorem 3. Let f be a non-constant two-party function with a finite domain. ...
doi:10.1007/978-3-319-70500-2_19
fatcat:rhv7eswb3vgdjjui7fngx7qphu
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Fairness is a desirable property in secure computation; informally it means that if one party gets the output of the function, then all parties get the output. ...
(JACM 2011); the resulting protocol computes with full security (and in particular with fairness) all functions that are computable with fairness. We extend the above result in two directions. ...
In particular, Gordon and Katz [11] considered fully-secure computation in the multiparty setting without an honest majority and constructed a fully-secure three-party protocol for the majority function ...
doi:10.1007/978-3-662-46494-6_10
fatcat:bbt3g64ffndsnbtoz57gosjmca
General function evaluation in a STPC setting via piecewise linear approximation
2012
2012 IEEE International Workshop on Information Forensics and Security (WIFS)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
While in theory any computable functions can be evaluated in a Secure Two Party Computation (STPC) framework, practical applications are often limited for complexity reasons and by the kind of operations ...
In this paper we propose an algorithm that, given a function f () and an interval belonging to its domain, produces a piecewise linear approximation f () that can be easily implemented in a STPC setting ...
(standing for Signal Processing in the Encrypted Domain), or SMPC (for Secure Multi-Party Computation) techniques (STPC: Secure Two Party Computation, if only two parties are involved). ...
doi:10.1109/wifs.2012.6412625
dblp:conf/wifs/PignataLB12
fatcat:nevgtawv3zesdfckvlso36jt6e
Efficient and Secure Evaluation of Multivariate Polynomials and Applications
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we design efficient two-party and multiparty protocols for the same task, with security against malicious adversaries: Two-party case. ...
In the two-party setting, we design a protocol for this task that runs in a constant number of rounds and requires the communication of O(kn) − → V f inal is the Reed-Solomon encoding of output + ra where ...
In [24] , the authors design secure two-party protocols for different linear algebra problems by reducing the task to the design of a secure matrix product protocol. ...
doi:10.1007/978-3-642-13708-2_15
fatcat:zrp7qxsdgbdsxmzmylxhfzdzum
Recent Results in Scalable Multi-Party Computation
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Secure multi-party computation (MPC) allows multiple parties to compute a known function over inputs held by each party, without any party having to reveal its private input. ...
Unfortunately, traditional MPC algorithms do not scale well to large numbers of parties. In this paper, we describe several recent MPC algorithms that are designed to handle large networks. ...
We are also grateful for valuable comments by Mahnush Movahedi from University of New Mexico, David Evans from University of Virginia, Elette Boyle from Cornell University, and Aniket Kate from Saarland ...
doi:10.1007/978-3-662-46078-8_3
fatcat:37fhqleqvzdarox23nnlnl3gyq
A Comprehensive Survey on Secure Outsourced Computation and its Applications
2019
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Meanwhile, we introduce four secure techniques (i.e., secure multi-party computation, pseudorandom functions, software guard extensions, and perturbation approaches) and their related works. ...
With the ever-increasing requirement of storage and computation resources, it is unrealistic for local devices (with limited sources) to implement large-scale data processing. ...
Beaver, Micali, and Rogaway [31] designed a construction for constant-round multiparty secure function evaluation (consisting of n parties, n ≥ 2, each of whom possesses a private input x i , 1 ≤ i ≤ ...
doi:10.1109/access.2019.2949782
fatcat:ternbyhqezgd5cvhtfqfggqdqq
Secure Multiparty Computation with Partial Fairness
[article]
2010
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
For two parties, they construct 1/p-secure protocols for functionalities for which the size of either their domain or their range is polynomial (in the security parameter). ...
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a trusted party which returns ...
Impossibility of 1/p-secure Computation with Non-Constant Number of Parties For deterministic functions, our protocol is efficient when the number of parties m is constant and the size of the domain or ...
arXiv:1011.5567v1
fatcat:6nbdzcpuunc75eyvclvub72j6m
Public-Key Cryptography (Dagstuhl Seminar 16371)
2017
Dagstuhl Reports
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
This report documents the program and results of Dagstuhl seminar 16731 "Public-Key Cryptography" which took place September 11-16, 2016. ...
The goal of the seminar was to bring together different subareas from public-key cryptography and to promote research among these areas. ...
Motivated by the application to proofs of space (PoSpace), we construct functions for which we can prove much better lower bounds of the form N k > Ω(S k • T ) (for any constant k). ...
doi:10.4230/dagrep.6.9.46
dblp:journals/dagstuhl-reports/Fischlin0PR16
fatcat:figv27hq4feibl5nzb7snrtm2i
A systematic approach to practically efficient general two-party secure function evaluation protocols and their modular design
2013
Journal of Computer Security
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
General two-party Secure Function Evaluation (SFE) allows mutually distrusting parties to correctly compute any function on their private input data, without revealing the inputs. ...
Two-party SFE can benefit almost any client-server interaction where privacy is required, such as privacy-preserving credit checking, medical classification, or face recognition. ...
Acknowledgments The authors would like to thank Juan Garay and the anonymous reviewers of the Journal of Computer Security for their helpful comments. ...
doi:10.3233/jcs-130464
fatcat:h3e2udfufrcetpf2pbzz6z6mru
Maturity and Performance of Programmable Secure Computation
2016
IEEE Security and Privacy
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A secure computation protocol can be designed to have passive security, also known as security against semi-honest adversaries, meaning that it is secure if the computing parties follow the protocol but ...
Introduction Secure computation (SC) stands for a group of technologies for computing functions of private inputs, while keeping the inputs themselves hidden. ...
doi:10.1109/msp.2016.97
fatcat:6drshm66cvhsznobop2tb7g4ly
A Privacy-Preserving Outsourced Functional Computation Framework Across Large-Scale Multiple Encrypted Domains
2016
IEEE transactions on computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
core sub-protocols for POFD to securely compute the outsourced function. ...
Detailed security analysis shows that the proposed POFD achieves the goal of calculating a user-defined function across different encrypted domains without privacy leakage to unauthorized parties. ...
Secure multi-party computation (MPC) is one of the important branches of the cryptography with the goal to create methods for parties to jointly compute a function over their inputs, and keeping these ...
doi:10.1109/tc.2016.2543220
fatcat:3zm4lvxqjnfbzbyhnpyg7chga4
Revisiting Secure Computation Using Functional Encryption: Opportunities and Research Directions
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2020 pre-print arXiv:2011.06191v1 fatcat:f2l57u5jzzhurfvefb7hjnvc64
The secure computation problem, initially and formally introduced as secure two-party computation by Andrew Yao in 1986, has been the focus of intense research in academia because of its fundamental role ...
Then, we elaborate on the unique characteristics and challenges of emerging functional encryption based secure computation approaches and outline several research directions. ...
Acknowledgment This work was performed while James Joshi was serving as a Program Director at NSF; and the work represents the authors' views and not that of NSF's. ...
arXiv:2011.06191v2
fatcat:t4iamavzovcrzblxtbkqedk4yi
« Previous
Showing results 1 — 15 out of 24,096 results