As wireless LANs as well as the high-speed broadband Internet service are widely deployed, the VoIP service has become popular. Generally, a lot of commercial VoIP services use SIP and RTP for signaling and voice transport protocols. Most commercial VoIP service providers employ only simple security functions such as basic authentication without packet encryption because of fast implementation and deployment. Therefore, the VoIP service is highly vulnerable to several threats and attacks, because secure protocols for carrying VoIP packets are not fully utilized. For instance, unencrypted SIP packets including authentication messages could be easily forged to be exploited for generating anomaly traffic by malicious users. In this paper, we propose a flow-based VoIP anomaly traffic detection method that could find three representative VoIP anomaly attacks of SIP CANCEL, BYE DoS and RTP flooding that could be easily exploited in the real VoIP network. Our scheme uses the IETF IPFIX standard for monitoring VoIP calls in flow units. From the experiments with the commercial SIP phones in the real VoIP network, we show that SIP CANCEL, BYE DoS and RTP flooding attacks are easily generated and that they could be detected effectively by our proposed method.
{"title":"Detecting Anomaly Traffic using Flow Data in the real VoIP network","authors":"Hyeongu Son, Youngseok Lee","doi":"10.1109/SAINT.2010.108","DOIUrl":"https://doi.org/10.1109/SAINT.2010.108","url":null,"abstract":"As wireless LANs as well as the high-speed broadband Internet service are widely deployed, the VoIP service has become popular. Generally, a lot of commercial VoIP services use SIP and RTP for signaling and voice transport protocols. Most commercial VoIP service providers employ only simple security functions such as basic authentication without packet encryption because of fast implementation and deployment. Therefore, the VoIP service is highly vulnerable to several threats and attacks, because secure protocols for carrying VoIP packets are not fully utilized. For instance, unencrypted SIP packets including authentication messages could be easily forged to be exploited for generating anomaly traffic by malicious users. In this paper, we propose a flow-based VoIP anomaly traffic detection method that could find three representative VoIP anomaly attacks of SIP CANCEL, BYE DoS and RTP flooding that could be easily exploited in the real VoIP network. Our scheme uses the IETF IPFIX standard for monitoring VoIP calls in flow units. From the experiments with the commercial SIP phones in the real VoIP network, we show that SIP CANCEL, BYE DoS and RTP flooding attacks are easily generated and that they could be detected effectively by our proposed method.","PeriodicalId":381377,"journal":{"name":"2010 10th IEEE/IPSJ International Symposium on Applications and the Internet","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130095419","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}
We describe a web-based survey to assess how to evaluate a reputation by referring to his or her history of actions and taking account of his or her opponent’s reputation. The analysis indicates that there is a distinction between possible actions with an opponent having bad reputations. That is, cooperative action with opponents that have bad reputations is less favorable than cooperative action with someone with an average reputation, and defection against opponents that have bad reputations is more favorable than defection against someone with an average one. Evaluation of actor with opponents that have bad reputation are found to depend on two evaluation factors, intimacy and social desirableness, because evaluation words extracted from the respondents’ questionnaires could be classified with these two dimensions. This finding indicates that the norm of reputation making is more complex than the intuitive one-dimensional mechanism.
{"title":"Web-Based Experiment to Analyze Norms of Reputation Making: How to Evaluate Actions with a Opponent Having a Bad Reputation","authors":"Takahisa Suzuki, Tetsurou Kobayashi","doi":"10.1109/SAINT.2010.45","DOIUrl":"https://doi.org/10.1109/SAINT.2010.45","url":null,"abstract":"We describe a web-based survey to assess how to evaluate a reputation by referring to his or her history of actions and taking account of his or her opponent’s reputation. The analysis indicates that there is a distinction between possible actions with an opponent having bad reputations. That is, cooperative action with opponents that have bad reputations is less favorable than cooperative action with someone with an average reputation, and defection against opponents that have bad reputations is more favorable than defection against someone with an average one. Evaluation of actor with opponents that have bad reputation are found to depend on two evaluation factors, intimacy and social desirableness, because evaluation words extracted from the respondents’ questionnaires could be classified with these two dimensions. This finding indicates that the norm of reputation making is more complex than the intuitive one-dimensional mechanism.","PeriodicalId":381377,"journal":{"name":"2010 10th IEEE/IPSJ International Symposium on Applications and the Internet","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130553064","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}
Y. Takata, Ryo Hashimoto, R. Shinkuma, Tatsuro Takahashi, Naoki Yoshinaga, S. Itaya, Shinichi Doi, Keiji Yamada
A problem in the social-network-based intaraction distribution is that people are less motivated to forward information when psychological forwarding cost is large. The simplest solution for this is to compensate for the cost by giving people incentive reward when they forward information. However, it is unclear that, even if we successfully propagate information over the whole social network by the incentive reward, this propagation is meaningful for the sender (original information source). Therefore, in this paper, we propose a novel incentive rewarding method where incentive reward is assigned to a forwarder only when the receiver reacts to the forwarded information. In our method, forwarders are motivated to attach their own recommendation comment when they forward information. As a result, our method can promote receivers to react the information without increasing the total amount of incentive reward, compared with the method that gives incentive reward independently of the receiver's reaction.
{"title":"Incentive Rewarding Method for Information Propagation in Social Networks","authors":"Y. Takata, Ryo Hashimoto, R. Shinkuma, Tatsuro Takahashi, Naoki Yoshinaga, S. Itaya, Shinichi Doi, Keiji Yamada","doi":"10.1109/SAINT.2010.61","DOIUrl":"https://doi.org/10.1109/SAINT.2010.61","url":null,"abstract":"A problem in the social-network-based intaraction distribution is that people are less motivated to forward information when psychological forwarding cost is large. The simplest solution for this is to compensate for the cost by giving people incentive reward when they forward information. However, it is unclear that, even if we successfully propagate information over the whole social network by the incentive reward, this propagation is meaningful for the sender (original information source). Therefore, in this paper, we propose a novel incentive rewarding method where incentive reward is assigned to a forwarder only when the receiver reacts to the forwarded information. In our method, forwarders are motivated to attach their own recommendation comment when they forward information. As a result, our method can promote receivers to react the information without increasing the total amount of incentive reward, compared with the method that gives incentive reward independently of the receiver's reaction.","PeriodicalId":381377,"journal":{"name":"2010 10th IEEE/IPSJ International Symposium on Applications and the Internet","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133952985","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}
In this paper, we propose a trust estimation method for a parson by the rating of his or her active audience of social web such as Twitter. We call this method 'trust by the rating of a persona's active audience.' A 'persona', such as 'Display Name' of Twitter (with additional authentication) or 'Claimed ID' of OpenID, denotes an artificial identity to represent one's social position in the user-centric authorization. We utilize the 'persona' to be an object to accumulate the rating of trust for IT services for our trust estimation method. The most significant difference of our trust model and traditional one like PKI is that the trustworthiness of persona is not stable. Therefore, we focused on the implement methods for the sensitivity of the temporal change of a persona's trustworthiness. The basic idea of our 'trust by the rating of a persona's active audience' is similar to the Google Page Rank method. We also try to show that this kind of social web based trust has a possibility to be a global infrastructure for trust.
{"title":"A Dynamic Trust Estimation Method for 'Persona' from the Human Relationship of Social Web","authors":"Shigeichiro Yamasaki","doi":"10.1109/SAINT.2010.51","DOIUrl":"https://doi.org/10.1109/SAINT.2010.51","url":null,"abstract":"In this paper, we propose a trust estimation method for a parson by the rating of his or her active audience of social web such as Twitter. We call this method 'trust by the rating of a persona's active audience.' A 'persona', such as 'Display Name' of Twitter (with additional authentication) or 'Claimed ID' of OpenID, denotes an artificial identity to represent one's social position in the user-centric authorization. We utilize the 'persona' to be an object to accumulate the rating of trust for IT services for our trust estimation method. The most significant difference of our trust model and traditional one like PKI is that the trustworthiness of persona is not stable. Therefore, we focused on the implement methods for the sensitivity of the temporal change of a persona's trustworthiness. The basic idea of our 'trust by the rating of a persona's active audience' is similar to the Google Page Rank method. We also try to show that this kind of social web based trust has a possibility to be a global infrastructure for trust.","PeriodicalId":381377,"journal":{"name":"2010 10th IEEE/IPSJ International Symposium on Applications and the Internet","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131708347","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}
This paper studies a method for getting necessary QoS for user satisfaction. For a service, its user satisfaction can have some aspects and must be treated from every aspect. However, it is not easy to find feasible QoS that satisfies a user from every aspect. This paper assumes QoS mapping with the multiple linear regression and defines a QoS mapping matrix. By popular matrix operations, which include generalized inverse, we can decide necessary QoS for required user satisfaction in every aspect. To confirm the effectiveness of the method, this paper shows the numerical results.
{"title":"Calculation of Necessary QoS for User Satisfaction with a QoS Mapping Matrix","authors":"Yoshihiro Ito","doi":"10.1109/SAINT.2010.95","DOIUrl":"https://doi.org/10.1109/SAINT.2010.95","url":null,"abstract":"This paper studies a method for getting necessary QoS for user satisfaction. For a service, its user satisfaction can have some aspects and must be treated from every aspect. However, it is not easy to find feasible QoS that satisfies a user from every aspect. This paper assumes QoS mapping with the multiple linear regression and defines a QoS mapping matrix. By popular matrix operations, which include generalized inverse, we can decide necessary QoS for required user satisfaction in every aspect. To confirm the effectiveness of the method, this paper shows the numerical results.","PeriodicalId":381377,"journal":{"name":"2010 10th IEEE/IPSJ International Symposium on Applications and the Internet","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133361173","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}
Experimental implementation of NetDraw, a draw program which is a plug-in of a wiki software, is shown. The draw program of a computer assisted teaching system is exploited to make NetDraw. It takes about three weeks to make the first version of NetDraw. NetDraw is a collaborative tool through drawing. It has been using for computer science classes in a university. A Teacher’s work for preparing classes was reduced by using NetDraw.
{"title":"A Draw Plug-In for a Wiki Software","authors":"Takashi Yamanoue","doi":"10.1109/SAINT.2010.102","DOIUrl":"https://doi.org/10.1109/SAINT.2010.102","url":null,"abstract":"Experimental implementation of NetDraw, a draw program which is a plug-in of a wiki software, is shown. The draw program of a computer assisted teaching system is exploited to make NetDraw. It takes about three weeks to make the first version of NetDraw. NetDraw is a collaborative tool through drawing. It has been using for computer science classes in a university. A Teacher’s work for preparing classes was reduced by using NetDraw.","PeriodicalId":381377,"journal":{"name":"2010 10th IEEE/IPSJ International Symposium on Applications and the Internet","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117282150","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 ZigBee which is a type of the sensor networks defines a role of the Trust Center, so it securely communicates through the key distribution. But the key distribution through the Trust Center concentrates all traffic from the Trust Center, so it occurs a delay and an overhead. In this paper, we design a key distribution scheme for secure communication in the wireless sensor networks. It is designed to the Trust Center to Trust Center, the Trust Center to node and the node to node in the proposal scheme. Specially, the proposal scheme through a key distribution between the Trust Centers by reuse the key information improves an energy consumption and a security.
{"title":"An Enhanced Key Distribution Scheme for the Energy Consumption and the Security in the Wireless Sensor Networks","authors":"Hyeopgeon Lee, Kyounghwan Lee, Yongtae Shin","doi":"10.1109/SAINT.2010.69","DOIUrl":"https://doi.org/10.1109/SAINT.2010.69","url":null,"abstract":"The ZigBee which is a type of the sensor networks defines a role of the Trust Center, so it securely communicates through the key distribution. But the key distribution through the Trust Center concentrates all traffic from the Trust Center, so it occurs a delay and an overhead. In this paper, we design a key distribution scheme for secure communication in the wireless sensor networks. It is designed to the Trust Center to Trust Center, the Trust Center to node and the node to node in the proposal scheme. Specially, the proposal scheme through a key distribution between the Trust Centers by reuse the key information improves an energy consumption and a security.","PeriodicalId":381377,"journal":{"name":"2010 10th IEEE/IPSJ International Symposium on Applications and the Internet","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130884275","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}
H. Kinoshita, Kudo Mamoru, T. Morizumi, Kazuhiro Suzuki
Electronic cash is the most fundamental element in electronic commerce. The finance administration authorities must consider controlling the flow of electronic money differently from the flow of conventional cash. The central bank coordinates the quantity of currency to be printed and coordinates money supply so that inflation does not occur. The money has three functions: information to show its value, evidence to show it is validly issued, and a symbol to show who can use it. The symbolic function is important to prevent duplicate reuse of money. We have been studying an electronic cash system using distributed database of a central bank to develop a new settlement method. In this system, the central bank issues money, and its value is not stored in users hardware such as IC cards. Money and a user are linked by public key cryptography that implements the symbolic function. In this paper, we discuss the conditions for making electronic money a substitute for banknotes. Then we propose an electronic money system with discrete logarithms. In this system, the transactions are less traceable than those in our previous study.
{"title":"An Electronic Money System as Substitute for Banknotes","authors":"H. Kinoshita, Kudo Mamoru, T. Morizumi, Kazuhiro Suzuki","doi":"10.1109/SAINT.2010.41","DOIUrl":"https://doi.org/10.1109/SAINT.2010.41","url":null,"abstract":"Electronic cash is the most fundamental element in electronic commerce. The finance administration authorities must consider controlling the flow of electronic money differently from the flow of conventional cash. The central bank coordinates the quantity of currency to be printed and coordinates money supply so that inflation does not occur. The money has three functions: information to show its value, evidence to show it is validly issued, and a symbol to show who can use it. The symbolic function is important to prevent duplicate reuse of money. We have been studying an electronic cash system using distributed database of a central bank to develop a new settlement method. In this system, the central bank issues money, and its value is not stored in users hardware such as IC cards. Money and a user are linked by public key cryptography that implements the symbolic function. In this paper, we discuss the conditions for making electronic money a substitute for banknotes. Then we propose an electronic money system with discrete logarithms. In this system, the transactions are less traceable than those in our previous study.","PeriodicalId":381377,"journal":{"name":"2010 10th IEEE/IPSJ International Symposium on Applications and the Internet","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131005916","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}
Nobuhiko Matsuura, H. Mineno, N. Ishikawa, T. Mizuno
A context-aware service that uses sensing data has attracted attention, along with the development of wireless technology and sensor technology. To provide these services, the sensing data sharing system in P2P networks needs to cope with a vast amount of data. However, existing algorithms do not respond to varying the number of sensing data types. In addition, most existing algorithms cannot execute reverse key resolutions because their search algorithms need to include specific data as the key in the query. To address these issues, we propose a multi-dimensional range search algorithm in P2P networks that uses a B+tree for an efficient search with an arbitrary number of sensing data types.
{"title":"Evaluation of B+Tree-Based Multi-dimensional Range Search Algorithm for P2P Networks","authors":"Nobuhiko Matsuura, H. Mineno, N. Ishikawa, T. Mizuno","doi":"10.1109/SAINT.2010.34","DOIUrl":"https://doi.org/10.1109/SAINT.2010.34","url":null,"abstract":"A context-aware service that uses sensing data has attracted attention, along with the development of wireless technology and sensor technology. To provide these services, the sensing data sharing system in P2P networks needs to cope with a vast amount of data. However, existing algorithms do not respond to varying the number of sensing data types. In addition, most existing algorithms cannot execute reverse key resolutions because their search algorithms need to include specific data as the key in the query. To address these issues, we propose a multi-dimensional range search algorithm in P2P networks that uses a B+tree for an efficient search with an arbitrary number of sensing data types.","PeriodicalId":381377,"journal":{"name":"2010 10th IEEE/IPSJ International Symposium on Applications and the Internet","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131866880","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}
For P2P contents sharing, a construction method of unstructured overlay is known for improving search efficiency and preventability of downloading polluted contents. To design better construction method, we need a good metric of the two performances for overlay. Existent metrics are insufficient for measuring the two performances simultaneously in the situation where there are peers whose probabilities of providing polluted contents are diverse. In this paper, a metric of the two performances for overlay is proposed. By simulations, we confirm that proposed metric is effective in contents sharing on overlay where there are peers whose probabilities of providing polluted contents are diverse.
{"title":"A Metric of Search Efficiency and Preventability of Polluted Contents for Unstructured Overlay","authors":"Hiroaki Yamanaka, T. Fujiwara, Shingo Okamura","doi":"10.1109/SAINT.2010.76","DOIUrl":"https://doi.org/10.1109/SAINT.2010.76","url":null,"abstract":"For P2P contents sharing, a construction method of unstructured overlay is known for improving search efficiency and preventability of downloading polluted contents. To design better construction method, we need a good metric of the two performances for overlay. Existent metrics are insufficient for measuring the two performances simultaneously in the situation where there are peers whose probabilities of providing polluted contents are diverse. In this paper, a metric of the two performances for overlay is proposed. By simulations, we confirm that proposed metric is effective in contents sharing on overlay where there are peers whose probabilities of providing polluted contents are diverse.","PeriodicalId":381377,"journal":{"name":"2010 10th IEEE/IPSJ International Symposium on Applications and the Internet","volume":"268 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132159348","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
扫码关注我们
求助内容：
应助结果提醒方式：