发布求助
文献互助 智能选刊 最新文献

Proceedings of ICNP - 1994 International Conference on Network Protocols最新文献

筛选
英文 中文
Design, verification and implementation of an authentication protocol 认证协议的设计、验证和实现
Proceedings of ICNP - 1994 International Conference on Network Protocols Pub Date : 1994-10-25 DOI: 10.1109/ICNP.1994.344373
Thomas Y. C. Woo, S. Lam
{"title":"Design, verification and implementation of an authentication protocol","authors":"Thomas Y. C. Woo, S. Lam","doi":"10.1109/ICNP.1994.344373","DOIUrl":"https://doi.org/10.1109/ICNP.1994.344373","url":null,"abstract":"We present an account of the entire development cycle (i.e., design, specification and verification, and implementation) of a realistic authentication protocol, which is part of a security architecture proposed by us. The protocol's design follows a stepwise refinement process, which we illustrate. Our account of its specification and verification provides a practical demonstration of a proposed formal analysis approach. For its implementation, we adopt the GSS-API standard. We describe the mapping from our protocol to GSS-API, which can serve as a reference for other protocol implementations. We believe that the global perspective presented in this paper would be of great value to protocol designers, verifiers, and implementers, and contribute toward bridging the gap between the theory and practice of authentication protocol design.<<ETX>>","PeriodicalId":275870,"journal":{"name":"Proceedings of ICNP - 1994 International Conference on Network Protocols","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129705321","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}
引用次数: 9
The ID-based non-interactive group communication key sharing scheme using smart cards 基于智能卡的非交互式组通信密钥共享方案
Proceedings of ICNP - 1994 International Conference on Network Protocols Pub Date : 1994-10-25 DOI: 10.1109/ICNP.1994.344372
Hiroyuki Sakakibara, Kazunori Seki, Ken-ichi Okada, Y. Matsushita
{"title":"The ID-based non-interactive group communication key sharing scheme using smart cards","authors":"Hiroyuki Sakakibara, Kazunori Seki, Ken-ichi Okada, Y. Matsushita","doi":"10.1109/ICNP.1994.344372","DOIUrl":"https://doi.org/10.1109/ICNP.1994.344372","url":null,"abstract":"Attention to CSCW has been increasing, resulting in greater needs for secure group communication. In order to realize secure group communication, data which is sent from a member to other members of a group should be encrypted by the cryptographic communication key of the group. We propose an identity-based non-interactive group communication key sharing scheme using smart cards based on the modified copy key (MCK) method. We assume that the smart cards contain the key generators and are secure for tampering. Each user has a smart card and a key generator. A user can generate a group communication key non-interactively with his key generator and the IDs of the other group members using his smart card.<<ETX>>","PeriodicalId":275870,"journal":{"name":"Proceedings of ICNP - 1994 International Conference on Network Protocols","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132681617","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}
引用次数: 6
On the construction of multiphase communication protocols 多相通信协议的构建
Proceedings of ICNP - 1994 International Conference on Network Protocols Pub Date : 1994-10-25 DOI: 10.1109/ICNP.1994.344365
Gurdip Singh, Madhavi Sammeta
{"title":"On the construction of multiphase communication protocols","authors":"Gurdip Singh, Madhavi Sammeta","doi":"10.1109/ICNP.1994.344365","DOIUrl":"https://doi.org/10.1109/ICNP.1994.344365","url":null,"abstract":"The complexity of communication protocols has led to compositional techniques to design and verify protocols. We propose a framework for sequential composition of protocols. We identify two types of interactions, ordering and inhibition, required to specify such compositions. By describing these interactions separately, our framework enhances the applicability to the technique to a larger class of protocols. The technique facilitates modular design and verification. We illustrate the use of our technique by deriving several protocols.<<ETX>>","PeriodicalId":275870,"journal":{"name":"Proceedings of ICNP - 1994 International Conference on Network Protocols","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115491327","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}
引用次数: 14
Generalized fair reachability analysis for cyclic protocols: decidability for logical correctness problems 循环协议的广义公平可达性分析:逻辑正确性问题的可判定性
Proceedings of ICNP - 1994 International Conference on Network Protocols Pub Date : 1994-10-25 DOI: 10.1109/ICNP.1994.344371
Hong Liu, Raymond E. Miller
{"title":"Generalized fair reachability analysis for cyclic protocols: decidability for logical correctness problems","authors":"Hong Liu, Raymond E. Miller","doi":"10.1109/ICNP.1994.344371","DOIUrl":"https://doi.org/10.1109/ICNP.1994.344371","url":null,"abstract":"In a previous paper, we generalized the fair reachability notion to cyclic protocols with n/spl ges/2 machines and showed that deadlock detection is decidable for /spl Pscr/, the class of cyclic protocols whose fair reachable state spaces are finite. In this paper, we show that detection of unspecified receptions, unboundedness, and nonexecutable transitions are all decidable for class /spl Pscr/ via finite extension of the fair reachable state space. This study shows that for the class /spl Pscr/, our generalized fair reachability analysis technique not only achieves substantial state reduction but also maintains very competitive logical error coverage. Therefore, it is a viable state reduction technique.<<ETX>>","PeriodicalId":275870,"journal":{"name":"Proceedings of ICNP - 1994 International Conference on Network Protocols","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116282404","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}
引用次数: 9
Single-link and time communicating finite state machines 单链路和时间通信有限状态机
Proceedings of ICNP - 1994 International Conference on Network Protocols Pub Date : 1994-10-25 DOI: 10.1109/ICNP.1994.344368
W. Peng
{"title":"Single-link and time communicating finite state machines","authors":"W. Peng","doi":"10.1109/ICNP.1994.344368","DOIUrl":"https://doi.org/10.1109/ICNP.1994.344368","url":null,"abstract":"We propose two variants of the classical communicating finite state machines (CFSMs) model, single-link communicating finite state machines (SLCFSMs) and time communicating finite state machines (TCFSMs). For SLCFSMs the notion of well-formedness, which provides a necessary condition for SLCFSMs to be free of some logical errors, is proposed. For TCFSMs, it is argued that they are more suitable for modeling delay-sensitive distributed algorithms/communication protocols. Two practical communication protocols, a token ring and a sliding window protocol, are modeled using TCFSMs.<<ETX>>","PeriodicalId":275870,"journal":{"name":"Proceedings of ICNP - 1994 International Conference on Network Protocols","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126311223","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}
引用次数: 10
Automatic retransmission rather than automatic repeat request 自动重传而不是自动重复请求
Proceedings of ICNP - 1994 International Conference on Network Protocols Pub Date : 1994-10-25 DOI: 10.1109/ICNP.1994.344377
A. Al-Zoman, J. DeDourek, B. Kurz
{"title":"Automatic retransmission rather than automatic repeat request","authors":"A. Al-Zoman, J. DeDourek, B. Kurz","doi":"10.1109/ICNP.1994.344377","DOIUrl":"https://doi.org/10.1109/ICNP.1994.344377","url":null,"abstract":"The standard HDLC family of protocols has been designed for low to moderate BERs. But as BER increases frequent losses or corruptions of certain frames will cause extensive timeout recovery. Too many timeouts means low throughput. A new retransmission scheme is presented which depends on the transmitter to automatically initiate retransmission instead of the conventional way where the receiver automatically requests retransmission. The retransmission strategy is based on two ideas: the receiver can report without any restriction its buffer status by using a multiple acknowledgement frame and the transmitter keeps a record of the transmission order in which frames were sent. This new approach significantly reduces the use of timeout recoveries, and hence it gives a higher throughput efficiency than the standard and extended HDLC protocols.<<ETX>>","PeriodicalId":275870,"journal":{"name":"Proceedings of ICNP - 1994 International Conference on Network Protocols","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125945625","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}
引用次数: 5
An iterative approach to comprehensive performance evaluation of integrated services networks 综合业务网络综合性能评价的迭代方法
Proceedings of ICNP - 1994 International Conference on Network Protocols Pub Date : 1994-03-01 DOI: 10.1109/ICNP.1994.344378
I. Matta, A. Shankar
{"title":"An iterative approach to comprehensive performance evaluation of integrated services networks","authors":"I. Matta, A. Shankar","doi":"10.1109/ICNP.1994.344378","DOIUrl":"https://doi.org/10.1109/ICNP.1994.344378","url":null,"abstract":"Future networks are expected to integrate diverse services. For this purpose, new algorithms and protocols have been proposed for link scheduling, admission control, and routing. The interaction between these three components is crucial to the performance of the network. However, this interaction is difficult to model realistically using available techniques. We present an iterative discrete-time approach that yields a realistic model which takes into account this interaction. The model applies to connection-oriented networks with different types of real-time connections. It allows the investigation of various control schemes for both transient and steady-state performances. Preliminary results indicate that our approach is computationally much cheaper than discrete-event simulation, and yields sufficiently accurate performance measures.<<ETX>>","PeriodicalId":275870,"journal":{"name":"Proceedings of ICNP - 1994 International Conference on Network Protocols","volume":"182 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123819448","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}
引用次数: 5
Stutter XOR strategies: a new class of multicopy ARQ strategies 口吃异或策略:一类新的多拷贝ARQ策略
Proceedings of ICNP - 1994 International Conference on Network Protocols Pub Date : 1900-01-01 DOI: 10.1109/ICNP.1994.344376
M. Aghadavoodi Jolfaei
{"title":"Stutter XOR strategies: a new class of multicopy ARQ strategies","authors":"M. Aghadavoodi Jolfaei","doi":"10.1109/ICNP.1994.344376","DOIUrl":"https://doi.org/10.1109/ICNP.1994.344376","url":null,"abstract":"On systems consisting of packet switched networks (e.g. LANs, HSLANs and ATM/BISDN) which are linked over satellite, there are packet losses due to buffer overflow at bridges and routers as well as bit errors on the satellite link. The resulting high error probability requires error correction methods, which are simple and effective in terms of throughput and memory requirements. For packet switched communications, quite a number of ARQ (automatic repeat request) protocols have been designed which are able to cope with stringent memory requirements, but they either lack safety at high block error rates, or they require a large bandwidth due to low throughput. We introduce a simple and effective strategy (called Stutter-XOR or SXOR strategy) to increase throughput of existing protocols. In contrast to existing hybrid schemes (combinations of ARQ and forward error correction), it does not only correct bit errors, but also handles block losses. This is achieved by sending additional blocks, so called XOR blocks, which are created by combining other block using the XOR (modulo 2 addition) operation. We developed several variants of this strategy. Two of them are evaluated by means of analysis and simulation.<<ETX>>","PeriodicalId":275870,"journal":{"name":"Proceedings of ICNP - 1994 International Conference on Network Protocols","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123487006","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}
引用次数: 3
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信