1,023 Hits in 4.8 sec

Noisy Tags: A Pretty Good Key Exchange Protocol for RFID Tags [chapter]

Claude Castelluccia, Gildas Avoine
2006 Lecture Notes in Computer Science  
ones sent by the noisy tag.  ...  It can also be used to securely refresh a tag's identifier by, for example, xoring the new identifier with the exchanged secret key.  ...  This idea can easily be extended to establish a key between two parties A and B over a public channel as follows: B starts by generating a sequence of random bits, noise N (i), on the channel.  ... 
doi:10.1007/11733447_21 fatcat:2rtt25pv4vai3n3eg5wa6oiqdu

Two Round Multiparty Computation via Multi-key FHE [chapter]

Pratyay Mukherjee, Daniel Wichs
2016 Lecture Notes in Computer Science  
All parties can then homomorphically compute a multi-key encryption of the output. 2. Each party broadcasts a partial decryption of the output using its secret key.  ...  In the honestbut-curious setting we only rely on the learning with errors (LWE) assumption, and in the fully malicious setting we additionally assume the existence of non-interactive zero knowledge arguments  ...  Acknowledgments We thank Antigoni Polychroniadou for her helpful comments and helping us find and fix a subtle error with the extended MPC protocol given in a previous version of this work.  ... 
doi:10.1007/978-3-662-49896-5_26 fatcat:ylnb3mzo4bbu3douzogbugxqwu

Private data transfer over a broadcast channel

Manoj Mishra, Tanmay Sharma, Bikash K. Dey, Vinod M. Prabhakaran
2015 2015 IEEE International Symposium on Information Theory (ISIT)  
We consider this problem when a binary erasure broadcast channel with independent erasures is available from Alice to Bob and Cathy in addition to a noiseless public discussion channel.  ...  with the other user.  ...  private data transfer over a broadcast channel For simplicity we first consider the case of a database with two files.  ... 
doi:10.1109/isit.2015.7282676 dblp:conf/isit/MishraSDP15 fatcat:rcrhqu7eyvguraudl3sbwlulqy

Composable Security for Multipartite Entanglement Verification [article]

Raja Yehia, Eleni Diamanti, Iordanis Kerenidis
2020 arXiv   pre-print
in the presence of a noisy or malicious source.  ...  Our protocol can typically be used as a subroutine in a Quantum Internet, to securely share a GHZ state among the network before performing a communication or computation protocol.  ...  We also acknowledge support from the European Union through the Project ERC-2017-STG-758911 QUSCO, from QuantERA through the project QuantAlgo and from the ANR through the Project ANR-17-CE39-0005 quBIC  ... 
arXiv:2004.07679v3 fatcat:vbwdcu5omjdvjbfmewh2vi3gaq

Cryptography from Anonymity

Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai
2006 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)  
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 show that anonymous channels can yield major efficiency improvements for several natural secure computation tasks.  ...  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

Ergodic Secrecy Capacity Region of the Fading Broadcast Channel

E. Ekrem, S. Ulukus
2009 2009 IEEE International Conference on Communications  
First, we consider a more general channel model which consists of L independent subchannels, where in each sub-channel, one of the users' channel is less noisy with respect to the other user.  ...  region of the fading broadcast channel.  ...  PARALLEL LESS NOISY BROADCAST CHANNELS WITH CONFIDENTIAL MESSAGES We consider the class of two-user parallel BCs with L subchannels, where in each sub-channel, one user's channel is less noisy with respect  ... 
doi:10.1109/icc.2009.5199000 dblp:conf/icc/EkremU09 fatcat:aufqhkczwzhplibtcksijj6qjy

On the oblivious transfer capacity of the degraded wiretapped binary erasure channel

Manoj Mishra, Bikash Kumar Dey, Vinod M. Prabhakaran, Suhas Diggavi
2015 2015 IEEE International Symposium on Information Theory (ISIT)  
We study oblivious transfer (OT) between Alice and Bob in the presence of an eavesdropper Eve over a degraded wiretapped binary erasure channel from Alice to Bob and Eve.  ...  Here we derive a lower bound on the OT capacity in the same secrecy model when the wiretapped binary erasure channel is degraded in favour of Bob.  ...  In [12] , the problem of performing independent OTs between Alice and each of the other parties over a binary erasure broadcast channel was considered.  ... 
doi:10.1109/isit.2015.7282639 dblp:conf/isit/MishraDPD15 fatcat:hxdhmvrbafbefi5axseao7rfo4

MFSPV: A Multi-Factor Secured and Lightweight Privacy-Preserving Authentication Scheme for VANETs

Saad Ali Alfadhli, Songfeng Lu, Kai Chen, Meriem Sebai
2020 IEEE Access  
A detailed analysis demonstrates that our scheme efficiently meets the VANETs security requirements, and offers more suitable communication and computation costs and features than existing schemes.  ...  Furthermore, it eliminates the heavy dependency on the system key by decentralising the wide precinct of the certificate authority ( ) into regional domains and achieves robust control of domains keys.  ...  The proposed multi-factor combination of the with dynamic data makes it impossible for any malicious party to compromise the secret data.  ... 
doi:10.1109/access.2020.3014038 fatcat:kuzqk4ozmvgufjgqsf3c74j6ve

