Filters








825 Hits in 1.8 sec

Computer-aided proofs for multiparty computation with active security [article]

Helene Haagh, Aleksandr Karbyshev, Sabine Oechsner, Bas Spitters, Pierre-Yves Strub
2018 arXiv   pre-print
For the active case we provide a new NI definition, which we call input independence.  ...  In the programming language community it has become good practice to use computer proof assistants to verify correctness proofs.  ...  ACKNOWLEDGEMENTS Gilles Barthe showed us how non-interference can be used in the context of MPC for a passive adversary. Ivan Damgård helped us to understand MPC protocols and their security proofs.  ... 
arXiv:1806.07197v1 fatcat:lyvuiam43vgi7oibcbed2suova

Mix and Match: Secure Function Evaluation via Ciphertexts [chapter]

Markus Jakobsson, Ari Juels
2000 Lecture Notes in Computer Science  
We introduce a novel approach to general secure multiparty computation that avoids the intensive use of verifiable secret sharing characterizing nearly all previous protocols in the literature.  ...  Instead, our scheme involves manipulation of ciphertexts for which the underlying private key is shared by participants in the computation.  ...  Pedersen commitments are included here for technical reasons, namely to aid in security proofs for the protocol.  ... 
doi:10.1007/3-540-44448-3_13 fatcat:d3ytgko3gfcoplr72ohedmeefu

Privacy Preserving Network Analysis of Distributed Social Networks [chapter]

Varsha Bhat Kukkala, Jaspal Singh Saini, S. R. S. Iyengar
2016 Lecture Notes in Computer Science  
We design multiparty protocols for securely performing few of the commonly studied social network analysis algorithms.  ...  The designed protocols are proven to be secure in the presence of an arithmetic black-box extended with operations like comparison and modulo.  ...  Multiparty computation The following section formalizes the basic definitions and notions that are imperative to designing any secure multiparty protocol and aid in providing the rigorous proof for the  ... 
doi:10.1007/978-3-319-49806-5_18 fatcat:5xj5u6l3dne7xbmaqx2wou3sky

Non-interactive Zero-Sharing with Applications to Private Distributed Decision Making [chapter]

Aggelos Kiayias, Moti Yung
2003 Lecture Notes in Computer Science  
Non-interactiveness suggests that there is no need for bilateral communication between the active participants; instead decision making is achieved by unilateral communication between active participants  ...  Based on non-interactive zero-sharing, we present concrete constructions for a private veto protocol, a protocol for simultaneous disclosure of information, and a privacyenhancing "plug-in" tool for electronic  ...  Server aided secure multiparty computation, introduced in [Bea97] , showed that one can adopt communication patterns that agree with the way network communication is abstracted (the "client-server" approach  ... 
doi:10.1007/978-3-540-45126-6_22 fatcat:6hancvur7bfgrm4mbflqd24lqy

Making Code Voting Secure against Insider Threats using Unconditionally Secure MIX Schemes and Human PSMT Protocols [article]

Yvo Desmedt, Stelios Erotokritou
2015 arXiv   pre-print
This emphasizes the importance of using: (1) Unconditional security for secure network communication. (2) Reduce reliance on untrusted computers.  ...  We use PSMT protocols (SCN 2012) where with the help of visual aids, humans can carry out 10 addition correctly with a 99% degree of accuracy.  ...  The authors would also like to thank Rebecca Wright, Juan Garay and Amos Beimel for expressing their interests in Private and Secure Mes-sage Transmission in which one cannot trust the equipment used by  ... 
arXiv:1506.04429v1 fatcat:pm2ffa46yzahbdsqzzg5v3fxaa

Towards practical privacy-preserving genome-wide association study

Charlotte Bonte, Eleftheria Makri, Amin Ardeshirdavani, Jaak Simm, Yves Moreau, Frederik Vercauteren
2018 BMC Bioinformatics  
The secure multiparty computation technique completes its execution in approximately 2 ms for data contributed by one million subjects.  ...  Results: We propose two provably secure solutions to address this challenge: (1) a somewhat homomorphic encryption (HE) approach, and (2) a secure multiparty computation (MPC) approach.  ...  Bayesian multi-relational factorization with features); imec strategic funding 2017, imec ICON GAP.  ... 
doi:10.1186/s12859-018-2541-3 fatcat:jxi5l2xw3vdkplosqdi6rfxr4y

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.  ...  The traditional enabler of SMC is cryptography, but the significant number of cryptographic operations required results in these techniques being impractical for most real-time, online computations.  ...  Acknowledgments Special thanks are due to Patrick Traynor and Thomas Shrimpton for their interest in and constructive criticisms of this work.  ... 
doi:10.1155/2019/1368905 fatcat:izynm6msrvehfa3ghkw7tykk34

Systematizing Secure Computation for Research and Decision Support [chapter]

