In Journal of Mathematical Cryptology
here are many group-based cryptosystems in which the security is related to the conjugacy search problem or the simultaneous conjugacy search problem in their underlying platform groups. In this article, we show that some metabelian groups do not provide strong security for these cryptosystems and so they cannot be chosen as platform groups..
In Journal of Mathematical Cryptology
Bidoux and Gaborit introduced a new general technique to improve zero-knowledge (ZK) proof-of-knowledge (PoK) schemes for a large set of well-known post-quantum hard computational problems such as the syndrome decoding, the permuted kernel, the rank syndrome decoding, and the multivariate quadratic (MQ) problems. In particular, the authors’ idea in the study of Bidoux and Gaborit was to use the structure of these problems in the multi-instance setting to minimize the communication complexity of the resulting ZK PoK schemes. The security of the new schemes is then related to new hard problems. In this article, we focus on the new multivariate-based ZKPoK and the corresponding new underlying problem: the so-called DiffMQ.
In 39th international conference on advanced information networking and applications (AINA-2025)
Pervasive systems demand flexible, efficient resource management policies to handle heterogeneous infrastructures and varying application needs. This paper introduces an extended formalism that overcomes limitations in previous approaches by distinctly separating static properties from dynamic context elements, allowing more precise policy definitions. Mandatory and optional policies are explicitly categorized, enabling fail-fast decisions when critical conditions fail, while also supporting opportunistic executions. These design choices reduce evaluation costs—often down to O(1) in the best case—and permit large-scale environments to benefit from parallel evaluations. Practical simulations demonstrate superior performance in collaborative, multi-organization scenarios, highlighting improved adaptability, reduced overhead, and effective integration of organizational knowledge within the resource management process.
In 39th international conference on advanced information networking and applications (AINA-2025)
As reliance on OS-level virtualization tools grows, understanding their efficiency in container management tasks is essential for optimizing performance. This study presents a comprehensive performance analysis of Docker, Podman, and LXD across key container management tasks: loading, starting, stopping, and removing containers and images. Our results indicate Docker’s consistent superiority in speed, achieving the fastest execution times across tasks but at the cost of higher CPU usage. Podman demonstrates balanced resource efficiency, though generally slower than Docker in image loading. LXD, while slower in starting containers, exhibits lower CPU usage in parallel operations, making it suitable for scenarios where resource efficiency is prioritized over speed. These findings underscore the impact of tool choice on containerized environment performance, highlighting the importance of selecting a tool based on specific deployment requirements.
In Proceedings of the international conference on acoustics, speech, and signal processing
In histopathology, intelligent diagnosis of Whole Slide Images (WSIs) is essential for automating and objectifying diagnoses, reducing the workload of pathologists. However, diagnostic models often face the challenge of forgetting previously learned data during incremental training on datasets from different sources. To address this issue, we propose a new framework PaGMIL to mitigate catastrophic forgetting in breast cancer WSI classification. Our framework introduces two key components into the common MIL model architecture. First, it leverages microscopic pathological prior to select more accurate and diverse representative patches for MIL. Secondly, it trains separate classification heads for each task and uses macroscopic pathological prior knowledge, treating the thumbnail as a prompt guide (PG) to select the appropriate classification head. We evaluate the continual learning performance of PaGMIL across several public breast cancer datasets. PaGMIL achieves a better balance between the performance of the current task and the retention of previous tasks, outperforming other continual learning methods. Our code will be open-sourced upon acceptance.
In 39th international conference on advanced information networking and applications (AINA-2025)
The rapid technological advancements and growing demand for innovative healthcare solutions highlight the critical role of integrating the Internet of Things (IoT) with mobile health (mHealth) services. This study evaluates the performance of an IoT platform within an mHealth context, focusing on the MQTT protocol’s effectiveness for healthcare data communication. Using an Orange Pi Win Plus board as the IoT platform, we simulated real-world mHealth conditions with varying workloads to assess platform resilience and scalability. Representative test scenarios were developed to simulate normal, increasing, and extreme load conditions, measuring key metrics such as CPU usage, memory consumption, throughput, and latency. Data were collected and analyzed using custom scripts to evaluate the platform’s response across different Quality of Service (QoS) levels. Results indicated that the platform could effectively manage standard and moderately high demands, while performance under extreme loads highlighted areas for optimization. This study concludes that the MQTT-based IoT platform demonstrated reliable performance in the mHealth environment, providing a basis for future optimizations and scalability improvements.
In 39th international conference on advanced information networking and applications (AINA-2025)
Serverless computing has gained widespread adoption due to its simplified management and lightweight design, particularly when paired with container orchestration systems like Kubernetes. By enabling developers to focus on application logic without managing underlying infrastructure, serverless computing offers advantages such as runtime-based billing in millisecond units, reducing operational costs and appealing to enterprises. This study evaluates resource utilization across 24 combinations of Ubuntu and Debian operating systems with Docker and Podman container platforms under varied workloads. Results indicate that Ubuntu with Docker achieves superior efficiency in CPU and RAM usage compared to other configurations. This experimental analysis provides practical insights into hardware resource management for serverless deployments and highlights opportunities for improving infrastructure in diverse scenarios.
In Proceedings of 27th international symposium on practical aspects of declarative language (PADL’25)
Heterogeneously typed sequences are supported in a wide range of programming languages, both dynamically and statically typed. These sequences often exhibit type patterns such as repetition, alternation, and optionality. The programmer needs a mechanism to declare and query adherence to this regularity. The theory of finite automata over finite alphabets was conceived for characterizing patterns in so-called regular languages, but does not exactly meet this challenge, because the set of potential elements of the sequences is infinite. In this article, we present a generalization of regular expressions called rational type expressions as a means of declaring regular patterns in heterogeneous sequences. We present procedures for constructing and manipulating symbolic finite automata, a generalization of classical finite automata, using a portable, simple, embeddable, type system. For type systems with subtyping, the subtype relation and type vacuity cannot always be computed programmatically. We provide a working, sound solution for constructing finite automata for type-based regular expressions even in cases where the subtype decidability relations is not computable retrospectively, but can be ensured by construction. We demonstrate the generality and portability of the system by providing implementations in Common Lisp, Clojure, Scala, and Python.
In Formal Aspects of Computing
We show how to efficiently solve problems involving a quantitative measure, here called energy, as well as a qualitative acceptance condition, expressed as a Büchi or Parity objective, in finite weighted automata and in one-clock weighted timed automata. Solving the former problem and extracting the corresponding witness is our main contribution and is handled by a modified version of the Bellman-Ford algorithm interleaved with Couvreur’s algorithm. The latter problem is handled via a reduction to the former relying on the corner-point abstraction. All our algorithms are freely available and implemented in a tool based on the open-source platforms TChecker and Spot.
Copyright (c) 2022, LRE; all rights reserved.
Template by Bootstrapious. Ported to Hugo by DevCows.
