Pub Date : 2011-08-22DOI: 10.4018/jmcmc.2013070101
B. Groza, Pal-Stefan Murvay
We use one-time signatures to assure authenticity for messages that are broadcast over a Controller Area Network (CAN). The advantage is that we can use the simplest one-way functions which are computationally efficient while authentication does not depend on disclosure delays as in the case of protocols based on one-way chains and time synchronization. As the size of the one-time signatures is proportional to the bit length of the signed message, another benefit in using them is due to the reduced size of messages that are broadcast in CAN. To avoid the use of authentication trees, which will allow multiple uses of the one-time signature, but increases the size of signatures as well as memory requirements, we use an upper layer of key-chains with time synchronization in order to commit the public keys that can be further used for signing at any instant. The theoretical results are followed by experimental results on development boards equipped with Free scale S12, a commonly used automotive grade microcontroller. We also benefit from the acceleration offered by the XGATE coprocessor available on S12X derivatives which significantly increases computational performances. To further increase efficiency we also design and use a hardware random number generator which saves computational time that otherwise will be spent to derive fresh key material.
{"title":"Secure Broadcast with One-Time Signatures in Controller Area Networks","authors":"B. Groza, Pal-Stefan Murvay","doi":"10.4018/jmcmc.2013070101","DOIUrl":"https://doi.org/10.4018/jmcmc.2013070101","url":null,"abstract":"We use one-time signatures to assure authenticity for messages that are broadcast over a Controller Area Network (CAN). The advantage is that we can use the simplest one-way functions which are computationally efficient while authentication does not depend on disclosure delays as in the case of protocols based on one-way chains and time synchronization. As the size of the one-time signatures is proportional to the bit length of the signed message, another benefit in using them is due to the reduced size of messages that are broadcast in CAN. To avoid the use of authentication trees, which will allow multiple uses of the one-time signature, but increases the size of signatures as well as memory requirements, we use an upper layer of key-chains with time synchronization in order to commit the public keys that can be further used for signing at any instant. The theoretical results are followed by experimental results on development boards equipped with Free scale S12, a commonly used automotive grade microcontroller. We also benefit from the acceleration offered by the XGATE coprocessor available on S12X derivatives which significantly increases computational performances. To further increase efficiency we also design and use a hardware random number generator which saves computational time that otherwise will be spent to derive fresh key material.","PeriodicalId":254443,"journal":{"name":"2011 Sixth International Conference on Availability, Reliability and Security","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131454114","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Remote electronic voting continues to attract attention. A greater number of election officials are opting to enable a remote electronic voting channel. More and more scientific papers have been published introducing or improving existing remote electronic voting protocols. However, while the scientific papers focus on different aspects of verifiability, most of the systems in use do not provide verifiability. This gap is closed in this paper by extending a widely used remote electronic voting system, the POLYAS system, to provide verifiability. This approach has been tested in the 2010 election of the German Society for Computer Scientists and will be applied in future elections.
{"title":"Introducing Verifiability in the POLYAS Remote Electronic Voting System","authors":"M. Olembo, Patrick Schmidt, M. Volkamer","doi":"10.1109/ARES.2011.26","DOIUrl":"https://doi.org/10.1109/ARES.2011.26","url":null,"abstract":"Remote electronic voting continues to attract attention. A greater number of election officials are opting to enable a remote electronic voting channel. More and more scientific papers have been published introducing or improving existing remote electronic voting protocols. However, while the scientific papers focus on different aspects of verifiability, most of the systems in use do not provide verifiability. This gap is closed in this paper by extending a widely used remote electronic voting system, the POLYAS system, to provide verifiability. This approach has been tested in the 2010 election of the German Society for Computer Scientists and will be applied in future elections.","PeriodicalId":254443,"journal":{"name":"2011 Sixth International Conference on Availability, Reliability and Security","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116923127","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
J. C. Granda, Pelayo Nuño, D. García, F. J. Suárez
Synchronous e-training is emerging as an alternative for developing human resources training plans in large organizations. Real-time communications are used to emulate face-to-face interaction that occurs in on-campus learning environments. However, the security concerns that a synchronous e-training platform must face may compromise the integrity, availability and confidentiality of corporate information, which may lead to serious economic and legal consequences. The disclosure of corporate information or the unauthorized participation in e-training activities must be prevented. In this paper, the security issues in synchronous e-training are identified, and the threats to a real e-training platform are analyzed. The platform is organized into four virtual networks with different security requirements and vulnerabilities. The platform assumes that multicast communications are available in the underlying corporate network. The threats affecting each element of the platform and their impact on e-training activities are discussed. Finally, a security scheme is proposed fixing the aforementioned vulnerabilities. Digital certificates and encryption algorithms solve most of the vulnerabilities, but other techniques such as access control lists and user skills on security basics are essential. Most of the proposed scheme is applicable to other real-time communication systems, since the e-training platform is built using standard technologies commonly used in voice over IP systems.
{"title":"Security Issues in a Synchronous e-Training Platform","authors":"J. C. Granda, Pelayo Nuño, D. García, F. J. Suárez","doi":"10.1109/ARES.2011.75","DOIUrl":"https://doi.org/10.1109/ARES.2011.75","url":null,"abstract":"Synchronous e-training is emerging as an alternative for developing human resources training plans in large organizations. Real-time communications are used to emulate face-to-face interaction that occurs in on-campus learning environments. However, the security concerns that a synchronous e-training platform must face may compromise the integrity, availability and confidentiality of corporate information, which may lead to serious economic and legal consequences. The disclosure of corporate information or the unauthorized participation in e-training activities must be prevented. In this paper, the security issues in synchronous e-training are identified, and the threats to a real e-training platform are analyzed. The platform is organized into four virtual networks with different security requirements and vulnerabilities. The platform assumes that multicast communications are available in the underlying corporate network. The threats affecting each element of the platform and their impact on e-training activities are discussed. Finally, a security scheme is proposed fixing the aforementioned vulnerabilities. Digital certificates and encryption algorithms solve most of the vulnerabilities, but other techniques such as access control lists and user skills on security basics are essential. Most of the proposed scheme is applicable to other real-time communication systems, since the e-training platform is built using standard technologies commonly used in voice over IP systems.","PeriodicalId":254443,"journal":{"name":"2011 Sixth International Conference on Availability, Reliability and Security","volume":"185 5-6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114027184","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
M. Safkhani, N. Bagheri, M. Naderi, Yiyuan Luo, Qi Chai
Security concerns of RFID systems engaged a lot of researchers to design and to cryptanalyze RFID mutual authentication protocols. A suitable mutual authentication protocol for an RFID system should provide mutual authentication along with user privacy. In addition, such protocol must be resistant to active and passive attacks, e.g. man-in-the-middle attack, reply attack, reader-/tag-impersonation, denial of service and traceability attack. Among them, tag-impersonation refers to a process that the adversary’s tag fools the legitimate reader to authenticate it as a valid tag. In this paper we exam the security of two RFID mutual authentication protocols, i.e., [6] and [17], under tag impersonation attack. We found that these two protocols share a same vulnerability – in each session, the tag and the reader generates a random value respectively and they use the exclusiveor (XOR) of those random values in the authentication process. We exploit this vulnerability to present two effective and efficient tag impersonation attacks against these protocols, e.g., the success probabilities of our attacks are ”1” and the complexity is at most two runs of each protocol. At last, we exhibit the improved version of these protocols, which are immune from tag impersonation attacks.
{"title":"Tag Impersonation Attack on Two RFID Mutual Authentication Protocols","authors":"M. Safkhani, N. Bagheri, M. Naderi, Yiyuan Luo, Qi Chai","doi":"10.1109/ARES.2011.87","DOIUrl":"https://doi.org/10.1109/ARES.2011.87","url":null,"abstract":"Security concerns of RFID systems engaged a lot of researchers to design and to cryptanalyze RFID mutual authentication protocols. A suitable mutual authentication protocol for an RFID system should provide mutual authentication along with user privacy. In addition, such protocol must be resistant to active and passive attacks, e.g. man-in-the-middle attack, reply attack, reader-/tag-impersonation, denial of service and traceability attack. Among them, tag-impersonation refers to a process that the adversary’s tag fools the legitimate reader to authenticate it as a valid tag. In this paper we exam the security of two RFID mutual authentication protocols, i.e., [6] and [17], under tag impersonation attack. We found that these two protocols share a same vulnerability – in each session, the tag and the reader generates a random value respectively and they use the exclusiveor (XOR) of those random values in the authentication process. We exploit this vulnerability to present two effective and efficient tag impersonation attacks against these protocols, e.g., the success probabilities of our attacks are ”1” and the complexity is at most two runs of each protocol. At last, we exhibit the improved version of these protocols, which are immune from tag impersonation attacks.","PeriodicalId":254443,"journal":{"name":"2011 Sixth International Conference on Availability, Reliability and Security","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121689276","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Smart cards have been used in a wide variety of vertical markets delivering security services related to physical access control, user authentication and high value data transactions. However, their adoption in plug-n-play removable data storage markets is generally hindered by their dependence on external smart card reader hardware, their proprietary communication protocol that requires installation of card specific middle-ware, and their limited storage capacity. This is particularly true when using smart cards to store encrypted bulk data that meets the stringent security requirements of government agencies and enterprise IT departments. This paper outlines some of these requirements and presents a unique hardware and software architecture to address them. It combines the copious storage capacity of USB mass storage tokens with the proven security features of smart cards without requiring any smart card specific infrastructure. The resulting USB composite token can be used as a secure flexible platform to build advanced data protection applications.
{"title":"Seamless Fusion of Secure Software and Trusted USB Token for Protecting Enterprise & Government Data","authors":"Asad M. Ali","doi":"10.1109/ARES.2011.67","DOIUrl":"https://doi.org/10.1109/ARES.2011.67","url":null,"abstract":"Smart cards have been used in a wide variety of vertical markets delivering security services related to physical access control, user authentication and high value data transactions. However, their adoption in plug-n-play removable data storage markets is generally hindered by their dependence on external smart card reader hardware, their proprietary communication protocol that requires installation of card specific middle-ware, and their limited storage capacity. This is particularly true when using smart cards to store encrypted bulk data that meets the stringent security requirements of government agencies and enterprise IT departments. This paper outlines some of these requirements and presents a unique hardware and software architecture to address them. It combines the copious storage capacity of USB mass storage tokens with the proven security features of smart cards without requiring any smart card specific infrastructure. The resulting USB composite token can be used as a secure flexible platform to build advanced data protection applications.","PeriodicalId":254443,"journal":{"name":"2011 Sixth International Conference on Availability, Reliability and Security","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126176348","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Steganography is used to embed secret messages in cover media. This is especially important in areas where the use of cryptography is prohibited. In this paper we introduce a novel steganographic algorithm applicable for audio data as cover media. The proposed algorithm is based on the phase coding technique which embeds data in the phase spectrum of the frequency domain signal. Differing from previous works we retain the original phase values in order to best keep the quality of the cover audio signal. Secret bits are embedded by introducing a configurable phase difference between selected chunks of blocks from the cover medium instead of discarding the original phase values and introducing a random phase like other approaches. Variable parameters guarantee the security of our system and we show that the wrong selection leads to high reception errors. Also robustness tests were performed using popular signal processing operations like noise addition, cropping and resampling, giving reasonable results. In addition listening tests show that the original audio quality is not noticeable reduced by our algorithm. After pointing out related approaches we highlight our contributions with respect to the embedding and extraction processes. Also a view on the synchronization issue at reception is given. This is a vital part for the steganographic receiver when the communication happens for example over a mobile network. Following to that the results from tests with our working prototype are presented and further usage scenarios in relation to future research are given.
{"title":"A Novel Phase Coding Technique for Steganography in Auditive Media","authors":"M. Nutzinger, Jürgen Wurzer","doi":"10.1109/ARES.2011.22","DOIUrl":"https://doi.org/10.1109/ARES.2011.22","url":null,"abstract":"Steganography is used to embed secret messages in cover media. This is especially important in areas where the use of cryptography is prohibited. In this paper we introduce a novel steganographic algorithm applicable for audio data as cover media. The proposed algorithm is based on the phase coding technique which embeds data in the phase spectrum of the frequency domain signal. Differing from previous works we retain the original phase values in order to best keep the quality of the cover audio signal. Secret bits are embedded by introducing a configurable phase difference between selected chunks of blocks from the cover medium instead of discarding the original phase values and introducing a random phase like other approaches. Variable parameters guarantee the security of our system and we show that the wrong selection leads to high reception errors. Also robustness tests were performed using popular signal processing operations like noise addition, cropping and resampling, giving reasonable results. In addition listening tests show that the original audio quality is not noticeable reduced by our algorithm. After pointing out related approaches we highlight our contributions with respect to the embedding and extraction processes. Also a view on the synchronization issue at reception is given. This is a vital part for the steganographic receiver when the communication happens for example over a mobile network. Following to that the results from tests with our working prototype are presented and further usage scenarios in relation to future research are given.","PeriodicalId":254443,"journal":{"name":"2011 Sixth International Conference on Availability, Reliability and Security","volume":"358 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133200553","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Lyubimov, Dmitry V. Cheremushkin, N. Andreeva, Sergey Shustikov
This paper proposes a technique for the design and implementation of the information security management system (ISMS) for small and medium enterprises (SMEs). The technique is based on ISO 27001 standard ISMS requirements object model. The model was designed using methods and tools of the information security integral engineering (ISIE) framework, so the first part of the paper also briefly describes some features, components and engineering methods within the ISIE framework, which are important in practical applications but were presented insufficiently or were not presented at all in the previous papers. Along with the description of a general ISMS design and implementation method, the paper provides an example of the application of this method to design ISMS for city medium telecommunication SME. The paper also gives the evaluation of the technique's efficiency.
本文提出了一种面向中小企业的信息安全管理系统(ISMS)的设计与实现技术。该技术基于ISO 27001标准ISMS需求对象模型。模型的设计使用了信息安全集成工程(information security integral engineering, ISIE)框架的方法和工具，因此本文的第一部分还简要描述了在实际应用中很重要的一些特征、组件和工程方法，这些在以往的文章中都没有得到充分的介绍或根本没有介绍。在介绍了一种通用的信息管理系统设计与实现方法的基础上，给出了应用该方法设计城市中小电信企业信息管理系统的实例。并对该技术的有效性进行了评价。
{"title":"Information Security Integral Engineering Technique and its Application in ISMS Design","authors":"A. Lyubimov, Dmitry V. Cheremushkin, N. Andreeva, Sergey Shustikov","doi":"10.1109/ARES.2011.121","DOIUrl":"https://doi.org/10.1109/ARES.2011.121","url":null,"abstract":"This paper proposes a technique for the design and implementation of the information security management system (ISMS) for small and medium enterprises (SMEs). The technique is based on ISO 27001 standard ISMS requirements object model. The model was designed using methods and tools of the information security integral engineering (ISIE) framework, so the first part of the paper also briefly describes some features, components and engineering methods within the ISIE framework, which are important in practical applications but were presented insufficiently or were not presented at all in the previous papers. Along with the description of a general ISMS design and implementation method, the paper provides an example of the application of this method to design ISMS for city medium telecommunication SME. The paper also gives the evaluation of the technique's efficiency.","PeriodicalId":254443,"journal":{"name":"2011 Sixth International Conference on Availability, Reliability and Security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131337352","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
With the continuously developing technology and growing complexity of software and systems, new demands and challenges appear for security, calling for new techniques and methods in addition to the already existing ones. The variety of initiatives and the variations in the characterizations makes it hard for users to select the most appropriate one for their needs. We propose a set of uniform characterizing dimensions with sub-categories for security requirements initiatives. The set is derived by analyzing classifications and comparison frameworks from review papers on modelling techniques for security requirements engineering. The dimensions can be used to guide context-dependent choices of initiatives and further research of their combination and integration.
{"title":"Characterising and Analysing Security Requirements Modelling Initiatives","authors":"P. Kárpáti, G. Sindre, A. Opdahl","doi":"10.1109/ARES.2011.113","DOIUrl":"https://doi.org/10.1109/ARES.2011.113","url":null,"abstract":"With the continuously developing technology and growing complexity of software and systems, new demands and challenges appear for security, calling for new techniques and methods in addition to the already existing ones. The variety of initiatives and the variations in the characterizations makes it hard for users to select the most appropriate one for their needs. We propose a set of uniform characterizing dimensions with sub-categories for security requirements initiatives. The set is derived by analyzing classifications and comparison frameworks from review papers on modelling techniques for security requirements engineering. The dimensions can be used to guide context-dependent choices of initiatives and further research of their combination and integration.","PeriodicalId":254443,"journal":{"name":"2011 Sixth International Conference on Availability, Reliability and Security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116346972","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The emergence of e-health has put an enormous amount of sensitive data in the hands of service providers or other third parties, where privacy risks might exist when accessing sensitive data stored in electronic patient records (EPRs). EPRs support efficient access to patient data by multiple healthcare providers and third party users, which will consequently, improve patient care. However, the sensitive nature of patient data requires access restrictions to only those `who needs to know'. How to achieve this without compromising patient privacy remains an open issue that needs further consideration. This paper, therefore, presents a novel method to support access to distributed EPRs with three levels of patient identity privacy preservation. The method makes use of cryptographic primitives. In comparison with related work, the method supports three levels of access requirements while preserving data owner's privacy on a single platform.
{"title":"Support Access to Distributed EPRs with Three Levels of Identity Privacy Preservation","authors":"Rima Addas, Ning Zhang","doi":"10.1109/ARES.2011.16","DOIUrl":"https://doi.org/10.1109/ARES.2011.16","url":null,"abstract":"The emergence of e-health has put an enormous amount of sensitive data in the hands of service providers or other third parties, where privacy risks might exist when accessing sensitive data stored in electronic patient records (EPRs). EPRs support efficient access to patient data by multiple healthcare providers and third party users, which will consequently, improve patient care. However, the sensitive nature of patient data requires access restrictions to only those `who needs to know'. How to achieve this without compromising patient privacy remains an open issue that needs further consideration. This paper, therefore, presents a novel method to support access to distributed EPRs with three levels of patient identity privacy preservation. The method makes use of cryptographic primitives. In comparison with related work, the method supports three levels of access requirements while preserving data owner's privacy on a single platform.","PeriodicalId":254443,"journal":{"name":"2011 Sixth International Conference on Availability, Reliability and Security","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122417911","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Grammars are used to describe sentences structure, thanks to some sets of rules, which depends on the grammar type. A classification of grammars has been made by Noam Chomsky, which led to four well-known types. Yet, there are other types of grammars, which do not exactly fit in Chomsky's classification, such as the two-level grammars. As their name suggests it, the main idea behind these grammars is that they are composed of two grammars. Van Wijngaarden grammars, particularly, are such grammars. They are interesting by their power (expressiveness), which can be the same, under some hypotheses, as the most powerful grammars of Chomsky's classification, i.e. Type 0 grammars. Another point of interest is their relative conciseness and readability. Van Wijngaarden grammars can describe static and dynamic semantic of a language. So, by using them as a generative engine, it is possible to generate a possibly infinite set of words, while assuring us that they all have the same semantic.
{"title":"Van Wijngaarden Grammars and Metamorphism","authors":"Gueguen Geoffroy","doi":"10.1109/ARES.2011.72","DOIUrl":"https://doi.org/10.1109/ARES.2011.72","url":null,"abstract":"Grammars are used to describe sentences structure, thanks to some sets of rules, which depends on the grammar type. A classification of grammars has been made by Noam Chomsky, which led to four well-known types. Yet, there are other types of grammars, which do not exactly fit in Chomsky's classification, such as the two-level grammars. As their name suggests it, the main idea behind these grammars is that they are composed of two grammars. Van Wijngaarden grammars, particularly, are such grammars. They are interesting by their power (expressiveness), which can be the same, under some hypotheses, as the most powerful grammars of Chomsky's classification, i.e. Type 0 grammars. Another point of interest is their relative conciseness and readability. Van Wijngaarden grammars can describe static and dynamic semantic of a language. So, by using them as a generative engine, it is possible to generate a possibly infinite set of words, while assuring us that they all have the same semantic.","PeriodicalId":254443,"journal":{"name":"2011 Sixth International Conference on Availability, Reliability and Security","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122972675","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：