Wiretapped Oblivious Transfer [article]

Manoj Mishra, Bikash Kumar Dey, Vinod M. Prabhakaran, Suhas Diggavi
2016 arXiv   pre-print
The resource enabling OT in our setup is a noisy broadcast channel from Alice to Bob and Eve.  ...  When Alice and Bob are honest-but-curious and the noisy broadcast channel is made up of two independent binary erasure channels (connecting Alice-Bob and Alice-Eve), we derive the 1-of-2 string OT capacity  ...  Alice can communicate with Bob and Eve over a broadcast channel p Y Z|X , with the output Y available to Bob and the output Z available to Eve.  ... 
arXiv:1604.05668v2 fatcat:mykltmgufzcwhmoiktsg446ewm

Long term confidentiality: a survey

Johannes Braun, Johannes Buchmann, Ciaran Mullan, Alex Wiesmaier
2012 Designs, Codes and Cryptography  
Yet encryption under a computationally secure cryptosystem cannot provide a guarantee of long term confidentiality, due to potential advances in computing power or cryptanalysis.  ...  Long term confidentiality is ensured by information theoretically secure ciphers, but at the expense of impractical key agreement and key management.  ...  Moreover it is not clear how to physically realise noisy channels with the required properties.  ... 
doi:10.1007/s10623-012-9747-6 fatcat:uk3afgjhrfduxeytawbqkvt4fq

VerLoc: Verifiable Localization in Decentralized Systems [article]

Katharina Kohls, Claudia Diaz
2021 arXiv   pre-print
setups with up to 20 % malicious nodes.  ...  We evaluate VerLoc both with simulations and in the wild using a prototype implementation integrated in the Nym network (currently run by thousands of nodes).  ...  Acknowledgments We would like to thank the Nym team for enabling the VerLoc prototype.  ... 
arXiv:2105.11928v3 fatcat:kvhotfottjdqpotk5ub3hixafa

The Oblivious Transfer Capacity of the Wiretapped Binary Erasure Channel [article]

Manoj Mishra, Bikash Kumar Dey, Vinod M. Prabhakaran, Suhas Diggavi
2014 arXiv   pre-print
When the broadcast channel consists of two independent binary erasure channels, we derive the oblivious transfer capacity for both 2-privacy (where the eavesdropper may collude with either party) and 1  ...  We consider oblivious transfer between Alice and Bob in the presence of an eavesdropper Eve when there is a broadcast channel from Alice to Bob and Eve.  ...  Specifically, a noisy channel between the parties provides a means to achieve secure computation [4] .  ... 
arXiv:1404.6614v1 fatcat:towvguincvckffsqygdgeoftye

Verifiable Quantum Secure Modulo Summation [article]

Masahito Hayashi, Takeshi Koshiba
2019 arXiv   pre-print
., Y_m with keeping the secrecy of the individual variables. However, the conventional method for secure modulo summation uses so many secret communication channels.  ...  This protocol can be verified only with minimum requirements.  ...  message transmission with the broadcast public channel [35] .  ... 
arXiv:1910.05976v1 fatcat:gbmmrwznpfbebbqw3jveqf3v2i

Distillation-Based Semi-Supervised Federated Learning for Communication-Efficient Collaborative Training with Non-IID Private Data

Sohei Itahara, Takayuki Nishio, Yusuke Koda, Masahiro Morikura, Koji Yamamoto
2021 IEEE Transactions on Mobile Computing  
In DS-FL, the communication cost depends only on the output dimensions of the models and does not scale up according to the model size.  ...  We further highlight that in DS-FL, the heterogeneity of the devices' dataset leads to ambiguous of each data sample and lowing of the training convergence.  ...  ACKNOWLEDGMENTS This work was supported in part by JSPS KAKENHI Grant Numbers JP17H03266, JP18K13757, JST PRESTO Grant Number JPMJPR2035, and the KDDI Foundation.  ... 
doi:10.1109/tmc.2021.3070013 fatcat:igyeozymhfb27fvdtyz4c56dve

Consensus Needs Broadcast in Noiseless Models but can be Exponentially Easier in the Presence of Noise [article]

Andrea Clementi, Luciano Gualà, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca, Luca Trevisan
2018 arXiv   pre-print
We then turn to distributed models with noisy communication channels that have been studied in the context of some bio-inspired systems.  ...  Consensus and Broadcast are two fundamental problems in distributed computing, whose solutions have several applications.  ...  More in details, in Lemma 4.3, we show that any Almost-Consensus protocol implies a solution to a two-party communication problem over a noisy communication channel, where one of the two parties represents  ... 
arXiv:1807.05626v1 fatcat:2zabipxldffehb7u4tvjs67oci
« Previous Showing results 1 — 15 out of 1,023 results