Filters








1,394,650 Hits in 6.4 sec

Model–Based Testing of Cryptographic Protocols [chapter]

Dean Rosenzweig, Davor Runje, Wolfram Schulte
2005 Lecture Notes in Computer Science  
states of the model are safe, and also to check conformance of an arbitrary .NET implementation to the model.  ...  Modeling is a popular way of representing the behavior of a system. A very useful type of model in computing is an abstract state machine which describes transitions over first order structures.  ...  For every e-term t there is an e-term t 0 in which decrypt, fst and snd do not occur and t 0 . = t.  ... 
doi:10.1007/11580850_4 fatcat:tmpjwr3uuvfvxcd7bwxldvcify

CSMR: A Scalable Algorithm for Text Clustering with Cosine Similarity and MapReduce [chapter]

Giannakouris-Salalidis Victor, Plerou Antonia, Sioutas Spyros
2014 IFIP Advances in Information and Communication Technology  
The research approach is mainly focused on the MapReduce paradigm, a model for processing large data-sets in parallel manner, with a distributed algorithm on computer clusters.  ...  In this paper a method for pairwise text similarity on massive data-sets, using the Cosine Similarity metric and the tf-idf (Term Frequency-Inverse Document Frequency) normalization method is proposed.  ...  Vector Space Model Vector Space Model is an algebraic model for representing text documents as vectors.  ... 
doi:10.1007/978-3-662-44722-2_23 fatcat:6ap3drsb7fa2zn66mogbvhmqia

A Model for Information Retrieval Agent System Based on Keywords Distribution

Jae-Woo LEE
2007 2007 International Conference on Multimedia and Ubiquitous Engineering (MUE'07)  
for search meaningful terms in a document.  ...  In this paper, we propose a simple new model for information retrieval agents based on many terms or keywords distribution in a document or distributed database.  ...  In our proposed model for information retrieval agents, we used an idea that an important keyword in documents is distributed partly in each paragraph.  ... 
doi:10.1109/mue.2007.25 dblp:conf/mue/Lee07b fatcat:rmbk6y3hlve3njgs5ang2vnqxm

The Notary Based PKI [chapter]

Martín A. G. Vigil, Cristian T. Moecke, Ricardo F. Custódio, Melanie Volkamer
2013 Lecture Notes in Computer Science  
We propose a new Public Key Infrastructure model for longterm signatures. It is based on X.509 and the real world of handwritten signatures.  ...  The benefits for signed document users are: i) the maintenance of a document signature is simple and only necessary to prevent the obsolescence of cryptographic algorithms; ii) the overhead to store and  ...  We thank Johannes Braun and Daniel Cabarcas for the useful discussions, and the anonymous reviewers for their comments that helped to improve the final version of this paper.  ... 
doi:10.1007/978-3-642-40012-4_6 fatcat:njlfqmbahfdetgp46ztxhhnw3y

Formally based semi-automatic implementation of an open security protocol

Alfredo Pironti, Davide Pozza, Riccardo Sisto
2012 Journal of Systems and Software  
This case study demonstrates that the adopted model-driven approach is viable even for a real security protocol, despite the complexity of the models needed in order to achieve an interoperable implementation  ...  This paper presents an experiment in which an implementation of the client side of the SSH Transport Layer Protocol (SSH-TLP) was semi-automatically derived according to a model-driven development paradigm  ...  Acknowledgments We would like to thank Bruno Blanchet for his valuable support in the verification phase of our case study.  ... 
doi:10.1016/j.jss.2011.10.052 fatcat:mkmmbplh3raipe75bf23ko3gfu

Towards Automated Secure Web Service Execution [chapter]

Béla Genge, Piroska Haller
2009 Lecture Notes in Computer Science  
The correctness of the proposed model is ensured by using a set of rules and algorithms for generating it based on a protocol model given by the user.  ...  The proposed model consists of a sequential component, implemented as a WSDL-S specification, and an ontology component, implemented as an OWL specification.  ...  For example, the following rules define the algorithm type and key for an encrypted term that must be processed or constructed: c ∈ (Knowledge) s e E SYM (c) p ← a gid(propr), hasSymmAlg (c) p ← r {p}  ... 
doi:10.1007/978-3-642-01399-7_74 fatcat:ueqofhixyrh73bbnh2mj3mjyfm

Automatic Key Term Extraction from Research Article using Hybrid Approach

Selvani Deepthi, B. Rajesh, N. Vyshnavi, K. Moni
2017 International Journal of Computer Applications  
Key terms are subset of terms or phrases from an article that can describe the meaning of the article.  ...  In our information era, key information terms are very useful for information retrieval, article retrieval, article clustering, summarization, text mining, and text clustering and so on.  ...  Key information terms enable readers to decide whether an article is relevant for them or not.  ... 
doi:10.5120/ijca2017914039 fatcat:plf4fjqnxrhf7j45h4ov36z64e

Evaluating the Behavior of Aluminum Corrosion in Hydrochloric Acid in the Presence Aqueous Extract of Olive Seeds
english

