The Experts below are selected from a list of 360 Experts worldwide ranked by ideXlab platform
Kazuhiro Suzuki - One of the best experts on this subject based on the ideXlab platform.
-
truly efficient 2 round perfectly secure Message Transmission scheme
International Cryptology Conference, 2008Co-Authors: Kaoru Kurosawa, Kazuhiro SuzukiAbstract:In themodel of perfectly secureMessage Transmission schemes (PSMTs), there are n channels between a sender and a receiver. An infinitely powerful adversary A may corrupt (observe and forge) the Messages sent through t out of n channels. The sender wishes to send a secret s to the receiver perfectly privately and perfectly reliably without sharing any key with the receiver. In this paper, we show the first 2-round PSMT for n = 2t + 1 such that not only the Transmission rate is O(n) but also the computational costs of the sender and the receiver are both polynomial in n. This means that we solve the open problem raised by Agarwal, Cramer and de Haan at CRYPTO 2006.
-
truly efficient 2 round perfectly secure Message Transmission scheme
IACR Cryptology ePrint Archive, 2008Co-Authors: Kaoru Kurosawa, Kazuhiro SuzukiAbstract:In the model of perfectly secure Message Transmission schemes (PSMTs), there are n channels between a sender and a receiver. An infinitely powerful adversary A may corrupt (observe and forge) the Messages sent through t out of n channels. The sender wishes to send a secret s to the receiver perfectly privately and perfectly reliably without sharing any key with the receiver. In this paper, we show the first 2-round PSMT for n = 2t+ 1 such that not only the Transmission rate is O(n) but also the computational costs of the sender and the receiver are both polynomial in n. This means that we solve the open problem raised by Agarwal, Cramer and de Haan at CRYPTO 2006. The main novelty of our approach is to introduce a notion of pseudobasis to the coding theory. It will be an independent interest for coding theory, too.
-
almost secure 1 round n channel Message Transmission scheme
IACR Cryptology ePrint Archive, 2007Co-Authors: Kaoru Kurosawa, Kazuhiro SuzukiAbstract:It is known that perfectly secure (1-round, n-channel) Message Transmission (MT) schemes exist if and only if n ≥ 3t + 1, where t is the number of channels that the adversary can corrupt. Then does there exist an almost secure MT scheme for n = 2t + 1 ? In this paper, we first sum up a number flaws of the previous almost secure MT scheme presented at Crypto 2004 . We next show an equivalence between almost secure MT schemes and secret sharing schemes with cheaters. By using our equivalence, we derive a lower bound on the communication complexity of almost secure MT schemes. Finally, we present a near optimum scheme which meets our bound approximately. This is the first construction of provably secure almost secure (1-round, n-channel) MT schemes for n = 2t + 1.
Ning Cai - One of the best experts on this subject based on the ideXlab platform.
-
Message Transmission over classical quantum channels with a jammer with side information correlation as resource and common randomness generating
International Symposium on Information Theory, 2019Co-Authors: Minglai Cai, Ning CaiAbstract:In this paper we analyze the capacity of a special model for arbitrarily varying classical-quantum channels when the sender and the receiver use a weak resource. In this model a jammer has side information about the channel input. We determine the correlation assisted capacity. As an application, we determine the correlation assisted common randomness capacity with informed jammer. We also analyze these both capacities when only a small amount of correlation is available.
Kaoru Kurosawa - One of the best experts on this subject based on the ideXlab platform.
-
truly efficient 2 round perfectly secure Message Transmission scheme
International Cryptology Conference, 2008Co-Authors: Kaoru Kurosawa, Kazuhiro SuzukiAbstract:In themodel of perfectly secureMessage Transmission schemes (PSMTs), there are n channels between a sender and a receiver. An infinitely powerful adversary A may corrupt (observe and forge) the Messages sent through t out of n channels. The sender wishes to send a secret s to the receiver perfectly privately and perfectly reliably without sharing any key with the receiver. In this paper, we show the first 2-round PSMT for n = 2t + 1 such that not only the Transmission rate is O(n) but also the computational costs of the sender and the receiver are both polynomial in n. This means that we solve the open problem raised by Agarwal, Cramer and de Haan at CRYPTO 2006.
-
truly efficient 2 round perfectly secure Message Transmission scheme
IACR Cryptology ePrint Archive, 2008Co-Authors: Kaoru Kurosawa, Kazuhiro SuzukiAbstract:In the model of perfectly secure Message Transmission schemes (PSMTs), there are n channels between a sender and a receiver. An infinitely powerful adversary A may corrupt (observe and forge) the Messages sent through t out of n channels. The sender wishes to send a secret s to the receiver perfectly privately and perfectly reliably without sharing any key with the receiver. In this paper, we show the first 2-round PSMT for n = 2t+ 1 such that not only the Transmission rate is O(n) but also the computational costs of the sender and the receiver are both polynomial in n. This means that we solve the open problem raised by Agarwal, Cramer and de Haan at CRYPTO 2006. The main novelty of our approach is to introduce a notion of pseudobasis to the coding theory. It will be an independent interest for coding theory, too.
-
almost secure 1 round n channel Message Transmission scheme
IACR Cryptology ePrint Archive, 2007Co-Authors: Kaoru Kurosawa, Kazuhiro SuzukiAbstract:It is known that perfectly secure (1-round, n-channel) Message Transmission (MT) schemes exist if and only if n ≥ 3t + 1, where t is the number of channels that the adversary can corrupt. Then does there exist an almost secure MT scheme for n = 2t + 1 ? In this paper, we first sum up a number flaws of the previous almost secure MT scheme presented at Crypto 2004 . We next show an equivalence between almost secure MT schemes and secret sharing schemes with cheaters. By using our equivalence, we derive a lower bound on the communication complexity of almost secure MT schemes. Finally, we present a near optimum scheme which meets our bound approximately. This is the first construction of provably secure almost secure (1-round, n-channel) MT schemes for n = 2t + 1.
Dennis Brandao - One of the best experts on this subject based on the ideXlab platform.
-
review a gradient based routing scheme for street lighting wireless sensor networks
Journal of Network and Computer Applications, 2013Co-Authors: Rodrigo Palucci Pantoni, Dennis BrandaoAbstract:Routing for wireless sensor networks based on gradient is a simple, reliable solution resulting in low information costs for the network package, as well as for the node itself. It is used for convergent traffic, where sensor nodes send Messages to the sink node. Due to Message Transmission failures inherent to wireless sensor networks, researches in this area agree that point-to-point Message confirmation in these networks is essential. This work proposes solutions for gradient-based routing using a confirmation mechanism for different neighbors, where four protocol variations are evaluated for sensor networks applications in order to monitor and control electrical variables. Results demonstrate that the protocol based on the longest distance has a satisfactory package delivery rate in severe conditions specified to the application. Furthermore, results show in which situations each routing protocol variation better suits the target application.
Moti Yung - One of the best experts on this subject based on the ideXlab platform.
-
indirect discourse proof achieving efficient fair off line e cash
International Cryptology Conference, 1996Co-Authors: Yair Frankel, Yiannis Tsiounis, Moti YungAbstract:Cryptography has been instrumental in reducing the involvement of over-head third parties in protocols. For example; a digital signature scheme assures a recipient that a judge who is not present at Message Transmission will nevertheless approve the validity of the signature. Similarly, in off-line electronic cash the bank (which is off-line during a purchase) is assured that if a user double spends he will be traced.
-
perfectly secure Message Transmission
Journal of the ACM, 1993Co-Authors: Danny Dolev, Cynthia Dwork, Orli Waarts, Moti YungAbstract:This paper studies the problem of perfectly secure communication in general network in which processors and communication lines may be faulty. Lower bounds are obtained on the connectivity required for successful secure communication. Efficient algorithms are obtained that operate with this connectivity and rely on no complexity-theoretic assumptions. These are the first algorithms for secure communication in a general network to simultaneously achieve the three goals of perfect secrecy, perfect resiliency, and worst-case time linear in the diameter of the network.
