ECFS

2012 ◽  
Vol 6 (2) ◽  
pp. 53-63 ◽  
Author(s):  
U. S. Rawat ◽  
Shishir Kumar
Keyword(s):  
File System ◽  
User Authentication ◽  
File Systems ◽  
Public Key Cryptography ◽  
File Sharing ◽  
Public Key ◽  
Kernel Space ◽  
Access Control List ◽  
Secure Protocol ◽  
And Performance

Proposed is a secure and efficient approach for designing and implementing an enterprise-class cryptographic file system for Linux (ECFS) in kernel-space. It uses stackable file system interface to introduce a layer for encrypting files using symmetric keys, and public-key cryptography for user authentication and file sharing, like other existing enterprise-class cryptographic file systems. It differs itself from existing systems by including all public-key cryptographic operations and public-key infrastructure (PKI) support in kernel-space that protects it from attacks that may take place with a user-space PKI support. It has a narrower domain of trust than existing systems. It uses XTS mode of AES algorithm for file encryption for providing better protection and performance. It also uses kernel-keyring service for improving performance. It stores the cryptographic metadata in file’s access control list (ACL) as extended attributes to ease the task of file sharing. A secure protocol has also been designed and implemented to guard against various possible attacks, when its files are accessed remotely over an untrusted network.

SO-AODV

2021 ◽  
Vol 14 (3) ◽  
pp. 87-103
Author(s):  
Karan Singh ◽  
Rajeev Gupta
Keyword(s):  
Disaster Response ◽  
Ad Hoc ◽  
Public Key Cryptography ◽  
Public Key ◽  
Ad Hoc Routing ◽  
Hop Count ◽  
Ad Hoc Routing Protocol ◽  
Emergency Rescue ◽  
Shortest Route ◽  
And Performance

MANET has emerged as an eager field for supporting disaster response and prevention applications like climate and weather observation, tracking, tsunamis, wildfire and emergency rescue operations, underwater level navigation, etc. In this paper, a new ad-hoc routing protocol named SO-AODV (Secured and Optimized Ad-Hoc On-Demand Distance Vector) is proposed for secured and optimized communication in any disaster like situations. For shortest route selection a technique called pigeons swarm optimization (PiSO) is used that also leads to minimize the hop count in selected optimal route. Lightweight digital watermarking (LDW) is used that ensures the authenticity of “hello” packets. For security of event messages, cyphertext stealing technique (CST) is used with encryption qu-Vanstone elliptic curve cryptography (qV-ECC) based public key cryptography. The qV-ECC generates public key. Experiments are conducted using NS2 and performance is evaluated and compared over AODV for several metrics (i.e., packet delivery ration, throughput, end-to-end delay, security, and hop count).

PARTIALLY BLIND SIGNATURES BASED ON QUANTUM CRYPTOGRAPHY

2012 ◽  
Vol 26 (30) ◽  
pp. 1250163 ◽  
Author(s):  
XIAO-QIU CAI ◽  
HUI-FANG NIU
Keyword(s):  
Quantum Mechanics ◽  
Public Key Cryptography ◽  
Blind Signature ◽  
Public Key ◽  
Signature Scheme ◽  
Common Information ◽  
Fundamental Properties ◽  
Blind Signatures ◽  
Partially Blind Signature ◽  
And Performance

In a partially blind signature scheme, the signer explicitly includes pre-agreed common information in the blind signature, which can improve the availability and performance. We present a new partially blind signature scheme based on fundamental properties of quantum mechanics. In addition, we analyze the security of this scheme, and show it is not possible to forge valid partially blind signatures. Moreover, the comparisons between this scheme and those based on public-key cryptography are also discussed.

Analisis dan Implementasi Protokol Otentikasi FIDO U2F

2017 ◽  
Vol 9 (1) ◽  
pp. 30-35
Author(s):  
Sunderi Pranata ◽  
Hargyo Tri Nugroho ◽  
Hirofumi Yamaki
Keyword(s):  
Public Key Cryptography ◽  
Authentication Protocol ◽  
Public Key ◽  
Next Generation ◽  
Index Terms ◽  
Mitm Attack

It is known that password itself is not enough for formidable authentication method since it has a lot of vulnerabilities. Multi factor authentication (MFA) is introduced for the next generation for good authentication to address that issue. MFA combines two or more of three principles of good security, “something you know”, “something you have”, and “something you are”. Most MFA mechanisms work as one time passwords (OTP). However, they can still be vulnerable to phishing and MiTM attack. On top of that, OTP can be hard to use as it requires user to input another password given by the device (SMS, token, authenticator). Implemented in small USB U2F device, FIDO U2F delivers easier yet stronger security on authentication process which implements public key cryptography, challenge-response protocol, and phishing and MitM protection.  Index Terms— Authentication protocol, FIDO U2F, Multi factor authentication, OTP

Certificateless Mult-i receiver Signcryption Scheme Based on Multivariate Public Key Cryptography

2012 ◽  
Vol 35 (9) ◽  
pp. 1881 ◽  
Author(s):  
Hui-Xian LI ◽  
Xu-Bao CHEN ◽  
Liao-Jun PANG ◽  
Yu-Min WANG
Keyword(s):  
Public Key Cryptography ◽  
Public Key ◽  
Multivariate Public Key ◽  
Signcryption Scheme

IMPLEMENTASI ALGORITMA SCHMIDT-SAMOA PADA ENKRIPSI DEKRIPSI EMAIL BERBASIS ANDROID

2013 ◽  
Vol 9 (1) ◽  
Author(s):  
Willy Ristanto ◽  
Willy Sudiarto Raharjo ◽  
Antonius Rachmat Chrismanto
Keyword(s):  
Public Key Cryptography ◽  
Text Messages ◽  
Public Key ◽  
Client Application ◽  
Performance Measurements ◽  
Encryption And Decryption ◽  
Number Variation

Cryptography is a technique for sending secret messages. This research builds an Android-based email client application which implement cryptography with Schmidt-Samoa algorithm, which is classified as a public key cryptography. The algorithm performs encryption and decryption based on exponential and modulus operation on text messages. The application use 512 and 1024 bit keys. Performance measurements is done using text messages with character number variation of 5 – 10.000 characters to obtain the time used for encryption and decryption process. As a result of this research, 99,074% data show that decryption process is faster than encryption process. In 512 bit keys, the system can perform encryption process in 520 - 18.256 miliseconds, and decryption process in 487 - 5.688 miliseconds. In 1024 bit keys, system can perform encryption process in 5626 – 52,142 miliseconds (7.388 times slower than 512 bit keys) and decryption process with time 5463 – 15,808 miliseconds or 8.290 times slower than 512 bit keys.

Sign in / Sign up

Export Citation Format

Share Document