Jason Perry, Debayan Gupta, Joan Feigenbaum, Rebecca N. Wright
2014 Lecture Notes in Computer Science  
We propose a framework for organizing and classifying research results in the active field of secure multiparty computation (MPC).  ...  We have classified a large number of MPC protocols on these axes and developed an interactive tool for exploring the problem space of secure computation.  ...  The U.S. government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon.  ... 
doi:10.1007/978-3-319-10879-7_22 fatcat:mbmbehaxtnhipoktng5ffxpjvq

Secure Multiparty Computation of Approximations [chapter]

Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin J. Strauss, Rebecca N. Wright
2001 Lecture Notes in Computer Science  
Furthermore, for some applications, the parties want to compute a function of their inputs securely, without revealing more information than necessary.  ...  We start by extending standard definitions of secure (exact) computation to the setting of secure approximations.  ...  We thank Dana Randall for suggesting applications of the permanent described in Section 6.1 and Jessica Fong for helpful discussions and collaboration in early stages of this work.  ... 
doi:10.1007/3-540-48224-5_75 fatcat:x5i537h26rgvnotmxfkwgk5rci

Secure multiparty computation of approximations

Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin J. Strauss, Rebecca N. Wright
2006 ACM Transactions on Algorithms  
Furthermore, for some applications, the parties want to compute a function of their inputs securely, without revealing more information than necessary.  ...  We start by extending standard definitions of secure (exact) computation to the setting of secure approximations.  ...  We thank Dana Randall for suggesting applications of the permanent described in Section 6.1 and Jessica Fong for helpful discussions and collaboration in early stages of this work.  ... 
doi:10.1145/1159892.1159900 fatcat:k73vm7wddfhpxiwjvmrogekj2e

A domain-specific programming language for secure multiparty computation

Janus Dam Nielsen, Michael I. Schwartzbach
2007 Proceedings of the 2007 workshop on Programming languages and analysis for security - PLAS '07  
We focus on the Secure Multiparty Computation Language (SMCL) a domain-specific language for Secure Multiparty Computation (SMC).  ...  SMCL provides high-level abstractions and strong security guaranties to aid the programmer in producing programs for secure multiparty computation which do not reveal unintended information.  ...  We have created the Secure Multiparty Computation Language which provides high-level abstractions for secure multiparty computations along with strong security guaranties which protects against a broad  ... 
doi:10.1145/1255329.1255333 dblp:conf/pldi/NielsenS07 fatcat:4kgv6266ijbmlcrn7laigvvsom

An Elliptic Curve Based Schnorr Cloud Security Model in Distributed Environment

Vinothkumar Muthurajan, Balaji Narayanasamy
2016 The Scientific World Journal  
Cloud computing requires the security upgrade in data transmission approaches.  ...  This paper proposes a virtual machine based cloud model with Hybrid Cloud Security Algorithm (HCSA) to remove the expired content.  ...  Lee and Chen presented the cloud aided computation with elliptic curve cryptosystems [17] to deal with the leakage problem.  ... 
doi:10.1155/2016/4913015 pmid:26981584 pmcid:PMC4770155 fatcat:kz4umm7sgvcahitidu5pr6tm3q

PrivEx

Tariq Elahi, George Danezis, Ian Goldberg
2014 Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security - CCS '14  
Our solution is based on distributed differential privacy and secure multiparty computation; it preserves the security and privacy properties of anonymous communication networks, even in the face of adversaries  ...  To address this issue, we propose a statistical data collection system, PrivEx, for collecting egress traffic statistics from anonymous communication networks in a secure and privacy-preserving manner.  ...  Acknowledgements We would like to thank NSERC, ORF, and The Tor Project for funding this research and our CrySP lab colleagues for their invaluable feedback.  ... 
doi:10.1145/2660267.2660280 dblp:conf/ccs/ElahiDG14 fatcat:ey3zq7jwzjdoli2fnpvf43yoke

A Blockchain-based Iterative Double Auction Protocol using Multiparty State Channels

Truc Nguyen, My T. Thai
2020 ACM Transactions on Internet Technology  
In specific, we propose an extension to the original concept of state channels that can support multiparty computation.  ...  Then we provide a formal development of the proposed framework and prove the security of our design against adversaries.  ...  Finally, a detailed security proof in the UC framework is given.  ... 
doi:10.1145/3389249 fatcat:sezu6rtexfdwtgpiapzcsdzqpu

Resilient Custody of Crypto-Assets, and Threshold Multisignatures

Vincenzo Di Nicola, Riccardo Longo, Federico Mazzone, Gaetano Russo
2020 Mathematics  
Then we delve deeper into some interesting schemes based on secure multiparty computation, which give a blockchain-agnostic solution that balances security, safety, and transactional ease of use, and in  ...  Here we present a survey of the various solutions for this custody problem, comparing advantages and disadvantages.  ...  Acknowledgments: For their suggestions and comments, we would like to thank Alessio Meneghetti, Massimiliano Sala, and Zsolt Levente Kucsván.  ... 
doi:10.3390/math8101773 fatcat:wz3ckmqmxzaqveipkbkowbcb2a
« Previous Showing results 1 — 15 out of 825 results