With the rapid proliferation of various cloud storage services in recent years, the development of technology to efficiently search data while ensuring its confidentiality during cloud usage is an important issue. The technology that enables keyword searches on encrypted files using previously set keywords is called searchable symmetric encryption (SSE). In this paper, we propose a method formally representing encrypted document, and verify the security of SSE using the formal verification tool ProVerif. Our proposed method considers the channel-type terms of ProVerif as a Document that includes different keywords to verify the indistinguishability of encrypted documents.

Symbolic verification tools such as ProVerif can analyze the security of cryptographic protocols automatically. However, if the formal definitions of cryptologic functionalities are incomplete, then the results will be incorrect. Unfortunately, there has so far been no way to analyze the symbolically behavior of such functionalities in the formalization. Furthermore, we have not been able to describe attacker models using such tools. In this paper, we propose a method of defining cryptologic functionalities that uses ProVerif to verify their cryptographic requirements. In addition, by using symbolic verifiers, the proposed method makes it possible to verify cryptographically meaningful security requirements. We therefore expect that this method will contribute to formally defining advanced cryptologic functionalities and accurately verifying the security of cryptographic protocols involving such functionalities.

In this paper, we introduce our formalization of the definitions and theorems related to an elliptic curve over a finite prime field. The elliptic curve is important in an elliptic curve cryptosystem whose security is based on the computational complexity of the elliptic curve discrete logarithm problem.

The proliferation of all kinds of devices with different security requirements and constraints, and the arms-race nature of the security problem are increasingly demanding the development of tools to help on the automatic design of Boolean functions with security application. Nowadays, the design of strong cryptographic Boolean functions is a multiobjective problem. However, so far evolutionary multiobjective algorithms have been largely overlooked and not much is known about this problem from a multiobjective optimization perspective. In this work we focus on non-linearity related criteria and explore a multiobjective evolutionary approach aiming to find several balanced functions of similar characteristics satisfying multiple criteria. We show that the multiobjective approach is an efficient alternative to single objective optimization approaches presented so far. We also argue that it is a better framework for automatic design of cryptographic Boolean functions.

This paper describes a design approach and its implementation for a broadband access management system that provides element and network management functions for FTTC (fiber-to-the-curb)/FTTB (fiber-to-the-building) access networks, and service management functions for video on demand (VOD) services. The proposed architecture is a top-down approach, and consists of four levels of basic architecture, namely, service/functional architecture, system architecture, network architecture and software architecture. By the proposed architecture, TMN compliant layered management functions are realized for the broadband access system at EML (element management layer), NML (network management layer) and SML (service management layer). By considering multi-vendor environments, the proposed management systems communicate each other via OSI protocols. Three different configurations are evaluated for EML agents, and the distributed or hybrid EML agent approaches are cost effective solutions based on current technologies. Finally, this paper shows a prototype system based on the proposed architecture.