Filters








94 Hits in 6.3 sec

Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels [article]

T-H. Hubert Chan and Zhibin Liang and Antigoni Polychroniadou and Elaine Shi
2019 arXiv   pre-print
We revisit the problem of low-memory robust simulation of interactive protocols over noisy channels.  ...  Haeupler [FOCS 2014] considered robust simulation of two-party interactive protocols over oblivious, as well as adaptive, noisy channels.  ...  Introduction This paper revisits the problem of low-memory robust simulation of interactive protocols over a noisy channel that corrupts any fraction of the transmitted symbols.  ... 
arXiv:1910.12175v1 fatcat:v6ndutlrlzdqvi2uox3jhkfgxi

Cryptography with One-Way Communication [chapter]

Sanjam Garg, Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai
2015 Lecture Notes in Computer Science  
We initiate a general study of cryptographic protocols over noisy channels in a setting where only one party speaks.  ...  Following the work of Crépeau and Kilian [CK88], the entire body of research on secure two-party computation over noisy channels requires parties to interact.  ...  Deterministic Our Results We initiate a general study of one-way secure computation (OWSC) protocols over noisy channels in a setting where only one party speaks.  ... 
doi:10.1007/978-3-662-48000-7_10 fatcat:y2frwwgmz5huhnmzolbkwcvtte

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

Joseph I. Choi, Kevin R. B. Butler
2019 Security and Communication Networks  
This paper revisits the history of improvements to SMC over the years and considers the possibility of coupling trusted hardware with SMC.  ...  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

PRECAD: Privacy-Preserving and Robust Federated Learning via Crypto-Aided Differential Privacy [article]

Xiaolan Gu, Ming Li, Li Xiong
2021 arXiv   pre-print
., secret sharing), noise is added to the model updates by the honest-but-curious server(s) (instead of each client) without revealing clients' inputs, which achieves the benefit of centralized DP in terms  ...  Meanwhile, a crypto-aided secure validation protocol is designed to verify that the contribution of model update from each client is bounded without leaking privacy.  ...  We can observe that the robustness guarantee is stronger when B and Kµ are small, where a small B makes the range of loss small, and a small K limits the controlling capability of the attacker.  ... 
arXiv:2110.11578v1 fatcat:ndwe2a7g6zhxxlb6clouu7tl3e

Advances and Open Problems in Federated Learning [article]

