Design and Analysis of Authenticated Key Agreement Schemes for Future IoT Applications and Session Initiation Protocol
|
|
- Joy Bryan
- 6 years ago
- Views:
Transcription
1 Desgn and Analyss of Authentcated Key Agreement Schemes for Future IoT Applcatons and Sesson Intaton Protocol Thess submtted n partal fulfllment of the requrements for the degree of Master of Scence (By Research) n Computer Scence and Engneerng by C. Sravan Roll No c.sravan@research.t.ac.n Internatonal Insttute of Informaton Technology, Hyderabad (Deemed to be Unversty) Hyderabad , INDIA JULY 2017
2
3 Desgn and Analyss of Authentcated Key Agreement Schemes for Future IoT Applcatons and Sesson Intaton Protocol Thess submtted n partal fulfllment of the requrements for the degree of Master of Scence (By Research) n Computer Scence and Engneerng by C. Sravan under the gudance of Dr. Ashok Kumar Das Internatonal Insttute of Informaton Technology, Hyderabad (Deemed to be Unversty) Hyderabad , INDIA JULY 2017
4
5 Copyrght c C. SRAVANI, 2017 All Rghts Reserved
6
7 Dedcated to my famly
8
9 Declaraton I certfy that a. The work contaned n ths thess s orgnal and has been done by myself under the general supervson of my supervsor. b. The work has not been submtted to any other Insttute for any degree or dploma. c. I have followed the gudelnes provded by the Insttute n wrtng the thess. d. I have conformed to the norms and gudelnes gven n the Ethcal Code of Conduct of the Insttute. e. Whenever I have used materals (data, theoretcal analyss, and text) from other sources, I have gven due credt to them by ctng them n the text of the thess and gvng ther detals n the references. f. Whenever I have quoted wrtten materals from other sources, I have put them under quotaton marks and gven due credt to the sources by ctng them and gvng requred detals n the references. Place : IIIT Hyderabad C. Sravan MS Student Date: Roll No Center for Securty, Theory and Algorthmc Research Internatonal Insttute of Informaton Technology Hyderabad , INDIA
10
11 CERTIFICATE Ths s to certfy that the thess enttled Desgn and Analyss of Authentcated Key Agreement Schemes for Future IoT Applcatons and Sesson Intaton Protocol, submtted by C. Sravan to Internatonal Insttute of Informaton Technology, Hyderabad, s a record of bona fde research work under my supervson and s worthy of consderaton for the award of the degree of Master of Scence (By Research) n Computer Scence and Engneerng of the Insttute. Place : IIIT Hyderabad Date: Dr. Ashok Kumar Das Center for Securty, Theory and Algorthmc Research Internatonal Insttute of Informaton Technology Hyderabad , INDIA
12
13 Acknowledgments The success and fnal outcome of ths MS thess requred a lot of gudance and assstance from many people and I am extremely fortunate to have got ths all along the completon of my MS thess work. Whatever I have done s only due to such gudance and assstance, and I would not forget to thank them. I owe my profound grattude to my MS advsor Dr. Ashok Kumar Das, who took keen nterest n my MS work and guded me all along, tll the completon of my MS thess by provdng all hs valuable gudance and support wthout whch ths work would not have been possble. I am thankful to and fortunate enough to get constant encouragement, support and gudance from all the Teachng staff of Center for Securty, Theory and Algorthmc Research whch helped me n successfully completng my thess work. Also, I would lke to extend my sncere regards to all the non-teachng staff of Internatonal Insttute of Informaton Technology, Hyderabad for ther tmely support. Fnally, I would lke to thank my parents for provdng me wth unfalng support and contnuous encouragement throughout my years of study. Ths accomplshment would not have been possble wthout them. Place : IIIT Hyderabad Date: C. Sravan MS Student Center for Securty, Theory and Algorthmc Research Internatonal Insttute of Informaton Technology Hyderabad , INDIA
14
15 Abstract The ablty to convey nformaton quckly, accurately, and effcently s one of the prmary ams of human nnovaton. Wth the nventon of the electronc numercal ntegrator and computer, an nteracton between nformatcs and telecommuncaton began whch added faster data processng to dstant communcaton. The conventonal crcut swtchng was soon replaced by packet swtchng, and the TCP/IP protocol sute, facltatng communcaton between computers/heterogeneous machnes, ultmately leadng to the brth of the Internet. The advent of the Internet has resulted n the redefnng of tradtonal modes of communcaton lke rado, televson and paper mal gvng rse to servces such as emal, dgtal newspapers, Internet telephony and vdeo streamng. Wth networks growng exponentally, modern communcaton methods have become the drvng force of socal evoluton. The ever ncreasng amount of nformaton beng generated presents new challenges n terms of storage, transfer and securty. Snce computers can range from stand-alone to networked devces, varous avenues of attacks are avalable to compromse nformaton securty. Ensurng confdentalty of nformaton beng transmtted and stored s therefore essental. Also known as access control, ths can be acheved through authentcaton. Authentcaton s the process of verfyng a clamed dentty. The valdaton method can nvolve multple factors wth the level of securty beng proportonal to the number and type of factors nvolved. Mutual authentcaton s where the nvolved partes smultaneously authentcate each other to establsh a connecton. It s most often mplemented machne-to-machne through dgtal certfcates where there s a chance of the user not realzng when the remote authentcaton fals. Challenge-response based mechansms help mtgate ths problem by detectng false end-ponts. In ths thess, we study the mportance of authentcaton and key agreement n two dfferent network applcatons Internet of Thngs (IoT) and Sesson Intaton Protocol (SIP). The frst study presents a new Ellptc Curve Cryptography (ECC) sgnaturebased authentcated key establshment scheme for applcatons n IoT envronment. The proposed scheme accommodates password and bometrc update as well as stolen/lost smartcard revocaton phases. The proposed scheme has been proved to be secure usng the wdely-used Burrows-Abad-Needham logc (BAN logc), nformal securty analyss, and also a formal securty verfcaton usng the broadly-accepted Automated Valdaton of Internet Securty Protocols and Applcatons (AVISPA) tool. The practcal demonstraton of the scheme s evaluated usng the wdely-accepted NS2 smulator for varous network
16 performance parameters. Fnally, t s shown that the scheme provdes more functonalty features, and ts computatonal and communcaton costs are also comparable wth other exstng approaches. In the next study, we focus on authentcaton n Sesson Intaton Protocol for Voce over IP envronments. In ths work, we present an effcent ECC based three-factor authentcaton and sesson key agreement scheme for SIP, whch uses the dentty, password and personal bometrcs of a user as three factors. The proposed scheme resolves the shortcomngs n exstng SIP authentcaton protocols. The proposed scheme also supports password and bometrc update phase wthout nvolvng the server and the user moble devce revocaton phase n case the moble devce s lost/stolen. Formal securty analyss under the Real-Or-Random (ROR) model and the broadly-accepted BAN logc ensures that the proposed scheme can wthstand several known securty attacks. The proposed scheme has also been analyzed nformally to show that t can also wthstand other known attacks. Smulaton for formal securty verfcaton usng the wdely-known AVISPA tool shows that the scheme s secure aganst replay and man-n-the-mddle attacks. Fnally, hgh securty, and low communcaton and computaton costs make the proposed scheme more sutable for practcal applcaton as compared to other exstng related ECC-based schemes for SIP authentcaton. Keywords: Authentcaton, Key Establshment, Sesson Intaton Protocol, Ellptc Curve Cryptography, Internet of Thngs (IoT), BAN logc, AVISPA, NS2 smulaton, Securty.
17 Dssemnaton of Work Chapter #4. Sravan Challa, Mohammad Wazd, Ashok Kumar Das, Neeraj Kumar, Alavalapat Goutham Reddy, Eun-Jun Yoon, and Kee-Young Yoo. Secure Sgnature-Based Authentcated Key Establshment Scheme for Future IoT Applcatons, n IEEE Access, Vol. 5, pp , (2016 SCI Impact Factor: 3.224) [Ths artcle s one of the top 50 most frequently downloaded documents for Popular Artcles (May 2017)] Chapter #5. Sravan Challa, Ashok Kumar Das, Saru Kumar, Vanga Odelu, Fan Wu, and Xong L. Provably secure three-factor authentcaton and key agreement scheme for sesson ntaton protocol, n Securty and Communcaton Networks (Wley), Vol. 9, No. 18, pp , (2016 SCI Impact Factor: 1.067)
18
19 Contents 1 Introducton Internet of Thngs (IoT) Applcatons Functonalty requrements Securty requrements Sesson ntaton protocol Functonalty requrements Securty requrements Objectve of the work Summary of contrbutons Sgnature-based three-factor authentcated key establshment for future IoT applcatons Three-factor authentcaton and key agreement for sesson ntaton protocol Organzaton of the thess Mathematcal Prelmnares One-way hash functon Bomtrecs and fuzzy extractors Ellptc curve cryptography Ellptc curve over a fnte feld ECC encrypton and decrypton Ellptc curve dgtal sgnature ECC vs RSA Summary
20 CONTENTS 3 Revew of Related Works Authentcaton and key agreement schemes for IoT applcatons Authentcaton schemes for SIP Summary Sgnature-Based Three-Factor Authentcated Key Establshment for Future IoT Applcatons System models IoT authentcaton model Threat model Our contrbutons The proposed scheme System setup phase Sensng devce regstraton phase User regstraton phase Logn phase Authentcaton and key agreement phase Password and bometrc update phase Smart card revocaton phase Dynamc sensng devce addton phase Securty analyss of the proposed scheme Mutual authentcaton usng BAN logc Dscusson on other attacks Formal securty verfcaton usng AVISPA tool Performance comparson Practcal perspectve: NS2 smulaton study Smulaton parameters Smulaton envronment Smulaton results and dscussons Summary Three-Factor Authentcaton and Key Agreement for Sesson Intaton Protocol Threat model Our contrbutons
21 CONTENTS 5.3 Overvew of Mshra s scheme System setup phase Regstraton phase Authentcaton and key agreement phase Password change phase Cryptanalyss and lmtatons of Mshra s scheme Prvleged-nsder attack Offlne-password guessng attack Denal-of-servce attack Server dependent password change phase The proposed scheme System setup phase Regstraton phase Logn phase Authentcaton and key agreement phase Password and bometrc update phase Moble devce revocaton phase Securty analyss of the proposed scheme Formal securty analyss usng random oracle model Formal securty analyss usng BAN logc Informal securty analyss and other dscussons Smulaton for formal securty verfcaton through AVISPA tool Implementaton detals n HLPSL Smulaton result analyss Performance comparson Summary Concluson and Future Works Contrbutons Future research drectons
22
23 Lst of Fgures 4.1 Authentcaton model for IoT applcatons (Adapted from [40]) Summary of user regstraton phase Summary of logn and authentcaton phases Summary of password and bometrc update phase Summary of smart card revocaton phase Archtecture of the AVISPA tool (Source: [7]) Role specfcaton n HLPSL for the user U Role specfcaton n HLPSL for the GW N Role specfcaton n HLPSL for the sensng devce SD j Role specfcaton n HLPSL for the sesson, goal and envronment Analyss of smulaton results usng OFMC and CL-AtSe backends End-to-end delay of our scheme Throughput of our scheme Summary of regstraton phase n the proposed scheme Summary of logn, and authentcaton and key agreement phases n the proposed scheme Password and bometrc update phase Role specfcaton for user U Role specfcaton for server S Role specfcaton of sesson, goal and envronment Smulaton result usng OFMC backend of our scheme Smulaton result usng CL-AtSe backend of our scheme
24
25 Lst of Tables 2.1 Comparson of key length and computaton tme for sgnature generaton [50] Notatons used n ths chapter Approxmate tme requred for varous operatons [74] Comparson of computaton overhead of our scheme wth related IoT schemes Comparson of communcaton overhead of our scheme wth related IoT schemes Comparson of functonalty features of the proposed scheme wth related IoT schemes Varous smulaton parameters Notatons used n ths chapter Approxmate tme requred for varous operatons [74] Comparson of computaton overhead of the proposed scheme wth related ECC-based schemes Comparson of communcaton overhead of the proposed scheme wth related ECC-based schemes Comparson of functonalty features of the proposed scheme wth related ECC-based schemes
26
27 Chapter 1 Introducton Authentcaton s the process of confrmng the valdty of a clamed dentty by verfyng at least one knd of dentfcaton. The process of confrmaton mght nclude verfyng dentfcaton documents, dgtal certfcates for webstes or determnng age usng carbon datng. Authentcaton methods can be broadly classfed nto three categores based on the factors nvolved whch are as follows: Knowledge: It s known to the user lke personal dentfcaton number, password, securty queston etc. Ownershp: It s possessed by the user lke smart card, securty token, moble devce etc. Inherence: It s a characterstc of the user lke bometrcs, sgnature etc. Authentcaton can be ensured through any or all the factors mentoned above and thus, the methods nvolved can be sngle-factor, two-factor or mult-factor n ncreasng order of securty. Mult-factor authentcaton allows usng dfferent factors from the same category - for example, usng both password and securty queston. Three-factor authentcaton, however, requres usng one factor from each of the above mentoned categores - password, smart card and bometrcs, for nstance. The relablty of the authentcaton s dependent not just on the factors chosen but how they are mplemented as well. The followng subsectons dscuss two networkng technques - Internet of Thngs (IoT) and Sesson Intaton Protocol (SIP) - along wth ther applcatons, functonal and securty requrements, focusng on the mportance of authentcaton n these scenaros.
28 2 Introducton 1.1 Internet of Thngs (IoT) IoT encompasses a system of physcal objects that are nterconnected to exchange and collect data over the nternet. These objects are equpped wth the requred processng and communcaton abltes and possess a locatable Internet Protocol address (IP address). The objectve here s to ntegrate computer-based systems and the physcal world for economc beneft, and to mprove accuracy and effcency whle reducng human nvolvement. Cyber-physcal systems such as smart grds and ntellgent transportaton can be consdered as subsets of IoT [6]. The connectvty provded should be beyond machneto-machne communcaton coverng varous protocols and applcatons nterconnectng systems, devces and servces. Multple technologes lke wreless communcaton, embedded systems and machne learnng are the buldng blocks of ths vson. Applcatons of IoT are dverse ncludng nfrastructure management n hgh-rsk condtons, dsaster management through envronmental montorng and provdng remote health-care servces, to lst a few. IoT, whle broadenng access to nformaton, has an enormous threat to securty and prvacy due to ts heterogeneous and dynamc nature. Cyber attacks could change from vrtual to physcal wth the ncrease n number of wearable devces. An estmated 50 bllon objects wll be a part of IoT by 2020 [40]. IoT beng a relatvely new concept, the securty challenges nvolved have not been addressed approprately at the desgn level for these objects. Employng effectve securty practces, especally authentcaton and key management schemes to protect anonymty and prvacy, are requred. In the followng subsectons, applcatons, functonal and securty requrements of IoT are dscussed Applcatons Ths secton dscusses some promnent applcatons of IoT whch are as follows: Wearable devces: Rangng from navgaton tools and communcaton gadgets to ftness trackers and specfc health montorng devces, wearable devces have both personal and busness use. Most models rely on short-range wreless communcaton technologes lke Bluetooth and local W-F setups. The IoT applcatons used for wearables should be energy effcent. The devces are ncorporated wth sensors and software to gather data for obtanng meanngful nsghts about users through analyss.
29 1.1 Internet of Thngs (IoT) 3 Telemedcne: Wth rapd developments n wreless sensor healthcare networks for enablng remote medcal servces, IoT can help people n lvng a healther lfe through connected wearable devces. The accumulated data helps provde personalzed analyss of a person s health and approprate remedes can be taken. Industral Internet: Through bg data analytcs, sensors and software ndustral IoT s helpng n creatng machnes that are more consstent and accurate n communcatng through data. Ths also helps detect problems and neffcences sooner. Conventonal automaton methods can be transformed through machne-to-machne communcaton, wreless connecton and nnovatve hardware. Qualty control and sustanablty can also be acheved usng ths. Energy management: Smart grds collect data whch s analysed for behavour patterns of electrcty supplers and consumers to mprove the economcs and effcency of usage. They are also hghly relable as power outages are detected quckly at an ndvdual home level, thus accommodatng a dstrbuted energy system. IoT n agrculture: Wth the ncreasng demand for food supply, usng advanced technques to research on food producton and sustanablty s mportant whch requres hghly scalable solutons. Sensng for mosture n sol and nutrents, controlled waterng of plants and determnng customzed fertlzers are some advantages of usng IoT n agrculture. Smart farmng helps farmers n ganng nsghts from data to mprove returns on nvestment. Smart home: The applances and devces n a smart home have the capacty to communcate wth each other and the surroundng envronment. They enable controllng and customzng the home envronment to provde effcent energy management and better securty n addton to savng tme and money. Smart cty: Ths helps deal wth ssues lke traffc congeston, polluton and energy supply defct. Some applcatons of IoT n buldng smart ctes nclude automated transportaton, smart survellance, montorng envronment, water dstrbuton and smart energy management systems. For example, sensors and web applcatons can help detect meter tamperng ssues and any malfuncton n the power grd.
30 4 Introducton Functonalty requrements To enable smooth operaton of IoT, some crtcal functonalty requrements of the nvolved enttes are dscussed below. Interoperablty: Wth the number of IoT devces ncreasng everyday, ther applcatons are also becomng ncreasngly dverse. Whle sensors can be used to record surroundng condtons lke temperature and mosture level, actuators are used to trgger specfc events. Wearable devces that gather health statstcs are ganng popularty. As heterogenety s one of the promnent propertes of IoT applcatons and devces, t s essental to ensure that nteracton between all nvolved enttes s possble. The connectvty requred for such nteractons should be dverse supportng varous wred and wreless technologes. Sensng and ntellgence: The nvolved nodes n IoT should be able to adapt themselves and self-organze as per the clent s requests to facltate data sharng and performng coordnated tasks. The gradual shft n paradgm from always-on servces to always-responsve servces allows for the desgnng of applcaton and context specfc IoT platforms that cater to the clent requests at run-tme. The servce dscovery should therefore, be ntellgent and done through wreless sensng to avod both constrants of wred alternatves and the dependence on external trggers. Energy effcent: The nodes wth the above mentoned sensng capabltes should use power effcently durng computaton and communcaton. Also, as most nodes are dormant majorty of the tme, state swtchover should be avalable so that kernel can change redundant nodes to sleep/swtch off mode. The hardware desgned for such purposes should be ntellgent enough to consume very low energy n sleep mode. Data management: Varous enttes nvolved n IoT generate large amounts of data ether through processng or sensng whch s sent n real-tme for storage and analyss. The platform should therefore possess the capacty to handle such massve amounts of data wthout any human nterventon. Analytc tools: To gan valuable nsghts nto the data gathered as mentoned above, powerful tools for data analyss are requred.
31 1.1 Internet of Thngs (IoT) 5 Scalablty: The desgn of any IoT platform should take nto the consderaton the exponental ncrease n devces and the data generated and processed by them to acheve the true potental of IoT solutons. Avalablty and relablty: As IoT platforms possess the ablty to nteract wth and control devces mpactng daly lfe, hgh avalablty s exceptonally mportant. Also, the devces should be relable enough to provde performance and servces as per the needs of the applcatons they have been desgned for. Openness: An IoT platform could go beyond ts specalzed servces and provde an Applcaton Programmng Interface (API) facltatng thrd partes n applcaton development. Securty: Owng to the dversty of the enttes nvolved n IoT, ensurng secure communcaton across connectons, applcatons, devces and even the data beng transmtted and stored s mportant. Ths ssue has been further dealt wth n the next subsecton Securty requrements As accessblty and global connectvty are the key requrements of any IoT applcaton, t ncreases the avalable avenues of threats and attacks. The heterogeneous nature of IoT further rases complexty n the deployment of securty mechansms. The wreless nature of most nvolved enttes and ther lmted capacty are also problematc. Possble transent and random falures are vulnerabltes that attackers could explot. The varous possble attacks on IoT applcatons are lsted below. Denal-of-servce: Apart from conventonal denal-of-servce (DoS) attacks lke exhaustng resources and bandwdth, IoT can be susceptble to attacks on communcaton nfrastructure lke channel jammng. Adversares who are prvleged nsders can gan control of the relevant nfrastructure to cause more chaos n the network. Controllng: Actve attackers can gan partal or full control of IoT enttes and the extent of damage that can be caused s based on the followng: Servces beng provded by the entty. Relevance of the data beng managed by that entty.
32 6 Introducton Eavesdroppng: Ths s a passve attack through whch nformaton can be gathered from channel communcaton. A malcous nsder attacker can also gan more advantage by capturng nfrastructure or enttes. Physcal damage: The easy accessblty of IoT enttes and applcatons can be exploted by attackers to cause physcal harm hnderng servces by attackng an entty or the hardware of the module creatng t vrtually. Attackers lackng techncal knowledge and wantng to cause consderable damage can utlze ths. Node capture: Easy accessblty can also be a vulnerablty for nformaton extracton through capturng enttes and tryng to extract stored data usng power analyss attacks [55, 69]. Ths s a major threat aganst data processng and storage enttes. The countermeasures to recover from such attacks once they are detected and dagnosed should be lghtweght due to the lmted capacty of the nvolved enttes. The solutons must be real-tme n nature and f possble, a part of self-healng nfrastructure. Any programmng nformaton requred to deploy the soluton should be communcated securely to the enttes. The followng are some requrements for IoT to counter securty breaches: Relablty: The am s to guarantee nformaton avalablty whle effcently managng data storage. Provdng redundancy among communcaton channels through multple paths s one way to ensure avalablty. Responsblty: Otherwse known as access control, ths ensures legtmate access to servces by defnng prvacy constrants. The rules for each entty and possble labltes must be clearly defned to avod damages. Prvacy: Owng to the ubqutous nature of IoT, provdng prvacy s very mportant. There are the followng three areas where prvacy has to be ensured: Data sharng and management: Ths can be acheved by enumeratng data aggregated at the sensors. Also, prvacy-preservaton technques can be used. Data collecton: Some cryptographc approaches mentoned n [56, 64] can be used. Data securty: Ths can be ensured through password protecton.
33 1.2 Sesson ntaton protocol 7 Trust: IoT s dynamc and dstrbuted and thus, ensurng trust among nteractng enttes s mportant. In a heterogeneous network lke IoT where devces and not just humans can be nvolved n trust management, resource constrants should also be consdered whle developng technques. Safety: System components can be prone to sudden falures and safety s requred to reduce damage possbltes. Identfcaton and authentcaton: Prvacy and secure access can be ensured prmarly through ths. As global access s a necessty n IoT, enttes could have one permanent and several temporary denttes. 1.2 Sesson ntaton protocol Wth the nventon of the Electronc Numercal Integrator And Computer (ENIAC), an nteracton between nformatcs and telecommuncaton began whch added faster data processng to dstant communcaton. The conventonal crcut swtchng was soon replaced by packet swtchng, and the TCP/IP protocol sute, facltatng communcaton between computers/heterogeneous machnes, ultmately leadng to the brth of the Internet. Voce over IP (or Internet telephony), an ntegrated voce/data soluton, was developed to replace tradtonal PSTN (Publc Swtched Telephone Network) connectons and to enable transmsson of voce sgnals from telephone as dgtal sgnals over exstng data networks. Smlar to tradtonal telephony n call ntaton, VoIP also nvolves sgnalng, channel setup and analog to dgtal converson of voce/vdeo sgnals. However, as the sgnals are transmtted through packet swtchng nstead of crcut swtchng, encodng s done usng approprate voce/vdeo codecs. The mplementaton of VoIP has been done usng varous propretary protocols as well as protocols based on open standards. Sesson Intaton Protocol (SIP) s the most wdely used for sgnallng among these. SIP operates at the applcaton-layer and s used manly for creatng, modfyng, and termnatng sessons over one or several meda streams. These sessons nclude VoIP calls and multmeda conferences, nstant messagng and event subscrpton/notfcaton. SIP operates ndependent of the underlyng transport layer protocol whch ncludes TCP, UDP or Stream Control Transmsson Protocol (SCTP). It can be used to establsh both uncast and multcast sessons. The protocol also allows for modfcaton of exstng calls by changng ports or addresses. Partcpants
34 8 Introducton and meda streams can be added or deleted as per requrement. Analogous to SS7 (Sgnallng System No. 7) n tradtonal telephony n mplementaton of call processng features, SIP beng text based, has a smlar formattng to HTTP (Hypertext Transfer Protocol), reusng most of the status codes, header felds and encodng rules. SIP follows a challenge response mechansm smlar to HTTP. Also, n contrast to the centralzed archtecture of SS7 where features are mplemented at network core and most endponts are non-computng nodes (tradtonal handsets), SIP features are mplemented at the communcatng end ponts that follow a clent-server model. The codng and meda formats n SIP are mplemented usng several other protocols that work n concert wth SIP for communcaton after call s setup. Durng call ntalzaton, Sesson Descrpton Protocol (SDP) data unt contanng the detals of communcaton protocol, meda and codng formats s a part of the SIP message body. The communcaton protocols for voce and vdeo meda are typcally Real-tme Transport Protocol (RTP) or Secure Real-Tme Transport Protocol (SRTP). Each entty n the network lke user agent, server or vocemal box s dentfed through a Unform Resource Identfer (URI) whose syntax s smlar to the one generally used n web servces (sp:username@domanname). The followng subsectons dscuss some functonal and securty requrements of SIP. These have been detaled n RFC 3261 [88] Functonalty requrements Telephony devces runnng SIP, also known as User Agents (UAs), can be any type of computng devce wth IP networkng capablty. They may also support meda other than voce lke vdeo, text, games etc. Possessng both audo and vsual nterfaces, these devces have the ablty to understand dfferent nternet protocols. The functonal requrements are therefore defned for the followng targets: end users servce provders and network admnstrators manufacturers system ntegrators. The specfed requrements are amed at easng the nstallaton and operaton of SIP enabled devces across features provded by multple vendors. These requrements descrbed n RFC 4504 [93] are as follows.
35 1.2 Sesson ntaton protocol 9 General requrements: The devces should be able to acqure IP network settngs both through manual entry and automatc confguraton through DHCP. IPv6 support must also be present owng to the gradual exhauston of IPv4 addresses and due to the move towards IPv6 n some wreless networks. Devces must be able to locate SIP servers and choose the approprate transport protocol usng DNS. Support for smple network tme protocol ensures that clocks are synchronzed. Upgradng devces to support addtonal functonalty and features should be possble wthout needng specal equpment or applcatons. Emergency support: Apart from supportng emergency landlne numbers, SIP enabled devces should allow for a user to set a prorty header for acceptng calls selectvely. Also, to enable nterrupton of low-prorty communcaton durng emergences, the devces beng used n emergency preparedness must support the resourceprorty header as detaled n RFC 4412 [78]. Mult-lne requrement: As each SIP devce can be regstered wth multple servce provders under dfferent credentals, mult-lne support s requred. Closely resemblng emal clents supportng several malng accounts, ths functonalty necesstates unque credentals (username and password) for each lne. Also, approprate sgnals for call watng and do-not-dsturb must be avalable on a per lne bass. Moblty: Users wth approprate credentals must be able to access servces through any SIP enabled devce rrespectve of devce dentty. For ths, the devces must be able to support credentals of several users. Credentals assocated wth a devce must be stored n ts non-volatle memory. Any other legtmate user accessng through the devce must be provded wth the settngs and features n the proxy and assocated polcy server. Interactve text support: Although nstant messagng s supported by SIP enabled devces, contnuous nteracton through text conversaton mght be preferred as an alternatve to voce due to ts more streamng-lke nature makng t more approprate for real-tme communcaton. Ths allows for voce to be captoned as text n envronments that are nosy or nvolve hearng mpared users. Due to the advantages lke ts mmedacy, effcency and lack of crossed messages problem, text nteracton s preferred durng emergency stuatons as well. Therefore, all SIP devces should have provson to nput and dsplay text. Ether bult-n nterfaces or wred/wreless
36 10 Introducton lnks to connect external nput/dsplay should be provded to facltate the same Securty requrements SIP sgnalng securty has no bearng on the securty of protocols workng n concert wth t and the meda beng transmtted can be encrypted end-to-end once the sesson s establshed. However, snce the sgnalng happens over publc channels, the packets are prone to modfcaton attacks and sessons can be dsrupted by adversares. Some possble attack scenaros have been dscussed below. Regstraton hjackng: The address of record feld n the From and To headers of an SIP message s used to dentfy users. Ths feld can be assessed by a regstrar when a regster message s receved to assess f the request can modfy the assocated contact addresses of the record n the To header feld. Whle the address of record felds n From and To headers are usually dentcal, the felds are dfferent n case a thrd party s dong regstraton on behalf of the users. Malcous regstratons are possble through mpersonaton attacks by modfyng the address of record feld n the From header to mpersonate a trusted regstraton authorty. Snce the trusted thrd party has permsson to modfy contact addresses assocated wth the user t s dong the regstraton for, the attacker can replace tself as the only contact n the user s contact lst. All subsequent requests to the user are then redrected to the attacker. Ths s possble due to the absence of approprate authentcaton mechansms to verfy user dentty. Server mpersonaton: User agents contact servers n a partcular doman whle placng ther requests whch s specfed n the Request-URI. However, the request can be ntercepted by an attacker mpersonatng as the remote server. The response wth approprate SIP header felds and forged contact addresses could redrect the user to nsecure resources or smply deny servce. Ths happens as the users cannot authentcate the remote server. Message tamperng: The requests from user agents to SIP servers are routed through trusted proxes whch are not expected to nspect or modfy the messages. These messages contan senstve nformaton lke sesson keys for establshed communcaton and should not be accessble to doman admnstrators as well. However, malcous proxy servers can perform man-n-the-mddle attack and effect the n-
37 1.3 Objectve of the work 11 tegrty of the message. Therefore, end-to-end securng of message bodes and n some cases, header felds as well s requred to ensure confdentalty and ntegrty. Sesson termnaton: After ntal sgnallng and sesson setup, state of the sesson s contnuously modfed durng subsequent communcaton. An attacker eavesdroppng durng ntalzaton can obtan the sesson parameters. A forged message mpersonatng ether party can then be sent by the attacker to termnate the sesson prematurely. Sender authentcaton s one way to fx ths ssue. The above threats and more securty ssues dscussed n [88] ndcate that confdentalty, ntegrty and authentcaton are requred to mtgate the effects of these vulnerabltes. Preventng message spoofng, replay attacks and ensurng prvacy of enttes s also requred. SIP reuses exstng securty mechansms to acheve these requrements nstead of specfc mechansm beng desgned for t. Although end-to-end encrypton of the entre message ensures ntegrty and confdentalty, t s nfeasble as some header felds need to modfed by ntermedate proxy servers for proper functonng of SIP. Therefore, mplementng securty measures at lower layers s also recommended. For example, Transport Layer Securty (TLS) encrypts sgnalng traffc and ensures confdentalty and ntegrty. Durng TLS negotaton, the enttes can exchange certfcates to establsh mutual authentcaton whch requres possesson of a root certfcate ssued by a trusted certfcate authorty. Other cryptographc authentcaton methods can also be used for dentty verfcaton. An alternatve for SIP URI s the SIPS URI that specfes that the resources must be reached securely. It also mandates the use of TLS to secure communcaton at each hop towards the destnaton. As SIP follows a challenge response mechansm smlar to HTTP, authentcaton smlar to HTTP dgest authentcaton needs to be ncorporated. Also, S/MIME (Secure/Multpurpose Internet Mal Extensons) can be used to encrypt just the meda beng transmtted excludng the headers and thus, t ensures end-to-end ntegrty and mutual authentcaton. 1.3 Objectve of the work Authentcaton s the process of verfyng a clamed dentty. The valdaton method can nvolve multple factors wth the level of securty beng proportonal to the number and type of factors nvolved. In networks, authentcaton s requred to ensure access control. Owng to the dgtal nature of the communcaton envronment, the vulnerabltes
38 12 Introducton nvolved are more challengng. The necessty of mutual authentcaton s especally hghlghted n scenaros where enttes can be deployed remotely, one example beng wreless sensor networks. Furthermore, communcaton channels are susceptble to both passve and actve attacks, and therefore, establshng a secure communcaton mechansm between nvolved partes s also requred. In ths thess, we study the mportance of authentcaton and key agreement n two dfferent network applcatons Internet of Thngs (IoT) and Sesson Intaton Protocol (SIP). 1.4 Summary of contrbutons The contrbutons towards ths thess have been summarzed n the followng subsectons Sgnature-based three-factor authentcated key establshment for future IoT applcatons In ths work, a novel authentcaton and key establshment scheme based on Ellptc Curve Dgtal Sgnature Algorthm (ECDSA) s desgned for securng IoT applcatons. Ths s to ensure authorzed and legtmate access to sensng devce servces and data by a user through a gateway node (GW N). The proposed scheme fulflls the functonalty requrements of IoT applcatons and also has computaton and communcaton costs comparable to exstng Ellptc Curve Cryptography (ECC)-based IoT authentcaton schemes. The proposed scheme also facltates password and bometrc update wthout nvolvng the GW N and allows dynamc addton of sensng devces. Informal and formal securty analyss of the scheme ncludng the smulaton usng the wdely-accepted Automated Valdaton of Internet Securty Protocols and Applcatons (AVISPA) tool [7] show that the scheme s secure aganst varous known attacks. Also, network performance parameters for the scheme have been measured usng the broadly-used NS2 smulator [2, 107] Three-factor authentcaton and key agreement for sesson ntaton protocol We frst revew the prevous authentcaton schemes proposed for SIP and show that the recently proposed Mshra s scheme [70] s vulnerable to some securty attacks and
39 1.5 Organzaton of the thess 13 s also neffcent n password change phase. Snce the attacks aganst Mshra s scheme are mportant, we am to elmnate those attacks by proposng an ECC-based provably secure authentcaton scheme whle keepng low computaton and communcaton costs. A rgorous securty analyss s done formally usng both random oracle model and the wdely-accepted Burrows-Abad-Needham (BAN) logc [11], and formal securty verfcaton s also done usng AVISPA tool to show that the suggested scheme s more secure as compared to Mshra s scheme and other related ECC-based schemes proposed n the lterature. In addton, our scheme works for the password and bometrc update phase by a legal user at any tme wthout nvolvng the server. Furthermore, the proposed scheme supports the moble devce revocaton mechansm n case a legal user loses hs/her devce. 1.5 Organzaton of the thess The organzaton of ths thess s as follows. Chapter 1 gves a bref overvew of authentcaton and dscusses the objectve behnd our research work on authentcaton n IoT and SIP. Chapter 2 dscusses some mathematcal prelmnares used n our work. One-way hash functon has been dscussed brefly. Ellptc Curve Cryptography (ECC) and ts dgtal sgnature algorthm are dscussed next. Fnally, a comparson of ECC and RSA s presented. Chapter 3 presents the exstng related work for authentcaton n IoT and SIP. In Chapter 4, we propose a new sgnature-based authentcaton and key establshment scheme for IoT applcatons. We also show that our scheme provdes better effcency and securty when compared wth some related schemes. In Chapter 5, we propose an effcent three-factor authentcaton and key agreement scheme for SIP based on ECC and prove that the scheme s more secure than some exstng related schemes. Chapter 6 summarzes the thess by hghlghtng the contrbutons and t also dscusses some future research drectons.
40
41 Chapter 2 Mathematcal Prelmnares Ths chapter dscusses some mathematcal prelmnares requred to desgn and analyze the schemes proposed n further chapters. Frst, the propertes of one-way hash functon are dscussed. The use of fuzzy extractors n generatng strong bometrc keys s dscussed next. Then, the ellptc curve cryptosystem and ellptc curve dgtal sgnature algorthm have been descrbed brefly. A comparson of ECC cryptosystem wth the popular publckey RSA cryptosystem n terms of effcency and securty has also been presented. 2.1 One-way hash functon A one-way functon s defned as a functon for whch fndng the nverse of any random nput s computatonally nfeasble. A hash functon s one that produces a fxed length output for any arbtrary length nput. In cryptography, a one-way hash functon s used to produce a dgest or a hash value of a message wth the followng propertes: The output s determnstc, that s, the same dgest s produced for the same message. If the nput message s altered even slghtly, the hash dgest should change sgnfcantly to reduce the probablty of correlaton between the two hash values. Dervng the nput x from the gven hash value y = h(x) and the gven hash functon h( ) s computatonally nfeasble. Ths property s called the one-way property. For any nput x, fndng another nput y such that h(x) = h(y) wth y x, s computatonally nfeasble. Ths property s otherwse known as the weak collson
42 16 Mathematcal Prelmnares resstant property. Identfyng an nput par (x, y) such that h(x) = h(y) where y x, s also computatonally nfeasble. Ths property s otherwse known as the strong collson resstant property. Mathematcally, a one-way hash functon can be defned as follows. Defnton 2.1 (One-way hash functon). A one-way hash functon h: {0, 1} {0, 1} n s an algorthm that takes an arbtrary length bnary strng x {0, 1} as nput, and then outputs a bnary strng of fxed length n, say y {0, 1} n such that y = h(x), where {0, 1} and {0, 1} n denote bnary strngs of 0s and 1s of arbtrary lenth and fxed lengh, n, respectvely. Let Adv(A) HASH (t) denote the advantage that an adversary A has n fndng a hash collson. Then, Adv HASH (A) (t) = P r[(x, x ) R A : x x, h(x) = h(x )], where P r[b] s the probablty of a random event B and the par (x, x ) R A means (x, x ) s selected randomly by A. By an (η, t)-adversary A attackng the collson resstance of h( ), we mean that the runtme of A s at most t and that Adv HASH (A) (t) η. Hash functons can be used n buldng other cryptographc prmtves lke message authentcaton codes and pseudo-random number generators. They also help n verfyng the ntegrty of a message. Snce t s very senstve to even a small varaton n nput, hash dgest can be used to avod storng passwords n cleartext. The Secure Hash Algorthm (SHA) standard has algorthms wth varyng lengths of dgest produced. Of these, the SHA-1 [89] wth a 160-bt hash dgest s the most wdely used n applcatons and protocols lke Secure Socket Layer (SSL). For better securty, SHA-256 s preferred. 2.2 Bomtrecs and fuzzy extractors Bometrc verfcaton allows one to confrm or establsh an ndvdual s dentty. Some advantages of bometrc keys (for example, fngerprnts, faces, rses, hand geometry and palm-prnts, etc.) are gven below (as descrbed n [20, 61]): Bometrc keys can not be lost or forgotten. Bometrc keys are very dffcult to copy or share.
43 2.3 Ellptc curve cryptography 17 Bometrc keys are extremely hard to forge or dstrbute. Bometrc keys can not be guessed easly. Someone s bometrcs s not easy to break than others. As a result, bometrc-based remote user authentcatons are nherently more relable and secure than usual tradtonal password-based remote user authentcaton schemes. As statstcal nformaton regardng bometrc nput s unpredctable, desgnng cryptographc solutons for securng each scenaro s tedous. Convertng bometrc data to unform reproducble random strngs that can for example, be used as a secret key s therefore necessary. Fuzzy extractors are a par of functons where one functon generates the unform random bts from gven nput whle the other recovers the strng from an nput close to the orgnal nput wthn a predefned threshold. Mathematcally, the functon par n a fuzzy extractor s as follows. Gen: It s a probablstc generaton functon that takes as nput the user personal bometrcs Bo, and returns σ {0, 1} l as the bometrc key of length l bts and τ as the publc reproducton parameter. Rep: It s a determnstc functon to be used durng authentcaton. The nput s the user bometrcs, say Bo and τ, provded the Hammng dstance between Bo and the orgnal prevously entered bometrcs Bo s less than t, where t s an error tolerance threshold value. The output s the orgnal bometrc key σ, that s, σ = Rep(Bo, τ). 2.3 Ellptc curve cryptography Ths secton dscusses ellptc curve propertes and ts applcaton n cryptography Ellptc curve over a fnte feld Suppose a,b Z p, where Z p = {0, 1,..., p 1} and p > 3 s a prme. A non-sngular ellptc curve y 2 = x 3 + ax + b over the fnte feld GF (p) s the set E p (a, b) of solutons (x, y) Z p Z p to the congruence y 2 x 3 + ax + b (mod p),
44 18 Mathematcal Prelmnares where a,b Z p such that 4a b 2 0 (mod p), and a pont at nfnty or zero pont O. Note that 4a b 2 0 (mod p) s a necessary and suffcent condton to ensure a non-sngular soluton for the equaton x 3 + ax + b = 0 [71]. 4a b 2 = 0 (mod p) mples the ellptc curve s sngular. Let P = (x P, y P ), Q = (x Q, y Q ) E p (a, b). Then x Q = x P and y Q = y P when P +Q = O. Also, P +O = O +P = P, for all P E p (a, b). Hasse s theorem states that the number of ponts on E p (a, b), denoted as #E, satsfes the followng nequalty [54]: p p #E p p. In other words, there are about p ponts on an ellptc curve E p (a, b) over Z p. E p (a, b) forms a commutatve or an abelan group under addton modulo p operaton. Also, Ellptc curve pont addton Let P, Q E p (a, b) be two ponts on the ellptc curve. Then, R = (x R, y R ) = P + Q s calculated as follows [54]: where λ = x R = (λ 2 x P x Q ) y R = (λ(x P x R ) y P ) { yq y P x Q x P (mod p), (mod p), (mod p), f P Q 3x P 2 +a 2y P (mod p), f P = Q. Ellptc curve pont scalar multplcaton In ECC, multplcaton s done as repeated addtons. For example, 5P = P + P + P + P + P, where P E p (a, b) ECC encrypton and decrypton The plantext s frst encoded nto a pont on the ellptc curve, P m E p (a, b). Every user chooses a prvate-publc key par such that prvate key d Zp and the publc key s calculated as e = d.g where Zp = {1, 2,..., p 1} and G s a base pont on E p (a, b). The encrypton and decrypton methods explaned further are then appled on ths pont as follows. ECC encrypton: The user selects a random number l Zp. The correspondng cpher text C m for the plan text P m s a par of ponts C 1 and C 2, that s, C m = (C 1, C 2 ) where C 1 = l.g and C 2 = P m + l.e. Here, l s the random number chosen by the sender and e s the publc key of the recever. C m s then sent to the recever.
45 2.3 Ellptc curve cryptography 19 ECC decrypton: To retreve the plan-text P m, the recever computes C 2 (d.c 1 ) = (P m + l.e) (d.(l.g)) = P m + l.e l.e = P m. Here, d and e are the prvate and publc key of the recever, respectvely. Snce the random number l s secret to the sender, an adversary retrevng P m from C m s mpossble due to the ellptc curve dscrete logarthm problem (ECDLP) whch has been defned as follows. Defnton 2.2 (Ellptc curve dscrete logarthm problem (ECDLP)). For any two ponts P and Q belongng to ellptc curve E p (a, b), and for some postve nteger k such that Q = k.p, t s computatonally nfeasble to derve k f P and Q are known for a large prme p n polynomal tme. Here k s the scalar called the dscrete logarthm and k.p = P + P + + P (k tmes) s known as ECC pont or scalar multplcaton Ellptc curve dgtal sgnature Dgtal sgnatures are used to authentcate messages or dgtal documents whle ensurng non-repudaton and ntegrty. The sgnature algorthms employ asymmetrc or publc key cryptography technques and consst of three phases: 1) key generaton, 2) sgnature generaton and 3) sgnature verfcaton. Ellptc curve dgtal sgnature algorthm (ECDSA) s one such varant of the orgnal dgtal sgnature algorthm and t s phases have been explaned below. Key generaton: Frst, the system s setup by choosng an ellptc curve E p (a, b) and ts base pont G. Then, every entty chooses ts prvate key d Zp and computes ts correspondng publc key as e = d.g. Sgnature generaton: Consder an entty wth parameters E p (a, b), h( ), e, G, p where h( ) s a collson-resstant hash functon. Suppose m s the message to be sgned. Usng ts key par (d, e) and a chosen random number k Zp, the entty computes the sgnature as follows: k.g = (x 1, y 1 ), c = h(m), r = x 1 (mod p), s = l 1 (c + d.r) (mod p). If ether r = 0 or s = 0, the algorthm restarts. Otherwse, (r,s) s the sgnature of the sender for message m. The sgner then sends the sgned message m, (r, s) to the verfer.
Two-Factor User Authentication in Multi-Server Networks
Internatonal Journal of ecurty and Its Applcatons Vol. 6, No., Aprl, 0 Two-Factor ser Authentcaton n Mult-erver Networks Chun-Ta L, Ch-Yao Weng,* and Chun-I Fan Department of Informaton Management, Tanan
More informationNew Remote Mutual Authentication Scheme using Smart Cards
141 152 New Remote Mutual Authentcaton Scheme usng Smart Cards Rajaram Ramasamy*, Amutha Prabakar Munyand** * Thagarajar College of Engneerng, Madura, Taml Nadu 625 015, Inda E mal: rrajaram@tce.edu **
More informationSecurity Enhanced Dynamic ID based Remote User Authentication Scheme for Multi-Server Environments
Internatonal Journal of u- and e- ervce, cence and Technology Vol8, o 7 0), pp7-6 http://dxdoorg/07/unesst087 ecurty Enhanced Dynamc ID based Remote ser Authentcaton cheme for ult-erver Envronments Jun-ub
More informationAn Improved User Authentication and Key Agreement Scheme Providing User Anonymity
35 JOURNAL OF ELECTRONIC SCIENCE AND TECHNOLOGY, VOL. 9, NO. 4, DECEMBER 0 An Improved User Authentcaton and Key Agreement Scheme Provdng User Anonymty Ya-Fen Chang and Pe-Yu Chang Abstract When accessng
More informationRelated-Mode Attacks on CTR Encryption Mode
Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory
More informationSecurity Vulnerabilities of an Enhanced Remote User Authentication Scheme
Contemporary Engneerng Scences, Vol. 7, 2014, no. 26, 1475-1482 HIKARI Ltd, www.m-hkar.com http://dx.do.org/10.12988/ces.2014.49186 Securty Vulnerabltes of an Enhanced Remote User Authentcaton Scheme Hae-Soon
More informationImprovement ofmanik et al. s remote user authentication scheme
Improvement ofmank et al. s remote user authentcaton scheme Abstract Jue-Sam Chou, a,yaln Chen b Jyun-Yu Ln c a Department of Informaton Management, Nanhua Unversty Chay, 622, Tawan schou@mal.nhu.edu.tw
More informationUser Authentication Based On Behavioral Mouse Dynamics Biometrics
User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA
More informationPrivate Information Retrieval (PIR)
2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stock-market
More informationEvaluation of an Enhanced Scheme for High-level Nested Network Mobility
IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October 2015 1 Evaluaton of an Enhanced Scheme for Hgh-level Nested Network Moblty Mohammed Babker Al Mohammed, Asha Hassan.
More informationA Secure Dynamic Identity Based Authentication Protocol with Smart Cards for Multi-Server Architecture
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 31, 1975-1992 (2015) A Secure Dynamc Identty Based Authentcaton Protocol wth Smart Cards for Mult-Server Archtecture CHUN-TA LI 1, CHENG-CHI LEE 2;3,*, CHI-YAO
More informationSolution Brief: Creating a Secure Base in a Virtual World
Soluton Bref: Creatng a Secure Base n a Vrtual World Soluton Bref: Creatng a Secure Base n a Vrtual World Abstract The adopton rate of Vrtual Machnes has exploded at most organzatons, drven by the mproved
More informationSimulation Based Analysis of FAST TCP using OMNET++
Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months
More informationWishing you all a Total Quality New Year!
Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma
More informationWeaknesses of a dynamic ID-based remote user authentication. He Debiao*, Chen Jianhua, Hu Jin
Weaknesses of a dynamc -based remote user authentcaton scheme He Debao, Chen anhua, Hu n School of Mathematcs Statstcs, Wuhan nversty, Wuhan, Hube 430072, Chna Abstract: he securty of a password authentcaton
More informationFor instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)
Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationA new remote user authentication scheme for multi-server architecture
Future Generaton Computer Systems 19 (2003) 13 22 A new remote user authentcaton scheme for mult-server archtecture Iuon-Chang Ln a, Mn-Shang Hwang b,, L-Hua L b a Department of Computer Scence and Informaton
More informationDistributed Secret Key Management Based on ECC for Ad-hoc Network Yi-xuan WU, Hua-wei CHEN * and Lei WANG
2017 2nd Internatonal Conference on Computer, Network Securty and Communcaton Engneerng (CNSCE 2017) ISBN: 978-1-60595-439-4 Dstrbuted Secret Key Management Based on ECC for Ad-hoc Network Y-xuan WU, Hua-we
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More informationAn enhanced dynamic-id-based remote user authentication protocol with smart card
Internatonal Journal of Engneerng Advanced Research Technology (IJEART) ISSN: 2454-9290 Volume-2 Issue-4 Aprl 206 An enhanced dynamc-id-based remote user authentcaton protocol wth smart card aoran Chen
More informationA software agent enabled biometric security algorithm for secure file access in consumer storage devices
A software agent enabled bometrc securty algorthm for secure fle access n consumer storage devces Artcle Accepted Verson Amn, R., Sherratt, R. S., Gr, D., Islam, S. K. H. and Khan, M. K. (2017) A software
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationVirtual Machine Migration based on Trust Measurement of Computer Node
Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on
More informationPrivacy Models for RFID Authentication Protocols
Prvacy Models for RFID Authentcaton Protocols Jan Shen 1,2, Jn Wang 1,2, Yuan Me 1,2, Ilyong Chung 3 1 Jangsu Engneerng Center of Network Montorng, Nanjng Unversty of Informaton Scence &echnology, Nanjng,210044,Chna
More informationVRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) ,
VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual
More informationIP Camera Configuration Software Instruction Manual
IP Camera 9483 - Confguraton Software Instructon Manual VBD 612-4 (10.14) Dear Customer, Wth your purchase of ths IP Camera, you have chosen a qualty product manufactured by RADEMACHER. Thank you for the
More informationWightman. Mobility. Quick Reference Guide THIS SPACE INTENTIONALLY LEFT BLANK
Wghtman Moblty Quck Reference Gude THIS SPACE INTENTIONALLY LEFT BLANK WIGHTMAN MOBILITY BASICS How to Set Up Your Vocemal 1. On your phone s dal screen, press and hold 1 to access your vocemal. If your
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationHybrid Non-Blind Color Image Watermarking
Hybrd Non-Blnd Color Image Watermarkng Ms C.N.Sujatha 1, Dr. P. Satyanarayana 2 1 Assocate Professor, Dept. of ECE, SNIST, Yamnampet, Ghatkesar Hyderabad-501301, Telangana 2 Professor, Dept. of ECE, AITS,
More informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More informationConstructing Minimum Connected Dominating Set: Algorithmic approach
Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected
More informationOverview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION
Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup
More informationarxiv: v1 [cs.cr] 20 Jun 2013
arxv:306.4726v [cs.cr] 20 Jun 203 A secure and effectve anonymous authentcaton scheme for roamng servce n global moblty networks Dawe Zhao a,b Hapeng Peng a,b Lxang L a,b Yxan Yang a,b a Informaton Securty
More informationVideo Proxy System for a Large-scale VOD System (DINA)
Vdeo Proxy System for a Large-scale VOD System (DINA) KWUN-CHUNG CHAN #, KWOK-WAI CHEUNG *# #Department of Informaton Engneerng *Centre of Innovaton and Technology The Chnese Unversty of Hong Kong SHATIN,
More informationConcurrent Apriori Data Mining Algorithms
Concurrent Apror Data Mnng Algorthms Vassl Halatchev Department of Electrcal Engneerng and Computer Scence York Unversty, Toronto October 8, 2015 Outlne Why t s mportant Introducton to Assocaton Rule Mnng
More informationEfficient Distributed File System (EDFS)
Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate
More informationResearch Article. ISSN (Print) s k and. d k rate of k -th flow, source node and
Scholars Journal of Engneerng and Technology (SJET) Sch. J. Eng. Tech., 2015; 3(4A):343-350 Scholars Academc and Scentfc Publsher (An Internatonal Publsher for Academc and Scentfc Resources) www.saspublsher.com
More informationAn efficient biometrics-based authentication scheme for telecare medicine information systems
Zuowen Tan Jangx Unversty of Fnance & Economcs An effcent bometrcs-based authentcaton scheme for telecare medcne nformaton systems Abstract. The telecare medcal nformaton system enables the patents gan
More informationTECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.
TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of
More informationA Time-Bound Ticket-Based Mutual Authentication Scheme for Cloud Computing
Int. J. of Computers, Communcatons & Control, ISSN 1841-9836, E-ISSN 1841-9844 Vol. VI (2011), No. 2 (June), pp. 227-235 A Tme-Bound Tcket-Based Mutual Authentcaton Scheme for Cloud Computng Z. Hao, S.
More informationReducing Frame Rate for Object Tracking
Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg
More informationAdvanced radio access solutions for the new 5G requirements
Advanced rado access solutons for the new 5G requrements Soumaya Hamouda Assocate Professor, Unversty of Carthage Tuns, Tunsa Soumaya.hamouda@supcom.tn IEEE Summt 5G n Future Afrca. May 3 th, 2017 Pretora,
More informationAnalysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
More informationPRÉSENTATIONS DE PROJETS
PRÉSENTATIONS DE PROJETS Rex Onlne (V. Atanasu) What s Rex? Rex s an onlne browser for collectons of wrtten documents [1]. Asde ths core functon t has however many other applcatons that make t nterestng
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationarxiv: v1 [cs.cr] 28 May 2013
arxv:1305.6350v1 [cs.cr] 28 May 2013 An effcent dynamc ID based remote user authentcaton scheme usng self-certfed publc keys for mult-server envronment Dawe Zhao ab Hapeng Peng ab Shudong L c Yxan Yang
More informationAssembler. Building a Modern Computer From First Principles.
Assembler Buldng a Modern Computer From Frst Prncples www.nand2tetrs.org Elements of Computng Systems, Nsan & Schocken, MIT Press, www.nand2tetrs.org, Chapter 6: Assembler slde Where we are at: Human Thought
More informationTime-Assisted Authentication Protocol
Tme-Asssted Authentcaton Protocol 1 Muhammad Blal Unversty of Scence and Technology, Korea Electroncs and Telecommuncaton Research Insttute, Rep. of Korea mblal@etr.re.kr, engr.mblal@yahoo.com 2 Shn-Gak
More informationOracle Database: SQL and PL/SQL Fundamentals Certification Course
Oracle Database: SQL and PL/SQL Fundamentals Certfcaton Course 1 Duraton: 5 Days (30 hours) What you wll learn: Ths Oracle Database: SQL and PL/SQL Fundamentals tranng delvers the fundamentals of SQL and
More informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More informationLoad-Balanced Anycast Routing
Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationHOMOMORPHIC ENCRYPTION SCHEMES: STEPS TO IMPROVE THE PROFICIENCY
HOMOMORPHIC ENCRYPTION SCHEMES: STEPS TO IMPROVE THE PROFICIENCY Pallav 1 Masters n Technology, School of Future Studes and Plannng, DAVV, Indore (Inda) ABSTRACT Homomorphc encrypton schemes are malleable
More informationTsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance
Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for
More informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationGoals and Approach Type of Resources Allocation Models Shared Non-shared Not in this Lecture In this Lecture
Goals and Approach CS 194: Dstrbuted Systems Resource Allocaton Goal: acheve predcable performances Three steps: 1) Estmate applcaton s resource needs (not n ths lecture) 2) Admsson control 3) Resource
More informationArray transposition in CUDA shared memory
Array transposton n CUDA shared memory Mke Gles February 19, 2014 Abstract Ths short note s nspred by some code wrtten by Jeremy Appleyard for the transposton of data through shared memory. I had some
More informationDEAR: A DEVICE AND ENERGY AWARE ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS
DEAR: A DEVICE AND ENERGY AWARE ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS Arun Avudanayagam Yuguang Fang Wenjng Lou Department of Electrcal and Computer Engneerng Unversty of Florda Ganesvlle, FL 3261
More informationParallel matrix-vector multiplication
Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
More informationInternet Traffic Managers
Internet Traffc Managers Ibrahm Matta matta@cs.bu.edu www.cs.bu.edu/faculty/matta Computer Scence Department Boston Unversty Boston, MA 225 Jont work wth members of the WING group: Azer Bestavros, John
More informationResearch and Application of Fingerprint Recognition Based on MATLAB
Send Orders for Reprnts to reprnts@benthamscence.ae The Open Automaton and Control Systems Journal, 205, 7, 07-07 Open Access Research and Applcaton of Fngerprnt Recognton Based on MATLAB Nng Lu* Department
More informationA New Token Allocation Algorithm for TCP Traffic in Diffserv Network
A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network S. Sudha and N. Ammasagounden Natonal Insttute of Technology, Truchrappall,
More informationLecture - Data Encryption Standard 4
The Data Encrypton Standard For an encrypton algorthm we requre: secrecy of the key and not of the algorthm tself s the only thng that s needed to ensure the prvacy of the data the best cryptographc algorthms
More informationSteps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices
Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between
More informationOracle Database: 12c Administrator
Oracle Database: 12c Admnstrator 1 Duraton: 5 Days (30 hours) What you wll learn: Ths Oracle Database: SQL and PL/SQL Fundamentals tranng delvers the fundamentals of SQL and PL/SQL along wth the benefts
More informationData Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach
Data Representaton n Dgtal Desgn, a Sngle Converson Equaton and a Formal Languages Approach Hassan Farhat Unversty of Nebraska at Omaha Abstract- In the study of data representaton n dgtal desgn and computer
More informationType-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data
Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES
More informationAdvanced Computer Networks
Char of Network Archtectures and Servces Department of Informatcs Techncal Unversty of Munch Note: Durng the attendance check a stcker contanng a unque QR code wll be put on ths exam. Ths QR code contans
More informationFAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks
2017 2nd Internatonal Semnar on Appled Physcs, Optoelectroncs and Photoncs (APOP 2017) ISBN: 978-1-60595-522-3 FAHP and Modfed GRA Based Network Selecton n Heterogeneous Wreless Networks Xaohan DU, Zhqng
More informationNetwork Coding as a Dynamical System
Network Codng as a Dynamcal System Narayan B. Mandayam IEEE Dstngushed Lecture (jont work wth Dan Zhang and a Su) Department of Electrcal and Computer Engneerng Rutgers Unversty Outlne. Introducton 2.
More informationMeta-heuristics for Multidimensional Knapsack Problems
2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationProper Choice of Data Used for the Estimation of Datum Transformation Parameters
Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and
More informationImproving Low Density Parity Check Codes Over the Erasure Channel. The Nelder Mead Downhill Simplex Method. Scott Stransky
Improvng Low Densty Party Check Codes Over the Erasure Channel The Nelder Mead Downhll Smplex Method Scott Stransky Programmng n conjuncton wth: Bors Cukalovc 18.413 Fnal Project Sprng 2004 Page 1 Abstract
More informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More informationTerm Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task
Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto
More informationAnalysis of Collaborative Distributed Admission Control in x Networks
1 Analyss of Collaboratve Dstrbuted Admsson Control n 82.11x Networks Thnh Nguyen, Member, IEEE, Ken Nguyen, Member, IEEE, Lnha He, Member, IEEE, Abstract Wth the recent surge of wreless home networks,
More informationScheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research
Schedulng Remote Access to Scentfc Instruments n Cybernfrastructure for Educaton and Research Je Yn 1, Junwe Cao 2,3,*, Yuexuan Wang 4, Lanchen Lu 1,3 and Cheng Wu 1,3 1 Natonal CIMS Engneerng and Research
More informationA MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS
Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung
More informationkccvoip.com basic voip training NAT/PAT extract 2008
kccvop.com basc vop tranng NAT/PAT extract 28 As we have seen n the prevous sldes, SIP and H2 both use addressng nsde ther packets to rely nformaton. Thnk of an envelope where we place the addresses of
More informationNotes on Organizing Java Code: Packages, Visibility, and Scope
Notes on Organzng Java Code: Packages, Vsblty, and Scope CS 112 Wayne Snyder Java programmng n large measure s a process of defnng enttes (.e., packages, classes, methods, or felds) by name and then usng
More informationReal-time Motion Capture System Using One Video Camera Based on Color and Edge Distribution
Real-tme Moton Capture System Usng One Vdeo Camera Based on Color and Edge Dstrbuton YOSHIAKI AKAZAWA, YOSHIHIRO OKADA, AND KOICHI NIIJIMA Graduate School of Informaton Scence and Electrcal Engneerng,
More informationResearch of Dynamic Access to Cloud Database Based on Improved Pheromone Algorithm
, pp.197-202 http://dx.do.org/10.14257/dta.2016.9.5.20 Research of Dynamc Access to Cloud Database Based on Improved Pheromone Algorthm Yongqang L 1 and Jn Pan 2 1 (Software Technology Vocatonal College,
More informationSecurity analysis and design of an efficient ECC-based two-factor password authentication scheme
SECURITY ND COMMUNICTION NETWORKS Securty Comm. Networks 2016; 9:4166 4181 Publshed onlne 24 ugust 2016 n Wley Onlne Lbrary (wleyonlnelbrary.com)..1596 RESERCH RTICLE Securty analyss and desgn of an effcent
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationARTICLE IN PRESS. Signal Processing: Image Communication
Sgnal Processng: Image Communcaton 23 (2008) 754 768 Contents lsts avalable at ScenceDrect Sgnal Processng: Image Communcaton journal homepage: www.elsever.com/locate/mage Dstrbuted meda rate allocaton
More informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationEnhanced Watermarking Technique for Color Images using Visual Cryptography
Informaton Assurance and Securty Letters 1 (2010) 024-028 Enhanced Watermarkng Technque for Color Images usng Vsual Cryptography Enas F. Al rawashdeh 1, Rawan I.Zaghloul 2 1 Balqa Appled Unversty, MIS
More informationA New Security Model for Cross-Realm C2C-PAKE Protocol
A New Securty Model for Cross-Realm C2C-PAKE Protocol Fengao Wang 1 Yuqng Zhang Natonal Computer Network Intruson Protecton Center, GSCAS, Beng, 100043 Abstract. Cross realm clent-to-clent password authentcated
More informationHYMN: AN INTEREST-BASED MULTIMEDIA PROVIDING SYSTEM FOR HYBRID WIRELESS NETWORKS
HYMN: AN INTEREST-BASED MULTIMEDIA PROVIDING SYSTEM FOR HYBRID WIRELESS NETWORKS Adran Andronache 1 ), Matthas R. Brust 2 ), Steffen Rothkugel 3 ) Abstract The concept of self-organzaton already exsts
More informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
More informationRisk-Based Packet Routing for Privacy and Compliance-Preserving SDN
Rsk-Based Packet Routng for Prvacy and Complance-Preservng SDN Karan K. Budhraja Abhshek Malvankar Mehd Bahram Chnmay Kundu Ashsh Kundu Mukesh Snghal, Unversty of Maryland, Baltmore County, MD, USA Emal:
More informationFast Retransmission of Real-Time Traffic in HIPERLAN/2 Systems
Fast Retransmsson of Real-Tme Traffc n HIPERLAN/ Systems José A Afonso and Joaqum E Neves Department of Industral Electroncs Unversty of Mnho, Campus de Azurém 4800-058 Gumarães, Portugal {joseafonso,
More informationBandwidth Allocation for Service Level Agreement Aware Ethernet Passive Optical Networks
Bandwdth Allocaton for Servce Level Agreement Aware Ethernet Passve Optcal Networks Dawd Nowak Performance Engneerng Laboratory School of Electronc Engneerng Dubln Cty Unversty Emal: nowakd@eengdcue Phlp
More informationAADL : about scheduling analysis
AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng
More information