3,121 research outputs found
Modular and composable extensions to smalltalk using composition filters
Current and future trends in computer science require extensions to Smalltalk. Rather than arguing for particular language mechanisms to deal with specific requirements, in this position paper we want to make a case for two requirements that Smalltalk extensions should fulfill. The first is that the extensions must be integrated with Smalltalk without violating its basic object model. The second requirement is that extensions should allow for defining objects that are still adaptable, extensible and reusable, and in particular do not cause inheritance anomalies. We propose the composition filters model as a framework for language extensions that fulfills these criteria. Its applicability to solving various modeling problems is briefly illustrated
HP-CERTI: Towards a high performance, high availability open source RTI for composable simulations (04F-SIW-014)
Composing simulations of complex systems from already existing simulation components remains a challenging issue. Motivations for composable simulation include generation of a given federation driven by operational requirements provided "on the fly". The High Level Architecture, initially developed for designing fully distributed simulations, can be considered as an interoperability standard for composing simulations from existing components. Requirements for constructing such complex simulations are quite different from those discussed for distributed simulations. Although interoperability and reusability remain essential, both high performance and availability have also to be considered to fulfill the requirements of the end user. ONERA is currently designing a High Performance / High Availability HLA Run-time Infrastructure from its open source implementation of HLA 1.3 specifications. HP-CERTI is a software package including two main components: the first one, SHM-CERTI, provides an optimized version of CERTI based on a shared memory communication scheme; the second one, Kerrighed-CERTI, allows the deployment of CERTI through the control of the Kerrighed Single System Image operating system for clusters, currently designed by IRISA. This paper describes the design of both high performance and availability Runtime Infrastructures, focusing on the architecture of SHM-CERTI. This work is carried out in the context of the COCA (High Performance Distributed Simulation and Models Reuse) Project, sponsored by the DGA/STTC (Délégation Générale pour l'Armement/Service des Stratégies Techniques et des Technologies Communes) of the French Ministry of Defense
A Framework for Efficient Adaptively Secure Composable Oblivious Transfer in the ROM
Oblivious Transfer (OT) is a fundamental cryptographic protocol that finds a
number of applications, in particular, as an essential building block for
two-party and multi-party computation. We construct a round-optimal (2 rounds)
universally composable (UC) protocol for oblivious transfer secure against
active adaptive adversaries from any OW-CPA secure public-key encryption scheme
with certain properties in the random oracle model (ROM). In terms of
computation, our protocol only requires the generation of a public/secret-key
pair, two encryption operations and one decryption operation, apart from a few
calls to the random oracle. In~terms of communication, our protocol only
requires the transfer of one public-key, two ciphertexts, and three binary
strings of roughly the same size as the message. Next, we show how to
instantiate our construction under the low noise LPN, McEliece, QC-MDPC, LWE,
and CDH assumptions. Our instantiations based on the low noise LPN, McEliece,
and QC-MDPC assumptions are the first UC-secure OT protocols based on coding
assumptions to achieve: 1) adaptive security, 2) optimal round complexity, 3)
low communication and computational complexities. Previous results in this
setting only achieved static security and used costly cut-and-choose
techniques.Our instantiation based on CDH achieves adaptive security at the
small cost of communicating only two more group elements as compared to the
gap-DH based Simplest OT protocol of Chou and Orlandi (Latincrypt 15), which
only achieves static security in the ROM
An Analysis of Composability and Composition Anomalies
The separation of concerns principle aims at decomposing a given design problem into concerns that are mapped to multiple independent software modules. The application of this principle eases the composition of the concerns and as such supports composability. Unfortunately, a clean separation (and composition of concerns) at the design level does not always imply the composability of the concerns at the implementation level. The composability might be reduced due to limitations of the implementation abstractions and composition mechanisms. The paper introduces the notion of composition anomaly to describe a general set of unexpected composition problems that arise when mapping design concerns to implementation concerns. To distinguish composition anomalies from other composition problems the requirements for composability at the design level is provided. The ideas are illustrated for a distributed newsgroup system
Random Numbers Certified by Bell's Theorem
Randomness is a fundamental feature in nature and a valuable resource for
applications ranging from cryptography and gambling to numerical simulation of
physical and biological systems. Random numbers, however, are difficult to
characterize mathematically, and their generation must rely on an unpredictable
physical process. Inaccuracies in the theoretical modelling of such processes
or failures of the devices, possibly due to adversarial attacks, limit the
reliability of random number generators in ways that are difficult to control
and detect. Here, inspired by earlier work on nonlocality based and device
independent quantum information processing, we show that the nonlocal
correlations of entangled quantum particles can be used to certify the presence
of genuine randomness. It is thereby possible to design of a new type of
cryptographically secure random number generator which does not require any
assumption on the internal working of the devices. This strong form of
randomness generation is impossible classically and possible in quantum systems
only if certified by a Bell inequality violation. We carry out a
proof-of-concept demonstration of this proposal in a system of two entangled
atoms separated by approximately 1 meter. The observed Bell inequality
violation, featuring near-perfect detection efficiency, guarantees that 42 new
random numbers are generated with 99% confidence. Our results lay the
groundwork for future device-independent quantum information experiments and
for addressing fundamental issues raised by the intrinsic randomness of quantum
theory.Comment: 10 pages, 3 figures, 16 page appendix. Version as close as possible
to the published version following the terms of the journa
Multi-objective Compositions for Collision-Free Connectivity Maintenance in Teams of Mobile Robots
Compositional barrier functions are proposed in this paper to systematically
compose multiple objectives for teams of mobile robots. The objectives are
first encoded as barrier functions, and then composed using AND and OR logical
operators. The advantage of this approach is that compositional barrier
functions can provably guarantee the simultaneous satisfaction of all composed
objectives. The compositional barrier functions are applied to the example of
ensuring collision avoidance and static/dynamical graph connectivity of teams
of mobile robots. The resulting composite safety and connectivity barrier
certificates are verified experimentally on a team of four mobile robots.Comment: To appear in 55th IEEE Conference on Decision and Control, December
12-14, 2016, Las Vegas, NV, US
Monitoring Networks through Multiparty Session Types
In large-scale distributed infrastructures, applications are realised through communications among distributed components. The need for methods for assuring safe interactions in such environments is recognized, however the existing frameworks, relying on centralised verification or restricted specification methods, have limited applicability. This paper proposes a new theory of monitored π-calculus with dynamic usage of multiparty session types (MPST), offering a rigorous foundation for safety assurance of distributed components which asynchronously communicate through multiparty sessions. Our theory establishes a framework for semantically precise decentralised run-time enforcement and provides reasoning principles over monitored distributed applications, which complement existing static analysis techniques. We introduce asynchrony through the means of explicit routers and global queues, and propose novel equivalences between networks, that capture the notion of interface equivalence, i.e. equating networks offering the same services to a user. We illustrate our static-dynamic analysis system with an ATM protocol as a running example and justify our theory with results: satisfaction equivalence, local/global safety and transparency, and session fidelity
- …