Filters








31 Hits in 3.9 sec

Cryptography from Anonymity

Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai
2006 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)  
Note that since each player P knows its integer r P they can both compute the (same) common bit, whereas other users (as well as the board operator) cannot distinguish r A from r B and thus learn nothing  ...  We show that anonymous communication over insecure channels can be used to implement unconditionally secure point-to-point channels, broadcast, and general multi-party protocols that remain unconditionally  ...  We thank Andreas Pfitzmann for pointing out the relevance of [2, 47] to implementing key agreement based on anonymity, and Matthias Fitzi for pointing out the relevance of [48] to implementing broadcast  ... 
doi:10.1109/focs.2006.25 dblp:conf/focs/IshaiKOS06 fatcat:b5mrxfdijvgj3kbbxk7z3gmtiq

Resource Fairness and Composability of Cryptographic Protocols [chapter]

Juan Garay, Philip MacKenzie, Manoj Prabhakaran, Ke Yang
2006 Lecture Notes in Computer Science  
Turning to constructions, we define a "commit-prove-fair-open" functionality and design an efficient resource-fair protocol that securely realizes it, using a new variant of a cryptographic primitive known  ...  In particular, our definition is similar to the security definition in the universal composability (UC) framework, but works in a model that allows any party to request additional resources from the environment  ...  We thank Amit Sahai for helpful discussions on the formulation of the notion of resource fairness, and Yehuda Lindell and Jesper Nielsen, as well as the anonymous reviewers for TCC '06 for their many helpful  ... 
doi:10.1007/11681878_21 fatcat:m4pbycyqwfc5zpoditsc474vzm

Resource Fairness and Composability of Cryptographic Protocols

Juan A. Garay, Philip MacKenzie, Manoj Prabhakaran, Ke Yang
2010 Journal of Cryptology  
Turning to constructions, we define a "commit-prove-fair-open" functionality and design an efficient resource-fair protocol that securely realizes it, using a new variant of a cryptographic primitive known  ...  In particular, our definition is similar to the security definition in the universal composability (UC) framework, but works in a model that allows any party to request additional resources from the environment  ...  We thank Amit Sahai for helpful discussions on the formulation of the notion of resource fairness, and Yehuda Lindell and Jesper Nielsen, as well as the anonymous reviewers for TCC '06 for their many helpful  ... 
doi:10.1007/s00145-010-9080-z fatcat:xvvxw462zvbolfr2i3krcn44fu

Secure Multi-Party Computation with Identifiable Abort [chapter]

Yuval Ishai, Rafail Ostrovsky, Vassilis Zikas
2014 Lecture Notes in Computer Science  
Protocols for secure multi-party computation (MPC) that resist a dishonest majority are susceptible to "denial of service" attacks, allowing even a single malicious party to force the protocol to abort  ...  We present the first information-theoretic MPC protocol which is secure with identifiable abort (in short ID-MPC) using a correlated randomness setup.  ...  Most of these protocols, however, are restricted to provide security against semi-honest adversaries, or alternatively assume an honest majority.  ... 
doi:10.1007/978-3-662-44381-1_21 fatcat:crytxx3kh5bhth45o22jmzueom

PMDP: A Framework for Preserving Multiparty Data Privacy in Cloud Computing

Ji Li, Jianghong Wei, Wenfen Liu, Xuexian Hu
2017 Security and Communication Networks  
Meanwhile, the returned analysis result suffers from malicious inference attacks and also discloses user privacy.  ...  Moreover, we propose a security enhanced framework sPMDP to resist malicious inside participants and outside adversaries.  ...  As a major -differential privacy mechanism, Laplace mechanism perturbs the output of a function DP on a dataset by adding to DP ( ) a noise randomly sampled from the Laplace distribution.  ... 
doi:10.1155/2017/6097253 fatcat:bjlmb7jqyfes7ehhydh5eyooym

Constant-round Multi-party Quantum Computation for Constant Parties [article]

Zhu Cao
2020 arXiv   pre-print
Our work constitutes a key step towards practical implementation of secure multi-party quantum computation, and opens the door for practitioners to be involved in this exciting field.  ...  One of the central themes in classical cryptography is multi-party computation, which performs joint computation on multiple participants' data while maintaining data privacy.  ...  Acknowledgements This work was supported by the internal Grant No. SLH00202007 from East China University of Science and Technology. Note added.  ... 
arXiv:2011.12061v1 fatcat:g2jczxv2efbq7ifbr5jkko6dia

New notions of security

Manoj Prabhakaran, Amit Sahai
2004 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC '04  
We propose a modification to the framework of Universally Composable (UC) security [3] .  ...  Our new notion involves comparing the real protocol execution with an ideal execution involving ideal functionalities (just as in UC-security), but allowing the environment and adversary access to some  ...  Acknowledgments We would like to thank Boaz Barak, Ran Canetti, Yuval Ishai, Yehuda Lindell, Oded Goldreich and Rafael Pass for many useful discussions.  ... 
doi:10.1145/1007352.1007394 dblp:conf/stoc/PrabhakaranS04 fatcat:y22zkqqzzbdt3o457blxwojbr4

Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs

Eli Ben-Sasson, Alessandro Chiesa, Matthew Green, Eran Tromer, Madars Virza
2015 2015 IEEE Symposium on Security and Privacy  
In this work, we show how public parameters for a class of NIZKs can be generated by a multi-party protocol, such that if at least one of the parties is honest, then the result is secure (in both aforementioned  ...  ., zk-SNARK schemes) necessitate a trusted party to generate and publish some public parameters, to be used by all provers and verifiers.  ...  (2) zero knowledge: if at least one party is honest and V (tr) = 1, tr reveals no information beyond pp in the sense that S(pp) is indistinguishable from tr.  ... 
doi:10.1109/sp.2015.25 dblp:conf/sp/Ben-SassonC0TV15 fatcat:lh2mmdyenjhexcmt3cytfwncfa

