Ontology based approach for video transmission over the network

With the increase in the bandwidth & the transmission speed over the internet, transmission of multimedia objects like video, audio, images has become an easier work. In this paper we provide an approach that can be useful for transmission of video objects over the internet without much fuzz. The approach provides a ontology based framework that is used to establish an automatic deployment of video transmission system. Further the video is compressed using the structural flow mechanism that uses the wavelet principle for compression of video frames. Finally the video transmission algorithm known as RRDBFSF algorithm is provided that makes use of the concept of restrictive flooding to avoid redundancy thereby increasing the efficiency.Comment: 7 pages, 2 figures, 4 table

Batching in cryptography : constructing efficient ciphertexts, time-locked puzzles and proofs

Cryptographic research aims to study and guarantee the confidentiality, integrity, and authenticity of information in an increasingly digital world. This thesis focuses on different cryptographic primitives and intends to optimize the efficiency of deploying these protocols for multiple instances, thereby enhancing their scalability. We propose new designs of these primitives in the "batching" setting with a goal of practical deployment. We focus on three protocols: public key encryption, time-lock puzzles, and short non-interactive proofs. These protocols address different facets of security, ensuring the confidentiality of messages to unintended recipients and verifying the authenticity of computations. Suppose a user wants to broadcast an encrypted message to K recipients. With public-key encryption, the sender would construct K different ciphertexts, one for each recipient. The size of the broadcasted message then scales linearly with K. Broadcast encryption offers one solution to this problem where ciphertext size scales sublinearly with the number of recipients, but at the cost of introducing a central trusted party. Recently, several works have introduced notions like distributed broadcast encryption and flexible broadcast encryption, which combine the decentralized, trustless model of traditional public-key encryption with the efficiency guarantees of broadcast encryption. In this work, we introduce a generic compiler that takes any distributed broadcast encryption scheme and produces a flexible one. Time-lock puzzles allow a user to communicate a message that takes a recipient a large amount of sequential computation to unlock. When scaling these systems in practical use cases, it becomes crucial to be able to batch-solve puzzles, i.e., simultaneously open multiple puzzles. Ideally, we would want to batch solve while working to solve a single one. Unfortunately, all previously known TLP constructions that support batch solving rely on super-polynomially secure indistinguishability obfuscation, making them impractical. We present novel TLP constructions that offer batch-solving capabilities without using heavy cryptographic hammers. Furthermore, we introduce the concept of "rogue-puzzle attacks", where maliciously crafted puzzle instances may disrupt the batch-solving process of honest puzzles. We propose constructions of concrete and efficient TLPs designed to prevent such attacks. In a proof system, a prover convinces the verifier that some statement is true. We want certain properties such as zero-knowledge (where we require that the proof does not reveal anything more about the statement other than its truth) and succinctness (where proofs are short and can be verified quickly). In the batch setting, a prover convinces a verifier of multiple NP statements with communication that scales sublinearly in the number of instances. We give a direct construction of such a protocol that supports batching an unbounded number of statements from indistinguishability obfuscation and one-way functions. Additionally, we introduce and prove a new system property updatability, where a prover can take a proof on T statements and "update" it to obtain a proof on T+1 statements. Notably, the update procedure only requires knowledge of a (short) proof for T statements and does not require knowledge of witnesses for T+1 statements.Computer Science

Definition and evaluation of an onboard vehicle API concept

As the world witnesses an era of Software Defined Vehicle (SDV) and Internet of Things (IoT), the vehicles start becoming more intelligent, bringing in more software complexity than ever. This includes the Electrical/Electric (E/E) systems embedded inside today’s SDVs. The Electronic Control Unit (ECU) is now capable of running software which can not only communicate with other ECUs within the vehicle, but also to the outside world using protocols which are already in use within the Information Technology (IT) world for a long time. This lead to the emergence of an off-board vehicle Application Programming Interface (API) concept which allows external devices like smartphones or servers to access vehicle information such as those of sensors and other peripherals inside the vehicle. The Connected Vehicle Systems Alliance (COVESA) came up with an approach of defining a catalog for vehicle signals using the Vehicle Signal Specification (VSS) initiative. The World Wide Web Consortium (W3C) then brings this into use by defining Vehicle Information Service Specification (VISS). But the current VISS standard, namely version 2, defines transport bindings for WebSocket, Hypertext Transfer Protocol (HTTP) and Message Queuing Telemetry Transport (MQTT). These are well established protocols in the IT world and also suitable for off-board use cases. But if we want to use such an API concept inside the vehicle, so that the internal applications can also take advantage of a standardized catalog of signals and be reused between different vehicles, we need to consider protocols already in use inside vehicles as well. Scalable service-Oriented MiddlewarE over IP (SOME/IP) is one such example. Therefore, in this thesis, we elaborate the concept of a vehicle API, look at related technologies in more detail. Later, we take a look at one of the suitable candidates for an in-vehicle protocol, namely SOME/IP and see it’s respective trade-offs. Finally, we conceptualize and realize a Vehicle API concept for onboard usage

