Multi-Party Micro-Payment for Mobile Commerce

2011 ◽  
pp. 214-235
Author(s):  
Jianming Zhu ◽  
Jianfeng Ma
Keyword(s):  
Transaction Costs ◽  
Hash Function ◽  
Public Key Cryptography ◽  
Mobile Commerce ◽  
Mobile User ◽  
Public Key ◽  
Good Efficiency ◽  
Payment Scheme ◽  
Financial Transactions

This chapter introduces a new micro-payment scheme that is able to apply to multi-party for mobile commerce, which allows a mobile user to pay every party involved in providing services. The micro-payment, which refers to low-value financial transactions ranging from several cents to a few dollars, is an important technique in m-commerce. Our scheme is based on the hash function and without any additional communication and expensive public key cryptography in order to achieve good efficiency and low transaction costs. In the scheme, the mobile user releases an ongoing stream of low-valued micro-payment tokens into the network in exchange for the requested services. The scheme that is put forward satisfies the requirements for security, anonymity, efficiency and lightweight.

Multi-Party Micro-Payment for Mobile Commerce

2011 ◽  
pp. 307-323
Author(s):  
Jianming Zhu ◽  
Jianfeng Ma
Keyword(s):  
Transaction Costs ◽  
Hash Function ◽  
Public Key Cryptography ◽  
Mobile Commerce ◽  
Mobile User ◽  
Public Key ◽  
Good Efficiency ◽  
Payment Scheme ◽  
Financial Transactions

This chapter introduces a new micro-payment scheme that is able to apply to multi-party for mobile commerce, which allows a mobile user to pay every party involved in providing services. The micro-payment, which refers to low-value financial transactions ranging from several cents to a few dollars, is an important technique in m-commerce. Our scheme is based on the hash function and without any additional communication and expensive public key cryptography in order to achieve good efficiency and low transaction costs. In the scheme, the mobile user releases an ongoing stream of low-valued micro-payment tokens into the network in exchange for the requested services. The scheme that is put forward satisfies the requirements for security, anonymity, efficiency and lightweight.

scholarly journals PKDIP: Efficient Public-Key-Based Data Integrity Protection for Wireless Image Sensors

2015 ◽  
Vol 2015 ◽  
pp. 1-9
Author(s):  
Changsheng Wan ◽  
Juan Zhang ◽  
Jie Huang
Keyword(s):  
Hash Function ◽  
Data Integrity ◽  
Public Key Cryptography ◽  
Image Sensors ◽  
Public Key ◽  
Authentication Codes ◽  
Security Issue ◽  
Shared Secret ◽  
Protection Mechanisms ◽  
Integrity Protection

Due to limited energy of “wireless image sensors (WISs),” existing data integrity protection mechanisms typically employ a hash-function-based signing algorithm to generate “message authentication codes (MACs)” for long image frames. However, hash-function-based signing algorithm requires the WIS and the “end user (EU)” sharing a secret, which leads to a new security issue: Once the EU becomes malicious due to some reasons, it will be able to forge the WIS’s data since it holds the shared secret. Therefore, public-key cryptography is desirable. Unfortunately, public-key cryptographic operations are quite time-consuming for energy-restrained WISs. Facing this dilemma, we present a novel data integrity protection protocol named PKDIP in this paper. Similar to the mechanisms of this field, PKDIP generates MACs for data integrity protection. However, different from other well-known approaches, PKDIP introduces the “Montgomery Modular Multiplication (MontMM)” technique to current public-key-based signing algorithms. Since MontMM is much more efficient than hash functions, PKDIP can reduce the signing cost significantly. Experimental results show PKDIP can even be more efficient than hash-function-based schemes.

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

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