Most recent issue published online in the International Journal of Applied Cryptography.
International Journal of Applied Cryptography
http://www.inderscience.com/browse/index.php?journalID=233&year=2022&vol=4&issue=2
Inderscience Publishers Ltd
en-uk
support@inderscience.com
International Journal of Applied Cryptography
1753-0563
1753-0571
© 2023 Inderscience Enterprises Ltd.
© 2022 Inderscience Publishers Ltd
editor@inderscience.com
International Journal of Applied Cryptography
https://www.inderscience.com/images/files/coverImgs/ijact_scoverijact.jpg
http://www.inderscience.com/browse/index.php?journalID=233&year=2022&vol=4&issue=2
-
A reduction-based proof for authentication and session key security in three-party Kerberos
http://www.inderscience.com/link.php?id=130832
The Kerberos network security protocol provides authentication between clients and servers with the assistance of trusted servers and remains widely used. We give a reduction-based security showing that the mandatory three-party mode of Kerberos authentication and key establishment is a secure authentication protocol under standard assumptions on its encryption scheme; our results can be lifted to apply to quantum adversaries as well. As for many other real-world key exchange protocols, session key indistinguishability cannot be proven for Kerberos since the session key is used in the protocol itself, breaking indistinguishability. We can however show that Kerberos' optional sub-session mode yields secure session keys, and that the hash of the main session key is secure in Krawczyk's generalization of the authenticated and confidential channel establishment model.
A reduction-based proof for authentication and session key security in three-party Kerberos
Jörg Schwenk; Douglas Stebila
International Journal of Applied Cryptography, Vol. 4, No. 2 (2022) pp. 61 - 84
The Kerberos network security protocol provides authentication between clients and servers with the assistance of trusted servers and remains widely used. We give a reduction-based security showing that the mandatory three-party mode of Kerberos authentication and key establishment is a secure authentication protocol under standard assumptions on its encryption scheme; our results can be lifted to apply to quantum adversaries as well. As for many other real-world key exchange protocols, session key indistinguishability cannot be proven for Kerberos since the session key is used in the protocol itself, breaking indistinguishability. We can however show that Kerberos' optional sub-session mode yields secure session keys, and that the hash of the main session key is secure in Krawczyk's generalization of the authenticated and confidential channel establishment model.]]>
10.1504/IJACT.2022.130832
International Journal of Applied Cryptography, Vol. 4, No. 2 (2022) pp. 61 - 84
Jörg Schwenk
Douglas Stebila
Horst Görtz Institute for IT Security, Ruhr University Bochum, Germany ' University of Waterloo, Waterloo, Ontario, Canada
key exchange
authentication
Kerberos
2023-05-12T23:20:50-05:00
Copyright © 2023 Inderscience Enterprises Ltd.
4
2
61
84
2023-05-12T23:20:50-05:00
-
End-to-end verifiable cumulative voting without tallying authorities
http://www.inderscience.com/link.php?id=130833
In this paper, we propose the first end-to-end (E2E) verifiable e-voting system for cumulative voting without requiring any tallying authorities. To our knowledge, none of the existing e-voting systems implemented for cumulative voting are end-to-end verifiable; if there is any bug or tampering at the tallying software, the tally would be inadvertently modified without any voter noticing this. Although there are existing voting systems (e.g., mix-net-based) that could be adapted to support cumulative voting with E2E verifiability, they generally require a set of tallying authorities, which can lead to substantial complexity of finding and managing such authorities in practice. We address this issue by adopting novel cryptographic techniques to achieve E2E verifiability for cumulative voting, but without involving any tallying authorities. We formally define a model to prove the security of our system, and present the efficiency analysis to show that our proposed solution is feasible for practical use.
End-to-end verifiable cumulative voting without tallying authorities
Samiran Bag; Muhammad Ajmal Azad; Feng Hao
International Journal of Applied Cryptography, Vol. 4, No. 2 (2022) pp. 85 - 103
In this paper, we propose the first end-to-end (E2E) verifiable e-voting system for cumulative voting without requiring any tallying authorities. To our knowledge, none of the existing e-voting systems implemented for cumulative voting are end-to-end verifiable; if there is any bug or tampering at the tallying software, the tally would be inadvertently modified without any voter noticing this. Although there are existing voting systems (e.g., mix-net-based) that could be adapted to support cumulative voting with E2E verifiability, they generally require a set of tallying authorities, which can lead to substantial complexity of finding and managing such authorities in practice. We address this issue by adopting novel cryptographic techniques to achieve E2E verifiability for cumulative voting, but without involving any tallying authorities. We formally define a model to prove the security of our system, and present the efficiency analysis to show that our proposed solution is feasible for practical use.]]>
10.1504/IJACT.2022.130833
International Journal of Applied Cryptography, Vol. 4, No. 2 (2022) pp. 85 - 103
Samiran Bag
Muhammad Ajmal Azad
Feng Hao
Department of Computer Science, University of Warwick, Coventry, UK ' College of Science and Engineering, University of Derby, Derby, UK ' Department of Computer Science, University of Warwick, Coventry, UK
end-to-end verifiability
verifiable e-voting
cumulative voting
provable security
receipt-freeness
2023-05-12T23:20:50-05:00
Copyright © 2023 Inderscience Enterprises Ltd.
4
2
85
103
2023-05-12T23:20:50-05:00
-
Authority revocation scheme for MA-CP-ABE-based secure communication in IoMT ecosystem
http://www.inderscience.com/link.php?id=130846
The proliferation of the internet of medical things (IoMT) is proving to be a disruptive technology in contemporary healthcare. However, given the sensitivity of the nature of data being shared in this system security, and privacy are critical issues. Attribute-based encryption is a proactive technique for efficient one-to-many data sharing. Specifically, multi-authority-ciphertext policy-attribute-based encryption (MA-CP-ABE) is a suitable method given the multi-stakeholder ecosystem of IoMT-based healthcare. In this work, conventional MA-CP-ABE techniques have been modified to address several existing security limitations. To the best of our knowledge, the proposed work is first to address fault tolerance in MA-CP-ABE, without any redundancy at attribute authority's level and to develop a mechanism for full and partial revocation of compromised authority. A non-monotonic fully hidden access structure further enhances the security of the scheme while efficiently performing encryption/decryption operations even for a large number of attributes, making it suitable for the secure sharing of IoMT data.
Authority revocation scheme for MA-CP-ABE-based secure communication in IoMT ecosystem
Shardha Porwal; Sangeeta Mittal
International Journal of Applied Cryptography, Vol. 4, No. 2 (2022) pp. 104 - 120
The proliferation of the internet of medical things (IoMT) is proving to be a disruptive technology in contemporary healthcare. However, given the sensitivity of the nature of data being shared in this system security, and privacy are critical issues. Attribute-based encryption is a proactive technique for efficient one-to-many data sharing. Specifically, multi-authority-ciphertext policy-attribute-based encryption (MA-CP-ABE) is a suitable method given the multi-stakeholder ecosystem of IoMT-based healthcare. In this work, conventional MA-CP-ABE techniques have been modified to address several existing security limitations. To the best of our knowledge, the proposed work is first to address fault tolerance in MA-CP-ABE, without any redundancy at attribute authority's level and to develop a mechanism for full and partial revocation of compromised authority. A non-monotonic fully hidden access structure further enhances the security of the scheme while efficiently performing encryption/decryption operations even for a large number of attributes, making it suitable for the secure sharing of IoMT data.]]>
10.1504/IJACT.2022.130846
International Journal of Applied Cryptography, Vol. 4, No. 2 (2022) pp. 104 - 120
Shardha Porwal
Sangeeta Mittal
Department of Computer Science and Engineering and IT, Jaypee Institute of Information Technology, A-10, Sector-62, Noida †201301, India ' Department of Computer Science and Engineering and IT, Jaypee Institute of Information Technology, A-10, Sector-62, Noida †201301, India
key escrow free MA-CP-ABE
attribute revocation
attribute authority revocation
attribute assignment
fault tolerance
internet of medical things
IoMT
2023-05-12T23:20:50-05:00
Copyright © 2023 Inderscience Enterprises Ltd.
4
2
104
120
2023-05-12T23:20:50-05:00
-
A novel architecture to make anonymous blind signature-based e-coins more efficient and applicable
http://www.inderscience.com/link.php?id=130847
Blind signature-based (BSB) e-coins are powerful tools that provide anonymity and privacy protection in e-networks. We propose a novel architecture, comprising of a novel voucher-based blind signature scheme and database efficiency algorithm, for BSB e-coins. We find that our architecture reduces the data burden of the double spending detection database of any BSB e-coin system by at least 49.793598% and upwards to a negligible data burden when more ideal deposit patterns are facilitated, and increases BSB e-coin system scalability by causing operational costs per unit of time to increase much slower than growth in the size of the e-coin ecosystem in a growing BSB e-coin network. Our architecture if implemented can immediately reduce the cost of BSB e-coin networks in applications such as anonymised healthcare donor funding networks, anonymised voting, anonymous subscriptions, and ecommerce networks, among many others, and makes large-scale BSB e-coin systems much cheaper and more applicable.
A novel architecture to make anonymous blind signature-based e-coins more efficient and applicable
Zhuo Qi Chen
International Journal of Applied Cryptography, Vol. 4, No. 2 (2022) pp. 121 - 142
Blind signature-based (BSB) e-coins are powerful tools that provide anonymity and privacy protection in e-networks. We propose a novel architecture, comprising of a novel voucher-based blind signature scheme and database efficiency algorithm, for BSB e-coins. We find that our architecture reduces the data burden of the double spending detection database of any BSB e-coin system by at least 49.793598% and upwards to a negligible data burden when more ideal deposit patterns are facilitated, and increases BSB e-coin system scalability by causing operational costs per unit of time to increase much slower than growth in the size of the e-coin ecosystem in a growing BSB e-coin network. Our architecture if implemented can immediately reduce the cost of BSB e-coin networks in applications such as anonymised healthcare donor funding networks, anonymised voting, anonymous subscriptions, and ecommerce networks, among many others, and makes large-scale BSB e-coin systems much cheaper and more applicable.]]>
10.1504/IJACT.2022.130847
International Journal of Applied Cryptography, Vol. 4, No. 2 (2022) pp. 121 - 142
Shardha Porwal
Sangeeta Mittal
Academy of Science and Technology, 3701 College Park Drive, The Woodlands, TX, USA
blind signature-based e-coins
e-coin efficiency
voucher-based blind signature system
range-based e-coin system efficiency protocol
double spending detection database efficiency
anonymity
sensitive data fields applications
e-commerce
anonymous subscriptions
anonymous health donor networks
anonymous voting
applied cryptography
2023-05-12T23:20:50-05:00
Copyright © 2023 Inderscience Enterprises Ltd.
4
2
121
142
2023-05-12T23:20:50-05:00