Hystera Ektomia: not always called for

Unsympathetic hysterectomies have seen a rising trend in India in the recent times, the unsuspecting folks being pushed into surgeries wrongly citing the austerity of the illness. We highlight a case of a 26 year old female patient with post-partum bleeding per vaginum for 6 months, who was initially treated conservatively at several hospitals. Later, histopathologically proven to be a case of Choriocarcinoma (WHO Stage I with FIGO prognostic score of 5), was hysterectomized hastily overlooking the reports and the patient discharged without further intervention. Few months later the patient presented with brain and lungs metastases. Had the patient been properly evaluated and treated appropriately initially, surgery was not indicated. Instead the patient was callously operated upon and histopathological report not followed which resulted in patient developing distant metastases (WHO Stage IV with FIGO prognostic score of 17). Unwarranted and unevaluated hysterectomies should be checked by appropriately evaluating the extent of the disease.

An Efficient Synchronous Checkpointing Protocol for Mobile Distributed Systems

Recent years have witnessed rapid development of mobile communications and become part of everyday life for most people. In order to transparently adding fault tolerance in mobile distributed systems, Minimum-process coordinated checkpointing is preferable but it may require blocking of processes, extra synchronization messages or taking some useless checkpoints. All-process checkpointing may lead to exceedingly high checkpointing overhead. In order to balance the checkpointing overhead and the loss of computation on recovery, we propose a hybrid checkpointing algorithm, wherein an all-process coordinated checkpoint is taken after the execution of minimum-process coordinated checkpointing algorithm for a fixed number of times. In the minimum-process coordinated checkpointing algorithm; an effort has been made to optimize the number of useless checkpoints and blocking of processes using probabilistic approach and by computing an interacting set of processes at beginning. We try to reduce the loss of checkpointing effort when any process fails to take its checkpoint in coordination with others. We reduce the size of checkpoint sequence number piggybacked on each computation messag

HFRAS : design of a high-density feature representation model for effective augmentation of satellite images

Efficiently extracting features from satellite images is crucial for classification and post-processing activities. Many feature representation models have been created for this purpose. However, most of them either increase computational complexity or decrease classification efficiency. The proposed model in this paper initially collects a set of available satellite images and represents them via a hybrid of long short-term memory (LSTM) and gated recurrent unit (GRU) features. These features are processed via an iterative genetic algorithm, identifying optimal augmentation methods for the extracted feature sets. To analyse the efficiency of this optimization process, we model an iterative fitness function that assists in incrementally improving the classification process. The fitness function uses an accuracy & precision-based feedback mechanism, which helps in tuning the hyperparameters of the proposed LSTM & GRU feature extraction process. The suggested model used 100 k images, 60% allocated for training and 20% each designated for validation and testing purposes. The proposed model can increase classification precision by 16.1% and accuracy by 17.1% compared to conventional augmentation strategies. The model also showcased incremental accuracy enhancements for an increasing number of training image sets.© The Author(s) 2023. This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.fi=vertaisarvioitu|en=peerReviewed

Time-Lock Puzzles with Efficient Batch Solving

Time-Lock Puzzles (TLPs) are a powerful tool for concealing messages until a predetermined point in time. When solving multiple puzzles, it becomes crucial to have the ability to batch-solve puzzles, i.e., simultaneously open multiple puzzles while working to solve a single one . Unfortunately, all previously known TLP constructions equipped for batch solving rely on super-polynomially secure indistinguishability obfuscation, making them impractical. In light of this challenge, we present novel TLP constructions that offer batch-solving capabilities without using heavy cryptographic hammers. Our proposed schemes are simple and concretely efficient, and they can be constructed based on well-established cryptographic assumptions based on pairings or learning with errors (LWE). Along the way, we introduce new constructions of puncturable key-homomorphic PRFs both in the lattice and in the pairing setting, which may be of independent interest. Our analysis leverages an interesting connection to Hall\u27s marriage theorem and incorporates an optimized combinatorial approach, enhancing the practicality and feasibility of our TLP schemes. Furthermore, we introduce the concept of rogue-puzzle attacks , where maliciously crafted puzzle instances may disrupt the batch-solving process of honest puzzles. We then propose constructions of concrete and efficient TLPs designed to prevent such attacks