Collusion-Preserving Computation [chapter]

Joël Alwen, Jonathan Katz, Ueli Maurer, Vassilis Zikas
2012 Lecture Notes in Computer Science  
The goals in revisiting the definition are: • To give a definition with respect to arbitrary communication resources (that includes as special cases the communication models from prior work).  ...  We show that the resulting protocols enjoy an elegant (and surprisingly strong) fallback security even in the case when the underlying communication resource acts in a Byzantine manner.  ...  Upon receiving a message m from party: Let resource R CP H then if H is a broadcast channel then R is not CP-complete.  ... 
doi:10.1007/978-3-642-32009-5_9 fatcat:25h2cbfo3jfsnmkypp7zck4qtu

GDPR-Compliant Personal Data Management: A Blockchain-based Solution

Nguyen Binh Truong, Kai Sun, Gyu Myoung Lee, Yike Guo
2019 IEEE Transactions on Information Forensics and Security  
and cryptography techniques.  ...  This motivates us to envision a design concept for developing a GDPR-compliant personal data management platform leveraging the emerging blockchain and smart contract technologies.  ...  DS is eligible to do all CRUD operations to her personal data as specified in the default policy when ledgers are initialised, and no one can change these rights. • "Right of restricted processing" and  ... 
doi:10.1109/tifs.2019.2948287 fatcat:f2rc4z7p7zb7vbhckwskmdy4ha

Redactable Blockchain – or – Rewriting History in Bitcoin and Friends

Giuseppe Ateniese, Bernardo Magri, Daniele Venturi, Ewerton Andrade
2017 2017 IEEE European Symposium on Security and Privacy (EuroS&P)  
As we argue, there are several reasons to prefer an editable blockchain, spanning from the necessity to remove inappropriate content and the possibility to support applications requiring re-writable storage  ...  entity and where such a capability is distributed among several distrustful parties (as is the case with Bitcoin).  ...  First, each player P i chooses a random k i ←$ Z q and then all players engage into a semi-honest MPC protocol for computing r := h + n i=1 g k i mod p mod q.  ... 
doi:10.1109/eurosp.2017.37 dblp:conf/eurosp/AtenieseM0A17 fatcat:d3upjg7jpjfr5heyxuozfamjvu

Minimal Complete Primitives for Secure Multi-party Computation [chapter]

Matthias Fitzi, Juan A. Garay, Ueli Maurer, Rafail Ostrovsky
2001 Lecture Notes in Computer Science  
The study of minimal cryptographic primitives needed to implement secure computation among two or more players is a fundamental question in cryptography.  ...  We show that our primitives are complete and of minimal cardinality possible.  ...  Although there seems to be no apparent solution to this problem since a dishonest majority might always overrule the honest players' speci cation, we n o w describe how the UBB n e ectively overcomes this  ... 
doi:10.1007/3-540-44647-8_5 fatcat:a7mvbwir7feglcmzfd5w4jbzkq

Minimal Complete Primitives for Secure Multi-Party Computation

Matthias Fitzi, Juan A. Garay, Ueli Maurer, Rafail Ostrovsky
2004 Journal of Cryptology  
The study of minimal cryptographic primitives needed to implement secure computation among two or more players is a fundamental question in cryptography.  ...  We show that our primitives are complete and of minimal cardinality possible.  ...  Although there seems to be no apparent solution to this problem since a dishonest majority might always overrule the honest players' speci cation, we n o w describe how the UBB n e ectively overcomes this  ... 
doi:10.1007/s00145-004-0150-y fatcat:c2246oao6rhd5i3tocxk2a4s5e

Smart Grid Metering Networks: A Survey on Security, Privacy and Open Research Issues

Pardeep Kumar, Yun Lin, Guangdong Bai, Andrew Paverd, Jin Song Dong, Andrew Martin
2019 IEEE Communications Surveys and Tutorials  
Based on the presented threats, we derive a set of security and privacy requirements for SG metering networks.  ...  Specifically, we present a threat taxonomy considering: (i) threats in system-level security, (ii) threats and/or theft of services, and (iii) threats to privacy.  ...  Indeed, strong cryptography requires extensive computation and resource.  ... 
doi:10.1109/comst.2019.2899354 fatcat:67bz5glcfbbldpqagxmhvy2ssm

VeriFL: Communication-efficient and Fast Verifiable Aggregation for Federated Learning

Xiaojie Guo, Zheli Liu, Jin Li, Jiqiang Gao, Boyu Hou, Changyu Dong, Thar Baker
2020 IEEE Transactions on Information Forensics and Security  
To the best of our knowledge, there is no previous work that succeeds in designing a communication-efficient verifiable aggregation protocol.  ...  Another trivial solution to achieve verifiable aggregation is using generic multiparty computation (MPC) approaches [14], [15], [16], [17], [18], [19], [20], [21], but its communication and computational  ...  Boyu Hou is a postgraduate from Nankai University, Computer Science Department, Database and Information System Lab, and majors in Computer Science.  ... 
doi:10.1109/tifs.2020.3043139 fatcat:ebxe232koje6thp47cirudmx4y
« Previous Showing results 1 — 15 out of 31 results