Peter Kairouz, H. Brendan McMahan, Brendan Avent, Aurélien Bellet, Mehdi Bennis, Arjun Nitin Bhagoji, Kallista Bonawitz, Zachary Charles, Graham Cormode, Rachel Cummings, Rafael G.L. D'Oliveira, Hubert Eichner (+47 others)
2021 arXiv   pre-print
Federated learning (FL) is a machine learning setting where many clients (e.g. mobile devices or whole organizations) collaboratively train a model under the orchestration of a central server (e.g. service  ...  FL embodies the principles of focused data collection and minimization, and can mitigate many of the systemic privacy risks and costs resulting from traditional, centralized machine learning and data science  ...  In particular, wireless interference, noisy channels and channel fluctuations can significantly hinder the information exchange between the server and clients (or directly between individual clients, as  ... 
arXiv:1912.04977v3 fatcat:efkbqh4lwfacfeuxpe5pp7mk6a

Security in Quantum Cryptography [article]

Christopher Portmann, Renato Renner
2021 arXiv   pre-print
The cryptographic requirement here is that the transmitted messages remain inaccessible to anyone other than the designated recipients, even if the communication channel is untrusted.  ...  Quantum cryptography exploits principles of quantum physics for the secure processing of information.  ...  And because σ qkd E simulates the real protocols, if we plug a converter π E in Kσ qkd E which emulates the noisy channel Q q and blogs the output of the simulated authentic channel, then K δ = Kσ qkd  ... 
arXiv:2102.00021v2 fatcat:rvvofut5ingrvodafyjhdbol34

Secure Federated Submodel Learning [article]

Chaoyue Niu, Fan Wu, Shaojie Tang, Lifeng Hua, Rongfei Jia, Chengfei Lv, Zhihua Wu, Guihai Chen
2019 arXiv   pre-print
Nevertheless, the "position" of a client's truly required submodel corresponds to her private data, and its disclosure to the cloud server during interactions inevitably breaks the tenet of federated learning  ...  Federated learning was proposed with an intriguing vision of achieving collaborative machine learning among numerous clients without uploading their private data to a cloud server.  ...  ACKNOWLEDGMENT We would like to sincerely thank some members of Advanced Network Laboratory (ANL) in Shanghai Jiao Tong University, including Renjie Gu, Hongtao Lv, Hejun Xiao, and Zhenzhe Zheng, as well  ... 
arXiv:1911.02254v2 fatcat:aankusilkjfbtcwboh6odhx4ju

Session reports for SIGCOMM 2010

Shailesh Agrawal, Immanuel Ilavarasan Thomas, Arun Vishwanath, Tianyin Xu, Fang Yu, Kavitha Athota, Pramod Bhatotia, Piyush Goyal, Phani Krisha, Kirtika Ruchandan, Nishanth Sastry, Gurmeet Singh (+1 others)
2011 Computer communication review  
Analysed more than 200 ExB of commercial Internet traffic over a two year period.  ...  On TRILL -Transparent Interconnection of Lots of Links • Concept of RBridges: devices that implement the TRILL protocol. • Gist given in the version 2 of Algorhyme A network where RBridges can Route packets  ...  If a large number of clients in single network see a problem then we have a problem. Use bittorrent client to do this. Our solution is NEWS. Has over 48k users.  ... 
doi:10.1145/1925861.1925873 fatcat:jpaoo55h75hprb5k2vlkin5zzi

Erasable Bit Commitment from Temporary Quantum Trust [article]

Norbert Lütkenhaus, Ashutosh S Marwah, Dave Touchette
2019 arXiv   pre-print
Lastly, our protocol for this primitive requires a constant number of trusted third parties and can tolerate a small number of corrupt trusted parties as well as implementation errors.  ...  However, once the protocol concludes, there is no guarantee over the behaviour of these third parties. It is possible that they collaborate and act adversarially.  ...  Robust Protocol for EBC based on BB8states In this section, we will develop a protocol for EBC using BB84 states which is robust to noise and a small non-zero number of dishonest trusted nodes.  ... 
arXiv:1910.13949v1 fatcat:hpqvyxtjynfeda4qfnmvt5cx2y

Quantum cryptography beyond quantum key distribution

Anne Broadbent, Christian Schaffner
2015 Designs, Codes and Cryptography  
beyond the realm of QKD.  ...  of quantum security models for classical primitives.  ...  Acknowledgments It is a pleasure to acknowledge conversations with Gilles Brassard, Gus Gutoski, Serge Fehr and Louis Salvail in the preparation of this document.  ... 
doi:10.1007/s10623-015-0157-4 pmid:32226229 pmcid:PMC7089691 fatcat:zm7zdq4l6babtd4y5ygwmttt2q

Quantum Cryptography: Key Distribution and Beyond

Akshata Shenoy-Hejamadi, Anirban Pathak, Srikanth Radhakrishna
2017 Quanta  
We review the progress of quantum cryptography in the last decade, covering quantum key distribution and other applications.</p><p>Quanta 2017; 6: 1–47.</p>  ...  Quantum key distribution and string oblivious transfer in noisy channels.  ...  Normally, the client must be able to prepare singlequbit states. But even a classical client can perform blind quantum computation by interacting with two entangled (but non-communicating) servers.  ... 
doi:10.12743/quanta.v6i1.57 fatcat:nwczh5zqjjch3abhrpcjb34ry4

From Keys to Databases—Real-World Applications of Secure Multi-Party Computation

David W Archer, Dan Bogdanov, Yehuda Lindell, Liina Kamm, Kurt Nielsen, Jakob Illeborg Pagter, Nigel P Smart, Rebecca N Wright
2018 Computer journal  
We highlight in this paper a number of these, ranging from securing small high value items such as cryptographic keys, through to securing an entire database.  ...  We discuss the widely increasing range of applications of a cryptographic technique called Multi-Party Computation.  ...  Each result share is then returned to the result party's platform over a secure channel. The shares are then combined by client-side Jana tools to provide query results in usable form.  ... 
doi:10.1093/comjnl/bxy090 fatcat:dnpklhzlcfca3autnp3wftkdya

Precision Health Data: Requirements, Challenges and Existing Techniques for Data Security and Privacy [article]

Chandra Thapa, Seyit Camtepe
2020 arXiv   pre-print
., interaction between the health data centers).  ...  Thus, the security, privacy of and trust on the information are of utmost importance. Moreover, government legislation and ethics committees demand the security and privacy of healthcare data.  ...  It is used for drug discovery, where models were trained on 259 datasets, including PubChem BioAssay, datasets designed to predict interactions among proteins and small molecules, and database designed  ... 
arXiv:2008.10733v1 fatcat:oj2neoftf5hcbpatnfn7ntyhzy

Composable security in relativistic quantum cryptography

V Vilasini, Christopher Portmann, Lidia del Rio
2019 New Journal of Physics  
through any classical, quantum or post-quantum relativistic protocols are all impossible without further setup assumptions; (3) it is impossible to securely increase the delay of a channel, given several  ...  short-delay channels as ingredients.  ...  The honest protocol as well as the simulator require only elementary local operations and classical communication.  ... 
doi:10.1088/1367-2630/ab0e3b fatcat:45mtz33ybvam3hj4virvd3o2fq

Optimal fuzzy system design for additive noise removal in color images

Snekha Snekha
2013 IOSR Journal of Electronics and Communication Engineering  
use pixel similarity based concept.The Gaussian noise will be removed by using weighted mean filtering of peer group members.  ...  In the first step the bacterial foraging technique is used to find the edges using a set of bacteria's that are randomly initialized to image pixel then they will try to search their nutrients which are  ...  Acknowledgements The authors thank the reviewers for their valuable comments and suggestions that helped us to make the paper in its present form Speed and Position Control of Train System Using GPS www.iosrjournals.org  ... 
doi:10.9790/2834-560107 fatcat:hhbke72jsrcuxhvryf777lq3ja
« Previous Showing results 1 — 15 out of 94 results