Proceedings ArticleDOI
Constant phase efficient protocols for secure message transmission in directed networks
Arpita Patra,Ashish Choudhary,Chanrasekharan Pandu Rangan +2 more
- pp 322-323
TLDR
The arrangement performs the steps of preaccelerating the slide before a front end of the workpiece hits an abutment located on the slide in the path of the front endof the workpieces to a speed smaller than the speed at which the work piece advances.Abstract:
An arrangement for controlling the advancing device of a machine for repetitive operations, especially for controlling the advancing speed of a slide carrying a cutting device of a cutting machine for cutting an elongated workpiece, such as a profile emanating at a predetermined speed from an extrusion press, a straightening machine or the like, into sections of uniform length. The arrangement performs the steps of preaccelerating the slide before a front end of the workpiece hits an abutment located on the slide in the path of the front end of the workpiece to a speed smaller than the speed at which the workpiece advances, and accelerating the speed of the slide to the speed of the workpiece upon engagement of the front end of the workpiece with the abutment, and subsequently thereto actuating the cutting device, whereby the impact force of the workpiece on the abutment is reduced, so that buckling of the workpiece upon impact on the abutment is prevented and the accuracy of the cutting operation is increased.read more
Citations
More filters
Book ChapterDOI
Perfectly secure message transmission in directed networks tolerating threshold and non threshold adversary
TL;DR: This paper significantly improve the exponential phase protocol and presents an elegant and efficient three phase PSMT protocol with polynomial communication complexity (and computational complexity) with n= max(3t-2u+1, 2t+1) wires from S to R.
Proceedings ArticleDOI
On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary
TL;DR: This paper studies the inherent tradeoff between the network connectivity, phase complexity and communication complexity of PRMT problem in undirected synchronous network, tolerating a mixed adversary A-sub, who has unbounded computing power and can corrupt t-sub nodes in the network in Byzantine and fail-stop fashion respectively.
Book ChapterDOI
On communication complexity of secure message transmission in directed networks
TL;DR: The lower bounds on communication complexity of two and three or more phase PSMT protocols in directed networks are derived and a communication optimal PRMT over a directed network that satisfies the conditions stated in the characterization is designed.
Posted Content
Protocols for Reliable and Secure Message Transmission.
TL;DR: Several new/improved/efficient/optimal solutions are reported, affirmative/negative answers to several significant open problems are given, and first solutions to several newly formulated problems are provided.
Journal ArticleDOI
Perfectly reliable and secure message transmission tolerating mobile adversary
TL;DR: It is shown that the mobility of the threshold adversary does not affect the possibility and optimality of PRMT and PSMT protocols, and the characterisation for PRMT/PSMT against non-threshold static and non-Threshold mobile adversary are not same.
References
More filters
Book
The Theory of Error-Correcting Codes
TL;DR: This book presents an introduction to BCH Codes and Finite Fields, and methods for Combining Codes, and discusses self-dual Codes and Invariant Theory, as well as nonlinear Codes, Hadamard Matrices, Designs and the Golay Code.
Book ChapterDOI
Perfectly Secure Message Transmission Revisited
TL;DR: In this paper, the necessary and sufficient conditions for achieving secure communications against active adversaries in mixed one-way and two-way channels were studied. But they only considered the case when all channels are two-ways or all channels were one-ways.
Proceedings ArticleDOI
Possibility and complexity of probabilistic reliable communication in directed networks
Kannan Srinathan,C. Pandu Rangan +1 more
TL;DR: This work provides a complete characterization of directed networks in which probabilistic reliable communication is possible and outlines a round optimal protocol for the same.