Информационная безопасность. История защиты информации в зарубежных странах
The direction of cloud computing protection development is considered in the article. It is suggested to consider the structure of a queuing system based on processing data centers (PDC), as the combination of six components: the hardware PDC element; telecommunication PDC resources access element; users and the software associated to them; the «middle» PDC layer, providing calculating virtualization and including control system; application services, provided by PDC as the layer of application software for guest operating systems; data storage systems, especially databases. The ways of data protection in every subsystem, the directions of necessary development and the possibility of different security levels provision are discussed in the article. According to the author, the most complicated objective is to certify access control system in modern database systems like Oracle and DB-2.
The volume contains proceedings of the XIII International symposium on problems of redundancy in information and control systems.
The volume is to contain the proceedings of the 13th conference AGCT as well as the proceedings of the conference Geocrypt. The conferences focus on various aspects of arithmetic and algebraic geometry, number theory, coding theory and cryptography. The main topics discussed at conferences include the theory of curves over finite fields, theory of abelian varieties both over global and finite fields, theory of zeta-functions and L-functions, asymptotic problems in number theory and algebraic geometry, algorithmic aspects of the theory of curves and abelian varieties, the theory of error-correcting coding and particularly that of algebro-geometric codes, cryptographic issues related to algebraic curves and abelian varieties.
We study the problem of restricting the rights and freedoms in order to ensure information security. The limitations and problems associated with them relations of public and private interests considered as a system consisting of a set of elements such as objects, subjects of information security and the activities of these entities to ensure information security.
In this paper the authors propose a new approach to teaching practical information security in higher school based on case studies. They justify its place in information security curriculum by providing an example from the experience of using the approach for BSc and MSc students of Higher School of Economics in the courses on «Technical and Organizational Aspects of Information Security and Information Security Technologies». This paper fills the gap in existing practices for teaching information security which currently lack in guidelines for designing case studies and integrating them into the curriculum.
Recent work on structure-preserving signatures studies optimality of these schemes in terms of the number of group elements needed in the verification key and the signature, and the number of pairing-product equations in the verification algorithm. While the size of keys and signatures is crucial for many applications, another important aspect to consider for performance is the time it takes to verify a given signature. By far, the most expensive operation during verification is the computation of pairings. However, the concrete number of pairings that one needs to compute is not captured by the number of pairing-product equations considered in earlier work. To fill this gap, we consider the question of what is the minimal number of pairings that one needs to compute in the verification of structure-preserving signatures. First, we prove lower bounds for schemes in the Type II setting that are secure under chosen message attacks in the generic group model, and we show that three pairings are necessary and that at most one of these pairings can be precomputed. We also extend our lower bound proof to schemes secure under random message attacks and show that in this case two pairings are still necessary. Second, we build an automated tool to search for schemes matching our lower bounds. The tool can generate automatically and exhaustively all valid structure-preserving signatures within a user-specified search space, and analyze their (bounded) security in the generic group model. Interestingly, using this tool, we find a new randomizable structure-preserving signature scheme in the Type II setting that is optimal with respect to the lower bound on the number of pairings, and also minimal with respect to the number of group operations that have to be computed during verification.
The attitude of the main British political parties and groups to the problem of changes of the prerogatives and powers of the House of Lords during the introduction and discussion of the supreme legislative body of the Bill of Parliament of 1911 is discussed. The process of complicated co-ordinations, concessions and compromises during the discussions period on the text of the Bill is being examined. The Act of Parliament of 1911 characteristics and the reasons of the need for further reform of the House of Lords are given.