解决电子不停车收费系统干扰问题的信息融合方法

针对传统方法对于电子不停车收费(ETC)跟车干扰与邻道干扰的解决效率低、成本高,并且分别处理的问题,提出一种基于信息融合的统一解决ETC干扰问题的方法。该方法以系统获得的车辆信息为已知信息,用车辆图像对应的图形特征对其进行验证,再通过D-S证据理论融合验证结果,判断待交易车辆是否为当前车辆。同时,改进了D-S证据使其在验证结果冲突时依然有效。实验结果表明,该方法能可靠地检查出非法车辆,对同时解决跟车干扰与邻道干扰切实有效。     

ETC电子不停车收费的技术研究

在国内首次提出并实现了一种基于多技术融合、分布式处理的ETC电子不停车收费系统。系统采用射频识别、模式识别、数据安全与加密、信息融合、计算机网络等多种技术的融合,采用分布式处理的方式最大限度地保证了系统的实时性、可靠性和安全性。系统依据中国国情,对所运用的各项技术进行了深入的研究,并通过在河南濮阳的实地试验验证了所采用技术的有效性。     

Modeling traffic operations at electronic toll collection and traffic management systems

Automatic Vehicle Identification (AVI) technology is one possible solution to traffic congestion at existing transportation facilities. This paper presents a mathematical model of traffic conditions for toll plaza facilities that includes AVI toll collection services among other conventional services.

Three types of services are available: manual toll service, in which transactions are handled by a toll collector, automatic toll service, in which coin machines are utilized, and AVI toll collection service. In addition, mixed lanes, which provide more than one of the above services, are considered by the model.

For a given rush hour, queue lengths and delays can be calculated for different toll plaza configurations. Comparison of their performance may aid operators in the management of the lane configurations until all users of the facility become AVI patrons.     

Selection of optimal electronic toll collection system for India: A subjective-fuzzy decision making approach

Present study deals with the adoption of newer technologies for developing nations. Most of the developing countries due to lack of resources perform techno-socio-economic analyses on the already existing models of the developed ones. Such adopted technologies may not perform effectively because of unlike socio-economic factors. Hence, it becomes important to select new technologies based on appropriate and suitable criteria with respect to a particular country. In this paper, we have demonstrated selection of optimal electronic toll collection (ETC) system for India. In this context, we have considered thirteen crucial parameters for selection of appropriate ETC system. Cost is found to be the pivotal selection criterion in India. Further, fuzzy logic based MADM (multiple attribute decision making) approach is employed for selection of optimal ETC system for India. RFID-based (radio frequency identification) ETC is found to be the most suitable alternative among all considered ETC technologies. Our results are in strong agreement with the report of apex committee, appointed by “Government of India (Ministry of Road Transport & Highways)” for implementation of ETC in India.     

高速公路不停车收费系统的网络安全监控系统总体架构分析

本文设计的高速公路不停车收费系统的网络安全监控系统主要是由客户端和多个服务端组成,通过客户端对被监控的主机进行监控,获取主机的操作和运行信息,根据高速公路企业制定的安全准则和行为规范对主机的行为进行有效的管理,实现了一个可靠、实用、方便、高效的企业网络安全监控系统。     

高速公路联网收费中费率计算的研究

对高速公路联网收费环境下联网区域通行费费率的规划和计算问题进行了研究。根据联网区域中路网、车辆通行及收费方式的实际情况,建立了一个区域联网通行费费率的实用模型,并在此基础上提出了两个计算联网收费区域通行费费率的算法,同时给出了这两个算法正确性的简要证明。实际应用表明所提出的快速算法能满足区域联网收费的要求,快速正确地完成计算。最后,描述了一个联网收费区域标识站辅助规划的实用方案,可以减轻联网区域费率规划过程中的困难。     

Secure pay while on move toll collection using VANET

Manual toll tax collection requires vehicles to stop and pay. This results in long delays that nullify the aim of rapid transit of the toll roads. Existing pay as you drive techniques require offline payment and privacy breaching authentication process. In this paper, a VANET based privacy preserving secure pay while on move toll tax payment scheme is presented. The payment process is based on blinded coin in which the coin is obtained from the bank offline. As member of the VANET, a vehicle is a priori authenticated and makes online payment during the period it passes through the plaza.     

Microprocessor-based toll registration system

The toll registration system installed on the Humber Bridge uses a microprocessor in each of the 16 traffic lane booths, for the control of traffic, communication with the central processor and the computation of toll fees.

This article describes the system and operational procedures employed, with particular emphasis on the requirements and software development of the lane microprocessors.     

基于C/S的计重收费交通量数据采集系统

针对传统的连续式交通量调查的缺点,基于C/S模式,采用Access和SQLServer数据库,设计了一个计重收费交通量数据采集系统,并进行了工程实现。介绍了系统的工作原理,描述了软件功能,设计了数据库结构,并给出实现流程。最后通过实际交通量数据处理结果表明该系统能够实现24小时连续不间断数据采集,保证了交通量数据采集的准确性和可靠性。     

A practical anonymous payment scheme for electronic commerce

We propose a practical anonymous payment scheme with anonymous accounts. By means of our proposed scheme, the size of a bank's database is dramatically reduced. Also, the issue of e-coins for an anonymous account is controlled by several issuers, who represent a bank and who can be chosen by the customer or assigned by the system, on the current available issuers list according to the internet conditions. Our scheme does not require the assistance of a mutually entrusted third party.     