Aisha M. Al-Turkustani, Khadijah M. Emran
2015 International Journal of Innovative Research in Science, Engineering and Technology  
algorithm.  ...  This paper provide a comparative study between various encryption algorithm like AES, DES, RSA and DIFFIE-HELLMAN .Here we compare the different factors of both symmetric key and asymmetric key encryption  ...  Fig . 1 A 1 Simple Cryptography Model Fig. 2 A 2 Simple Symmetric Key Cryptography Model Fig. 3 A 3 Simple Asymmetric Key Cryptography Model  ... 
doi:10.15680/ijirset.2015.0403042 fatcat:fjk33kwa6fbtpbktiexfdnwdhu

Middleware for Automated Implementation of Security Protocols [chapter]

Béla Genge, Piroska Haller
2009 Lecture Notes in Computer Science  
Specifications are generated using a set of rules, where information related to the implementation of properties such as cryptographic algorithms or key sizes, are provided by the user.  ...  ontology component, implemented as an OWL specification.  ...  For example, the following rules define the algorithm type and key for an encrypted term that must be processed or constructed: c ∈ (ReceivedT erm) s e p ∈ (c) p (p) nm = isDecrypted c ← a (p) c E SYM  ... 
doi:10.1007/978-3-642-02121-3_36 fatcat:mh4s6sglurawlmv6lqph7rvhsq

Domain Model Discovery from Textbooks for Computer Programming Intelligent Tutors

Rabin Banjade, Priti Oli, Lasang Jimba Tamang, Jeevan Chapagain, Vasile Rus
2021 Proceedings of the ... International Florida Artificial Intelligence Research Society Conference  
Specifically, we conduct our work in the context of developing an intelligent tutoring system for source code comprehension for which a specification of the key programming concepts is needed - the system  ...  We present a novel approach to intro-to-programming domain model discovery from textbooks using an over-generation and ranking strategy.  ...  Acknowledgement This work has been supported by two NSF awards: the Learner Data Institute (NSF; award 1934745) and CSEdPad: Investigating and Scaffolding Students' Mental Models during Computer Programming  ... 
doi:10.32473/flairs.v34i1.128561 fatcat:fifmygzysvgqpfvs6fwlqqmwve

Towards Scalable Summarization of Consumer Videos Via Sparse Dictionary Selection

Yang Cong, Junsong Yuan, Jiebo Luo
2012 IEEE transactions on multimedia  
Our method provides a scalable solution for both key frame extraction and video skim generation, because one can select an arbitrary number of key frames to represent the original videos.  ...  An efficient global optimization algorithm is introduced to solve the dictionary selection model with the convergence rates as (where is the iteration counter), in contrast to traditional sub-gradient  ...  In [14] , an intelligent key frame extraction method is developed for video printing.  ... 
doi:10.1109/tmm.2011.2166951 fatcat:2kxgq42azjbl5oztgag36nvj5q

Optimal Key Handover Management for Enhancing Security in Mobile Network

V. Suma, Wang Haoxiang
2021 Journal of Trends in Computer Science and Smart Technology  
The 3GPP long term Evolution or System Architecture Evolution (LTE/SAE) was designed for the dispositioning of the mobile networks towards 4G.  ...  The analysis and model simulations intend to disclose the influence of the period of root key upgrade on integral operational levels such as constellation and user experience.  ...  The model permits the deliverance of an unmodified term key that allows the eNodeB in the target to recognize the term key used by the eNodeB in the source [4] .  ... 
doi:10.36548/jtcsst.2020.4.002 fatcat:pxl4twqjufczxhk2oiy6c5m5xi

A novel multi-user fingerprint minutiae based encryption and integrity verification for cloud data

Ruth Ramya Kalangi, M. V. P. Chandra Sekhara Rao
2018 International Journal of Advanced Computer Research  
This model is efficient in comparison to the traditional models in terms of encryption and decryption time and data size.  ...  MFM-CP-ABE model considers fingerprints of multiple users as attributes for encryption and also calculates integrity value.  ...  The extracted features are used for integrity value computation using an ICP-ABE encryption algorithm.  ... 
doi:10.19101/ijacr.2018.837010 fatcat:7enllfupxvhe5fkjtis6iyxycy

On the leakage-resilient key exchange

Janaka Alawatugoda
2017 Journal of Mathematical Cryptology  
This paper combines and extends the advances of security modelling for AKE protocols addressing more granular partial leakage of long-term secrets of protocol participants.  ...  AbstractTypically, secure channels are constructed from an authenticated key exchange (AKE) protocol, which authenticates the communicating parties based on long-term public keys and establishes secret  ...  Acknowledgment: I would like to acknowledge Douglas Stebila, Colin Boyd and Tatsuaki Okamoto for numerous discussions on key exchange protocols and leakage-resilient cryptography.  ... 
doi:10.1515/jmc-2016-0003 fatcat:rfvikx5v2rhehhwebgdb4aiv5q

Checking Secrecy by Means of Partial Order Reduction [chapter]

Cas J. F. Cremers, Sjouke Mauw
2005 Lecture Notes in Computer Science  
We propose a partial order reduction for model checking security protocols for the secrecy property.  ...  Based on this reduction we develop an automatic tool that can check security protocols for secrecy, given a finite execution scenario. We compare this tool to several other tools.  ...  Acknowledgments We thank Erik de Vink for the discussions on security protocol semantics and Ingmar Schnitzler for programming a prototype implementation of our model checking algorithm.  ... 
doi:10.1007/978-3-540-31810-1_12 fatcat:hzsx2v3e55fnzmgafhstnphmke
« Previous Showing results 1 — 15 out of 1,394,650 results