Electronic payment systems for e-commerce
- D. O'Mahony, M. Peirce, H. Tewari
- Computer Science
- 2001
A comparison of Electronic Payment Systems using the iKP Micropayment Protocol and the FSTC Electronic Check Project shows that the former is more secure than the latter and the latter is less secure.
Real-time intrusion detection for ad hoc networks
- I. Stamouli, P. Argyroudis, H. Tewari
- Computer ScienceSixth IEEE International Symposium on a World of…
- 13 June 2005
RIDAN is a novel architecture that uses knowledge-based intrusion detection techniques to detect, in real-time, attacks that an adversary can perform against the routing fabric of a mobile ad hoc network.
Homomorphic Encryption with Access Policies: Characterization and New Constructions
- Michael Clear, Arthur P. Hughes, H. Tewari
- Mathematics, Computer ScienceInternational Conference on Cryptology in Africa
- 5 February 2013
The main construction is an XOR-homomorphic IBE scheme based on the quadratic residuosity problem (variant of the Cocks’ scheme), which is shown to be strongly homomorphic and achieved anonymity for a weaker notion of homomorphic encryption, which is called non-universal.
Performance analysis of cryptographic protocols on handheld devices
- P. Argyroudis, Raja Verma, H. Tewari, D. O'Mahony
- Computer ScienceThird IEEE International Symposium on Network…
- 30 August 2004
A performance analysis focused on three of the most commonly used security protocols for networking applications, namely SSL, S/MIME and IPsec shows that the time taken to perform cryptographic functions is small enough not to significantly impact real-time mobile transactions and that there is no obstacle to the use of quite sophisticated cryptographic protocols on handheld mobile devices.
Anonymous IBE from Quadratic Residuosity with Improved Performance
- Michael Clear, H. Tewari, C. McGoldrick
- Computer Science, MathematicsInternational Conference on Cryptology in Africa
- 28 May 2014
This paper presents a new universally-anonymous IBE scheme based on the quadratic residuosity problem that has better performance than the universally anonymous scheme from Ateniese and Gasti (CT-RSA 2009) at the expense of more ciphertext expansion.
Multiparty micropayments for ad hoc networks
- H. Tewari, D. O'Mahony
- Computer ScienceIEEE Wireless Communications and Networking…
- 20 March 2003
This paper presents a lightweight payment scheme based on hash chains, which allows a node to pay others who relay packets on its behalf in real-time, due to the dynamic nature of an ad hoc network.
The Future of E-Voting
- H. Tewari, Pavel Tarasov
- Computer Science
- 2017
The proposed protocol offers anonymity of voter transactions, while keeping the transactions private, and the election transparent and secure, and is based on a protocol developed on blockchain technology.
Reusable Off-line Electronic Cash Using Secret Splitting
- H. Tewari, D. O'Mahony, M. Peirce
- Computer Science
- 1998
A new scheme based on secret splitting is proposed that allows for off-line spending of coins with a tailored level of anonymity and allowing reuse of the same coin many times.
Progressive Authentication in Ad Hoc Networks
- Raja Verma, D. O'Mahony, H. Tewari, Raja Verma, Donal. Omahony, H. Tewari
- Computer Science
- 2003
A twotier key formation scheme is proposed to ensure the confidentiality of the trust negotiation process and to secure the communication paths.
Lightweight AAA for Cellular IP
- H. Tewari, D. O'Mahony
- Computer Science
- 2001
A lightweight AAA scheme for micro mobility based architectures which makes use of hash chain trees for efficient storage of hash values and fast authentication of datagrams is presented.
...
...