一种混合的Tor匿名通信系统

提出了一种混合的Tor匿名通信系统方案,它不仅能够保证Tor系统低的通信延迟,而且还能够排除其因未使用填充信息和批量处理技术而导致的安全问题.它确保了Tor匿名通信系统能够更加可靠地运行,实现用户身份隐藏.     

An on-line data collection system for film measurement

This article describes the basic elements in the Rutherford Laboratory on-line film measurement system, in which twelve film measuring machines are connected on line to an IBM 1130. The 1130 is linked to an IBM 360/195 by a parallel data link. The article mentions some of the lessons learnt in going on-line and describes current and future developments.     

基于收费数据的交通拥堵初发点计算

目前,在高速公路发生拥堵后,如何利用海量收费数据快速准确地得到高速公路交通拥堵初发点,仍然缺少满意的解决方案。经过对湖南省高速公路收费数据检索,提取出车辆出入站时刻、行车时间和车型等相关交通特征参数,依据这些参数特点,提出了一种计算相邻两收费站之间的交通拥堵初发点的计算方法。该方法通过选取同路段上的快、慢2种车型建立方程组,然后根据分析收费数据提取相应的变量代入方程组中,从而计算得出拥堵初发点信息。结果表明,该方法可以有效地计算得出相邻两个收费站之间路段上的拥堵初发点位置和初发时刻。对今后出行服务,运行效率评估和交通组织管理等具有重要的现实意义。     

Protocol for irreversible off-line transactions in anonymous electronic currency exchange

This paper presents an improvement to the well-known protocol by David Chaum for anonymous currency exchange. We show its vulnerability to serious frauds by both the client and the seller, after an electronic coin is spent at least twice. In this case, the system cannot successfully determine how many times the client spent the coin and how many times the seller faked the transaction. Therefore, the bank is not able to charge the real abuser. This limitation leads to the conclusion that the original system cannot be securely used for irreversible off-line transactions. In this paper, we show the gist of the problem and propose an improved system based on its original off-line version that allows this vulnerability to be overcome.     

一个新的无证书多重无链接签名方案*

基于无证书密码体制,提出一个新的多重无链接签名方案,新方案允许用户在不同的应用场合中使用不同的身份信息,并要求由这些身份所导出的不同公钥对应的签名密钥是唯一的,不同公钥的使用可以保证公钥的无链接性,从而更好地保护用户的隐私。在随机预言模型下,新方案可以抵抗适应性选择消息攻击。     

可监管的区块链匿名交易系统模型

针对现有区块链系统可追溯性与隐私保护难以兼顾的问题,设计了一种可监管的区块链匿名交易系统模型。首先,结合标识密码（IBC）和无证书公钥密码体制（CL-PKC）的优点,消除了单一IBC托管密钥带来的隐患,并在可保证安全条件下将用户交易标识与用户身份关联,从而保证了模型中的可监管性;其次,通过从网络层和应用层双层签名认证实现了隐私安全,既保证了用户交易内容和身份隐私的安全性,又确保权威机构能够根据异常交易进行追溯,从而为当下区块链匿名性和可监管性的兼容提供了一种新的思路;最后,把所提模型和自认证签名模型、多中心SM9模型及可追溯门罗币模型等进行对比,并通过计算机模拟仿真比较了所提模型和主流区块链模型的传输耗时。实验结果表明,所提模型在安全性和可追溯性上有较大优势;在相同软硬件环境下,多次传输相同大小信息时,所提模型的信息传输耗时比以太坊模型多168%,而长时间传输情况下效率差距不大;传输不同长度的信息时,所提模型的平均耗时要比以太坊模型多38%。     

秘密共享的抗攻击匿名通信系统

设计了一种抗攻击秘密共享匿名通信系统。该系统采用了秘密共享的思想来提高通信算法的可靠性和安全性。匿名通信时,通信双方存在多条链路;即使少量链路存在攻击者,仍然可以继续传输;发现攻击者后,也可以对链路进行动态地调整。分析发现该算法在抵抗前趋攻击等针对匿名通信的攻击方面优于传统的匿名通信算法。实验数据也表明：该算法在效率上虽然略劣于传统的匿名通信算法,但却以较小的效率代价获取了更高的可靠性和安全性。     

An atomicity-generating protocol for anonymous currencies

Atomicity is necessary for reliable electronic commerce transactions. Anonymity is also an issue of great importance not only to designers of commerce systems, but also to those concerned with the societal effects of information technologies, providing atomicity and anonymity is not trivial. Reliable systems, which provide highly atomic transactions, offer limited anonymity. Many anonymous systems (Rivest and Shamir, 1996) do not offer anonymous reliable transactions (Yee, 1994). Three basic approaches have been used: secure hardware for trusted record-keeping (Brands, 1993), storage of identity information with trustees for conditional anonymity (Low et al., 1993) or by providing dispute resolution only with the removal of anonymity (Chaum, 1988). In this work, the problem of anonymous atomic transactions for a generic token currency is solved using distributed trust and with the assumption that any single party may be corrupt. Defined is a transaction to include the provision of information goods or a contract to deliver specified goods, allowing for the highest degree of atomicity. The cryptographic strength of the atomicity guarantee can be made to the user's specification on a per transaction basis. The atomicity-generating protocol includes provision for dispute resolution and anonymous refunds. Also illustrated, is that any electronic token currency can be made reliable with the addition of this atomicity-generating protocol