| 1. |
- Babaheidarian, Parisa, et al.
(författare)
-
Simultanously Generating Multiple keys in a Four-Terminal Network
- 2012
-
Ingår i: IET Information Security. - : Institution of Engineering and Technology (IET). - 1751-8709 .- 1751-8717. ; 6:3, s. 190-201
-
Tidskriftsartikel (refereegranskat)abstract
- A source model including four terminals is considered, where three simultaneously generating three types of keys are intended. Terminals 1, 2 and 3 wish to share a common key, the secret key, which should be kept secret from terminal 4 and simultaneously terminals 1 and 2 intend to share a private key with terminal 3, which should be kept secret from each other. Also, all the keys should be concealed from terminal 4 (the external wiretapper). The authors assume that all terminals including the external wiretapper have access to distinct correlated i.i.d. sources; there is also a noiseless public channel with unlimited capacity among the terminals. The authors have investigated the model on two scenarios of key sharing depending on the direction of the public channel. Rate regions of the keys are derived. It is shown that in some special cases the inner and outer bounds of the capacity regions coincide and the capacity regions are derived.
|
|
| 2. |
- Fiore, Dario, et al.
(författare)
-
Multi-key homomorphic authenticators
- 2019
-
Ingår i: IET Information Security. - : Institution of Engineering and Technology (IET). - 1751-8717 .- 1751-8709. ; 13:6, s. 618-638
-
Tidskriftsartikel (refereegranskat)abstract
- Homomorphic authenticators (HAs) enable a client to authenticate a large collection of data elements m1, …, mt and outsource them, along with the corresponding authenticators, to an untrusted server. At any later point, the server can generate a short authenticator σf, y vouching for the correctness of the output y of a function f computed on the outsourced data, i.e. y = f(m1, …, mt). The notion of HAs studied so far, however, only supports executions of computations over data authenticated by a single user. Motivated by realistic scenarios in which large datasets include data provided by multiple users, we study the concept of multi-key homomorphic authenticators. In a nutshell, multi-key HAs are like HAs with the extra feature of allowing the holder of public evaluation keys to compute on data authenticated under different secret keys. In this paper, we introduce and formally define multi-key HAs. Secondly, we propose a construction of a multi-key homomorphic signature based on standard lattices and supporting the evaluation of circuits of bounded polynomial depth. Thirdly, we provide a construction of multi-key homomorphic MACs based only on pseudorandom functions and supporting the evaluation of low-degree arithmetic circuits. © The Institution of Engineering and Technology 2019
|
|
| 3. |
- Hell, Martin, et al.
(författare)
-
Cryptanalysis of Achterbahn-128/80
- 2007
-
Ingår i: IET Information Security. - : Institution of Engineering and Technology (IET). - 1751-8717 .- 1751-8709. ; 1:2, s. 47-52
-
Tidskriftsartikel (refereegranskat)abstract
- A key recovery attack on the stream cipher Achterbahn-128/80, a cipher in the second phase of eSTREAM, is given. The key observation is a high dependency between some input bits to the Boolean combining function generating the keystream. It results in the first known attacks on both the 128-bit and the 80-bit variants of the cipher. The number of keystream bits required in the attacks is less than 264, the maximum frame length.
|
|
| 4. |
- Huang, Xin, et al.
(författare)
-
Human interactive secure key and ID exchange protocols in body sensor networks
- 2013
-
Ingår i: IET Information Security. - 1751-8709 .- 1751-8717. ; 7:1, s. 30-38
-
Tidskriftsartikel (refereegranskat)abstract
- A body sensor network (BSN) is typically a wearable wireless sensor network. Security protection is critical to BSNs, since they collect sensitive personal information. Generally speaking, security protection of BSN relies on identity (ID) and key distribution protocols. Most existing protocols are designed to run in general wireless sensor networks, and are not suitable for BSNs. After carefully examining the characteristics of BSNs, the authors propose human interactive empirical channel-based security protocols, which include an elliptic curve Diffie–Hellman version of symmetric hash commitment before knowledge protocol and an elliptic curve Diffie–Hellman version of hash commitment before knowledge protocol. Using these protocols, dynamically distributing keys and IDs become possible. As opposite to present solutions, these protocols do not need any pre-deployment of keys or secrets. Therefore compromised and expired keys or IDs can be easily changed. These protocols exploit human users as temporary trusted third parties. The authors, thus, show that the human interactive channels can help them to design secure BSNs.
|
|
| 5. |
- Huang, Xin, et al.
(författare)
-
Human interactive secure key and ID exchange protocols in body sensor networks
- 2013
-
Ingår i: IET Information Security. - : Institution of Engineering and Technology. - 1751-8709 .- 1751-8717. ; 7:1, s. 30-38
-
Tidskriftsartikel (refereegranskat)abstract
- A body sensor network (BSN) is typically a wearable wireless sensor network. Security protection is critical to BSNs, since they collect sensitive personal information. Generally speaking, security protection of BSN relies on identity (ID) and key distribution protocols. Most existing protocols are designed to run in general wireless sensor networks, and are not suitable for BSNs. After carefully examining the characteristics of BSNs, the authors propose human interactive empirical channel-based security protocols, which include an elliptic curve Diffie–Hellman version of symmetric hash commitment before knowledge protocol and an elliptic curve Diffie–Hellman version of hash commitment before knowledge protocol. Using these protocols, dynamically distributing keys and IDs become possible. As opposite to present solutions, these protocols do not need any pre-deployment of keys or secrets. Therefore compromised and expired keys or IDs can be easily changed. These protocols exploit human users as temporary trusted third parties. The authors, thus, show that the human interactive channels can help them to design secure BSNs.
|
|
| 6. |
- Koochak Shooshtari, Masoumeh, et al.
(författare)
-
Cryptanalysis of McEliece cryptosystem variants based on quasi-cyclic low-density parity check codes
- 2016
-
Ingår i: IET Information Security. - : Institution of Engineering and Technology (IET). - 1751-8709 .- 1751-8717. ; 10:4, s. 194-202
-
Tidskriftsartikel (refereegranskat)abstract
- One of the approaches to modify the McEliece cryptosystem to overcome its large key size is replacing binary Goppa codes with a new structured code. However, this modification makes such cryptosystems encounter some new attacks. There are a few modified McEliece cryptosystem variants which are known to be secure. One of them is the cryptosystem introduced by Baldi et al. which uses quasi-cyclic low-density parity check (QC-LDPC) codes. This cryptosystem is still unbroken as no efficient attack has been reported against it since 2008. In this study, an attack has been applied to this cryptosystem which is feasible when the code length is a multiple of a power of 2. Also an important weakness of this kind of cryptosystem has been pointed out, namely utilising a too low-weight intentional error vector. The authors have established a new security level for this cryptosystem which is applicable to other McEliece-like cryptosystems using QC-LDPC codes. This security level for instance is 29.18 times lower than previous ones in the case of n = 4 x 4096 when only one ciphertext is available. The gain of the attack in this study can be increased if more than one ciphertext is available.
|
|
| 7. |
- Li, Shimin, et al.
(författare)
-
Homomorphic signcryption with public plaintext-result checkability
- 2021
-
Ingår i: IET Information Security. - : Institution of Engineering and Technology (IET). - 1751-8717 .- 1751-8709. ; 15:5, s. 333-350
-
Tidskriftsartikel (refereegranskat)abstract
- Signcryption originally proposed by Zheng (CRYPTO ' 97) is a useful cryptographic primitive that provides strong confidentiality and integrity guarantees. This article addresses the question whether it is possible to homomorphically compute arbitrary functions on signcrypted data. The answer is affirmative and a new cryptographic primitive, homomorphic signcryption (HSC) with public plaintext-result checkability is proposed that allows both to evaluate arbitrary functions over signcrypted data and makes it possible for anyone to publicly test whether a given ciphertext is the signcryption of the message under the key. Two notions of message privacy are also investigated: weak message privacy and message privacy depending on whether the original signcryptions used in the evaluation are disclosed or not. More precisely, the contributions are two-fold: (i) two different definitions of HSC with public plaintext-result checkability is provided for arbitrary functions in terms of syntax, unforgeability and message privacy depending on if the homomorphic computation is performed in a private or in a public evaluation setting, (ii) two HSC constructions are proposed: one for a public evaluation setting and another for a private evaluation setting and security is formally proved.
|
|
| 8. |
- Wang, Q., et al.
(författare)
-
Some results on fast algebraic attacks and higher-order non-linearities
- 2012
-
Ingår i: IET Information Security. - : Institution of Engineering and Technology (IET). - 1751-8717 .- 1751-8709. ; 6:1, s. 41-46
-
Tidskriftsartikel (refereegranskat)abstract
- In this study, the authors investigate the resistance of Boolean functions against fast algebraic attacks and deduce a bound between fast algebraic immunity and higher-order non-linearity (it is the first time that a bound between these two cryptographic criteria is given). The authors then show that the fast algebraic immunity of the following two classes of Boolean functions is not good: (a) The repaired functions of the Tu-Deng function proposed by Carlet. The Tu-Deng function has optimum algebraic degree, optimum algebraic immunity and a very good non-linearity. However, it is weak against fast algebraic attacks. Carlet found this weakness and also tried to repair it. (b) An infinite class of balanced functions proposed by Tang et al., having optimum algebraic degree, optimum algebraic immunity and a very high non-linearity.
|
|
| 9. |
- Fatemi, Mitra, et al.
(författare)
-
Anonymous Roaming in UMTS Mobile Networks
- 2010
-
Ingår i: IET information security. - : Institution of Engineering and Technology (IET). - 1751-8709. ; 4:2, s. 93-103
-
Tidskriftsartikel (refereegranskat)abstract
- A secure roaming protocol for mobile networks is proposed. Roaming has been analysed in some schemes from the security point of view; however, there are vulnerabilities in most of them and so the claimed security level is not achieved. The scheme offered by Wan et al. recently is based on hierarchical identity-based encryption, in which the roaming user and the foreign network mutually authenticate each other without the help of the home network. Although the idea behind this proposal is interesting, it contradicts technical considerations such as routing and billing. The proposed protocol makes use of similar functions used in Wan et al.'s scheme but contributes a distinguished structure that overcomes the previous shortcomings and achieves a higher possible level of security in mobile roaming as well as enhancing the security of the key issuing procedure.
|
|
| 10. |
- Ågren, Martin, et al.
(författare)
-
On Hardware-Oriented Message Authentication
- 2012
-
Ingår i: IET Information Security. - 1751-8717. ; 6:4, s. 329-336
-
Tidskriftsartikel (refereegranskat)abstract
- We consider hardware-oriented message authentication, more specifically universal hash functions. We propose a new type of constructions that appear promising. These constructions are based on the framework of universal hash functions, Toeplitz matrices and epsilon-biased sample spaces. Some new theoretical results in this area are derived. The new constructions come at the price of not being able to prove the exact substitution probability. The expected probability is examined both through theoretical methods as well as through simulation.
|
|
