
Previous Article
On cyclefree lattices with high rate label codes
 AMC Home
 This Issue

Next Article
Efficient list decoding of a class of algebraicgeometry codes
On the generic construction of identitybased signatures with additional properties
1.  University of Luxembourg, L1359, Luxembourg 
2.  Dept. Matemàtica Aplicada IV, Universitat Politècnica de Catalunya, Barcelona, 08034, Spain 
3.  RuhrUniversity Bochum, Bochum, D44780, Germany 
Using wellknown results for standard signature schemes, we conclude that explicit identitybased signature schemes with additional properties can be constructed, enjoying sometimes better properties than specific schemes proposed until now. In particular, our work implies the existence of identitybased signatures with additional properties that are provably secure in the standard model, do not need bilinear pairings, or can be based on general assumptions.
References:
[1] 
, IEEE P1363.3:, Standard for identitybased cryptographic techniques using pairings., (). 
[2] 
M. Abdalla, C. Namprempre and G. Neven, On the (im)possibility of blind message authentication codes,, in, (2006), 262. 
[3] 
M. Abe and E. Fujisaki, How to date blind signatures,, in, (1996), 244. 
[4] 
M. Abe and T. Okamoto, Provably secure partially blind signatures,, in, (2000), 271. 
[5] 
J. H. Ahn, M. Green and S. Hohenberger, Synchronized aggregate signatures: neew definitions, constructions and applications,, in, (2010). 
[6] 
S. S. AlRiyami and K. G. Paterson, Certificateless public key cryptography,, in, (2003), 452. 
[7] 
G. Ateniese and B. De Medeiros, Identitybased chameleon hash and applications,, in, (2004), 164. 
[8] 
J. Baek and Y. Zheng, Identitybased threshold signature scheme from the bilinear pairings,, in, (2004), 124. 
[9] 
M. Bellare and S. K. Miner, A forwardsecure digital signature scheme,, in, (1999), 431. 
[10] 
M. Bellare, C. Namprempre and G. Neven, Security proofs for identitybased identification and signature schemes,, Journal of Cryptology, 22 (2009), 1. doi: 10.1007/s0014500890288. 
[11] 
M. Bellare, C. Namprempre, D. Pointcheval and M. Semanko, The onemorersainversion problems and the security of chaum's blind signature scheme,, Journal of Cryptology, 16 (2003), 185. doi: 10.1007/s0014500201201. 
[12] 
M. Bellare and P. Rogaway, Random oracles are practical: a paradigm for designing efficient protocols,, in, (1993), 62. 
[13] 
A. Boldyreva, Threshold signatures, multisignatures and blind signatures based on the gapdiffiehellmangroup signature scheme,, in, (2002), 31. 
[14] 
A. Boldyreva, C. Gentry, A. O'Neill and D. H. Yum, Ordered multisignatures and identitybased sequential aggregate signatures, with applications to secure routing,, in, (2007), 276. 
[15] 
A. Boldyreva, A. Palacio, and B. Warinschi, Secure proxy signature schemes for delegation of signing rights,, Technical report, (). 
[16] 
D. Boneh and X. Boyen, Short signatures without random oracles and the SDH assumption in bilinear groups,, Journal of Cryptology, 21 (2008), 149. doi: 10.1007/s0014500790057. 
[17] 
D. Boneh and M. K. Franklin, Identity based encryption from the Weil pairing,, SIAM Journal on Computing, 32 (2003), 586. doi: 10.1137/S0097539701398521. 
[18] 
D. Boneh, C. Gentry, B. Lynn and H. Shacham, Aggregate and verifiably encrypted signatures from bilinear maps,, in, (2003), 416. 
[19] 
D. Boneh, B. Lynn and H. Shacham, Short signatures from the Weil pairing,, Journal of Cryptology, 17 (2004), 297. doi: 10.1007/s0014500403149. 
[20] 
J. Camenisch, M. Koprowski and B. Warinschi, Efficient blind signatures without random oracles,, in, (2004), 134. 
[21] 
R. Canneti, O. Goldreich and S. Halevi, The random oracle methodology, revisited,, Journal of the ACM, 51 (2004), 557. doi: 10.1145/1008731.1008734. 
[22] 
D. Chaum, Blind signatures for untraceable payments,, in, (1983), 199. 
[23] 
D. Chaum, Designated confirmer signatures,, in, (1995), 86. 
[24] 
D. Chaum and H. Van Antwerpen, Undeniable signatures,, in, (1989), 212. 
[25] 
X. Cheng, J. Liu and X. Wang, An identitybased signature and its threshold version,, in, (2005), 973. 
[26] 
X. Cheng, J. Liu and X. Wang, Identitybased aggregate and verifiably encrypted signatures from bilinear pairing,, in, (2005), 1046. 
[27] 
S. S. M. Chow, L. C. K. Hui, S. M Yiu and K. P. Chow, Two improved partially blind signature schemes from bilinear pairings,, in, (2005), 316. 
[28] 
I. Damgard, N. Fazio and A. Nicolosi, Noninteractive zeroknowledge from homomorphic encryption,, in, (2006), 41. 
[29] 
I. Damgard and T. P. Pedersen, New convertible undeniable signature schemes,, in, (1996), 372. 
[30] 
Y. Dodis and J. Katz, Chosenciphertext security of multiple encryption,, in, (2005), 188. 
[31] 
Y. Dodis, J. Katz, S. Xu and M. Yung, Keyinsulated public key cryptosystems,, in, (2002), 65. 
[32] 
S. Even, O. Goldreich and S. Micali, Online/offline digital signatures,, Journal of Cryptology, 9 (1996), 35. doi: 10.1007/BF02254791. 
[33] 
M. Fischlin, Roundoptimal composable blind signatures in the common reference string model,, in, (2006), 60. 
[34] 
S. Galbraith and W. Mao, Invisibility and anonymity of undeniable and confirmer signatures,, in, (2003), 80. 
[35] 
C. Gentry and Z. Ramzan, Identitybased aggregate signatures,, in, (2006), 257. 
[36] 
C. Gentry and A. Silverberg, Hierarchical idbased cryptography,, in, (2002), 548. 
[37] 
S. Goldwasser, S. Micali and R. L. Rivest, A digital signature scheme secure against adaptive chosenmessage attacks,, SIAM Journal on Computing, 17 (1988), 281. doi: 10.1137/0217017. 
[38] 
S. Goldwasser and R. Ostrovsky, Invariant signatures and noninteractive zeroknowledge proofs are equivalent,, in, (1992), 228. 
[39] 
C. Gu and Y. Zhu, An idbased verifiable encrypted signature scheme based on Hess's scheme,, in, (2005), 42. 
[40] 
J. Herranz, Deterministic identitybased signatures for partial aggregation,, The Computer Journal, 49 (2006), 322. doi: 10.1093/comjnl/bxh153. 
[41] 
B. C. Hu, D. S. Wong, Z. Zhang and X. Deng, Certificateless signature: a new security model and an improved generic construction,, Designs, 42 (2007), 109. doi: 10.1007/s1062300690229. 
[42] 
M. Jakobsson, K. Sako and R. Impagliazzo, Designated verifier proofs and their applications,, in, (1996), 143. 
[43] 
R. Johnson, D. Molnar, D. X. Song and D. Wagner, Homomorphic signature schemes,, in, (2002), 244. 
[44] 
A. Juels, M. Luby and R. Ostrovsky, Security of blind digital signatures,, in, (1997), 150. 
[45] 
E. Kiltz, A. Mityagin, S. Panjwani and B. Raghava, Appendonly signatures,, in, (2005), 434. 
[46] 
H. Krawczyk, Simple forwardsecure signatures from any signature scheme,, in, (2000), 108. 
[47] 
H. Krawczyk and T. Rabin, Chameleon signatures,, in, (2000). 
[48] 
F. Laguillaumie and D. Vergnaud, Short undeniable signatures without random oracles: the missing link,, in, (2005), 283. 
[49] 
L. Lamport, Constructing digital signatures from a oneway function,, Technical report, (1979). 
[50] 
B. Libert and JJ. Quisquater, Identity based undeniable signatures,, in, (2004), 112. 
[51] 
Y. Liu, X. Yin and L. Qiu, Idbased forwardsecure signature scheme from the bilinear pairings,, in, (2008), 179. doi: 10.1109/ISECS.2008.220. 
[52] 
S. Lu, R. Ostrovsky, A. Sahai, H. Shacham and B. Waters, Sequential aggregate signatures and multisignatures without random oracles,, in, (2006), 465. 
[53] 
A. Lysyanskaya, Unique signatures and verifiable random functions from the dhddh separation,, in, (2002), 597. 
[54] 
A. Lysyanskaya, S. Micali, L. Reyzin and H. Shacham, Sequential aggregate signatures from trapdoor permutations,, in, (2004), 74. 
[55] 
M. Mambo, K. Usuda and E. Okamoto, Proxy signatures: delegation of the power to sign messages,, IEICE Trans. Fundamentals, E79A (1996), 1338. 
[56] 
G. Neven, Efficient sequential aggregate signed data,, in, (2008), 52. 
[57] 
T. Okamoto, Efficient blind and partially blind signatures without random oracles,, in, (2006), 80. 
[58] 
L. T. Phong and W. Ogata, New identitybased blind signature and blind decryption scheme in the standard model,, IEICE Trans. Fundamentals, E92A (2009), 1822. 
[59] 
D. Pointcheval and J. Stern, Security arguments for digital signatures and blind signatures,, Journal of Cryptology, 13 (2000), 361. doi: 10.1007/s001450010003. 
[60] 
R. Rivest, A. Shamir and Y. Tauman, How to leak a secret, in "Proceedings of Asiacrypt'01" (ed. C. Boyd),, SpringerVerlag, (2001), 552. 
[61] 
R. Sakai, K. Ohgishi and M. Kasahara, Cryptosystems based on pairings,, in, (2000). 
[62] 
A. Shamir, Identitybased cryptosystems and signature schemes,, in, (1985), 47. 
[63] 
A. Shamir and Y. Tauman, Improved online/offline signature schemes,, in, (2001), 355. 
[64] 
W. Susilo, F. Zhang and Y. Mu, Identitybased strong designated verifier signature schemes,, in, (2004), 313. 
[65] 
W. Susilo, F. Zhang and Y. Mu, On the security of nominative signatures,, in, (2005), 329. 
[66] 
G. Wang, W. Gao, X. Wang and F. Li, Oneround idbased blind signature scheme without ROS assumption,, in, (2008), 316. 
[67] 
J. Weng, S. Liu, K. Chen and X. Li, Identitybased keyinsulated signature with secure keyupdates,, in, (2006), 13. 
[68] 
J. Xu, Z. Zhang and D. Feng, IDbased proxy signature using bilinear pairings,, in, (2005), 359. 
[69] 
S. Xu, Y. Mu and W. Susilo, Efficient authentication scheme for routing in mobile ad hoc networks,, in, (2005), 854. 
[70] 
F. Zhang and K. Kim, Idbased blind signature and ring signature from pairings,, in, (2002), 533. 
[71] 
F. Zhang and K. Kim, Efficient IDbased blind signature and proxy signature from bilinear pairings,, in, (2003), 312. 
[72] 
Y. Zhou, Z. Cao and Z. Chai, Identity based key insulated signature,, in, (2006), 226. 
show all references
References:
[1] 
, IEEE P1363.3:, Standard for identitybased cryptographic techniques using pairings., (). 
[2] 
M. Abdalla, C. Namprempre and G. Neven, On the (im)possibility of blind message authentication codes,, in, (2006), 262. 
[3] 
M. Abe and E. Fujisaki, How to date blind signatures,, in, (1996), 244. 
[4] 
M. Abe and T. Okamoto, Provably secure partially blind signatures,, in, (2000), 271. 
[5] 
J. H. Ahn, M. Green and S. Hohenberger, Synchronized aggregate signatures: neew definitions, constructions and applications,, in, (2010). 
[6] 
S. S. AlRiyami and K. G. Paterson, Certificateless public key cryptography,, in, (2003), 452. 
[7] 
G. Ateniese and B. De Medeiros, Identitybased chameleon hash and applications,, in, (2004), 164. 
[8] 
J. Baek and Y. Zheng, Identitybased threshold signature scheme from the bilinear pairings,, in, (2004), 124. 
[9] 
M. Bellare and S. K. Miner, A forwardsecure digital signature scheme,, in, (1999), 431. 
[10] 
M. Bellare, C. Namprempre and G. Neven, Security proofs for identitybased identification and signature schemes,, Journal of Cryptology, 22 (2009), 1. doi: 10.1007/s0014500890288. 
[11] 
M. Bellare, C. Namprempre, D. Pointcheval and M. Semanko, The onemorersainversion problems and the security of chaum's blind signature scheme,, Journal of Cryptology, 16 (2003), 185. doi: 10.1007/s0014500201201. 
[12] 
M. Bellare and P. Rogaway, Random oracles are practical: a paradigm for designing efficient protocols,, in, (1993), 62. 
[13] 
A. Boldyreva, Threshold signatures, multisignatures and blind signatures based on the gapdiffiehellmangroup signature scheme,, in, (2002), 31. 
[14] 
A. Boldyreva, C. Gentry, A. O'Neill and D. H. Yum, Ordered multisignatures and identitybased sequential aggregate signatures, with applications to secure routing,, in, (2007), 276. 
[15] 
A. Boldyreva, A. Palacio, and B. Warinschi, Secure proxy signature schemes for delegation of signing rights,, Technical report, (). 
[16] 
D. Boneh and X. Boyen, Short signatures without random oracles and the SDH assumption in bilinear groups,, Journal of Cryptology, 21 (2008), 149. doi: 10.1007/s0014500790057. 
[17] 
D. Boneh and M. K. Franklin, Identity based encryption from the Weil pairing,, SIAM Journal on Computing, 32 (2003), 586. doi: 10.1137/S0097539701398521. 
[18] 
D. Boneh, C. Gentry, B. Lynn and H. Shacham, Aggregate and verifiably encrypted signatures from bilinear maps,, in, (2003), 416. 
[19] 
D. Boneh, B. Lynn and H. Shacham, Short signatures from the Weil pairing,, Journal of Cryptology, 17 (2004), 297. doi: 10.1007/s0014500403149. 
[20] 
J. Camenisch, M. Koprowski and B. Warinschi, Efficient blind signatures without random oracles,, in, (2004), 134. 
[21] 
R. Canneti, O. Goldreich and S. Halevi, The random oracle methodology, revisited,, Journal of the ACM, 51 (2004), 557. doi: 10.1145/1008731.1008734. 
[22] 
D. Chaum, Blind signatures for untraceable payments,, in, (1983), 199. 
[23] 
D. Chaum, Designated confirmer signatures,, in, (1995), 86. 
[24] 
D. Chaum and H. Van Antwerpen, Undeniable signatures,, in, (1989), 212. 
[25] 
X. Cheng, J. Liu and X. Wang, An identitybased signature and its threshold version,, in, (2005), 973. 
[26] 
X. Cheng, J. Liu and X. Wang, Identitybased aggregate and verifiably encrypted signatures from bilinear pairing,, in, (2005), 1046. 
[27] 
S. S. M. Chow, L. C. K. Hui, S. M Yiu and K. P. Chow, Two improved partially blind signature schemes from bilinear pairings,, in, (2005), 316. 
[28] 
I. Damgard, N. Fazio and A. Nicolosi, Noninteractive zeroknowledge from homomorphic encryption,, in, (2006), 41. 
[29] 
I. Damgard and T. P. Pedersen, New convertible undeniable signature schemes,, in, (1996), 372. 
[30] 
Y. Dodis and J. Katz, Chosenciphertext security of multiple encryption,, in, (2005), 188. 
[31] 
Y. Dodis, J. Katz, S. Xu and M. Yung, Keyinsulated public key cryptosystems,, in, (2002), 65. 
[32] 
S. Even, O. Goldreich and S. Micali, Online/offline digital signatures,, Journal of Cryptology, 9 (1996), 35. doi: 10.1007/BF02254791. 
[33] 
M. Fischlin, Roundoptimal composable blind signatures in the common reference string model,, in, (2006), 60. 
[34] 
S. Galbraith and W. Mao, Invisibility and anonymity of undeniable and confirmer signatures,, in, (2003), 80. 
[35] 
C. Gentry and Z. Ramzan, Identitybased aggregate signatures,, in, (2006), 257. 
[36] 
C. Gentry and A. Silverberg, Hierarchical idbased cryptography,, in, (2002), 548. 
[37] 
S. Goldwasser, S. Micali and R. L. Rivest, A digital signature scheme secure against adaptive chosenmessage attacks,, SIAM Journal on Computing, 17 (1988), 281. doi: 10.1137/0217017. 
[38] 
S. Goldwasser and R. Ostrovsky, Invariant signatures and noninteractive zeroknowledge proofs are equivalent,, in, (1992), 228. 
[39] 
C. Gu and Y. Zhu, An idbased verifiable encrypted signature scheme based on Hess's scheme,, in, (2005), 42. 
[40] 
J. Herranz, Deterministic identitybased signatures for partial aggregation,, The Computer Journal, 49 (2006), 322. doi: 10.1093/comjnl/bxh153. 
[41] 
B. C. Hu, D. S. Wong, Z. Zhang and X. Deng, Certificateless signature: a new security model and an improved generic construction,, Designs, 42 (2007), 109. doi: 10.1007/s1062300690229. 
[42] 
M. Jakobsson, K. Sako and R. Impagliazzo, Designated verifier proofs and their applications,, in, (1996), 143. 
[43] 
R. Johnson, D. Molnar, D. X. Song and D. Wagner, Homomorphic signature schemes,, in, (2002), 244. 
[44] 
A. Juels, M. Luby and R. Ostrovsky, Security of blind digital signatures,, in, (1997), 150. 
[45] 
E. Kiltz, A. Mityagin, S. Panjwani and B. Raghava, Appendonly signatures,, in, (2005), 434. 
[46] 
H. Krawczyk, Simple forwardsecure signatures from any signature scheme,, in, (2000), 108. 
[47] 
H. Krawczyk and T. Rabin, Chameleon signatures,, in, (2000). 
[48] 
F. Laguillaumie and D. Vergnaud, Short undeniable signatures without random oracles: the missing link,, in, (2005), 283. 
[49] 
L. Lamport, Constructing digital signatures from a oneway function,, Technical report, (1979). 
[50] 
B. Libert and JJ. Quisquater, Identity based undeniable signatures,, in, (2004), 112. 
[51] 
Y. Liu, X. Yin and L. Qiu, Idbased forwardsecure signature scheme from the bilinear pairings,, in, (2008), 179. doi: 10.1109/ISECS.2008.220. 
[52] 
S. Lu, R. Ostrovsky, A. Sahai, H. Shacham and B. Waters, Sequential aggregate signatures and multisignatures without random oracles,, in, (2006), 465. 
[53] 
A. Lysyanskaya, Unique signatures and verifiable random functions from the dhddh separation,, in, (2002), 597. 
[54] 
A. Lysyanskaya, S. Micali, L. Reyzin and H. Shacham, Sequential aggregate signatures from trapdoor permutations,, in, (2004), 74. 
[55] 
M. Mambo, K. Usuda and E. Okamoto, Proxy signatures: delegation of the power to sign messages,, IEICE Trans. Fundamentals, E79A (1996), 1338. 
[56] 
G. Neven, Efficient sequential aggregate signed data,, in, (2008), 52. 
[57] 
T. Okamoto, Efficient blind and partially blind signatures without random oracles,, in, (2006), 80. 
[58] 
L. T. Phong and W. Ogata, New identitybased blind signature and blind decryption scheme in the standard model,, IEICE Trans. Fundamentals, E92A (2009), 1822. 
[59] 
D. Pointcheval and J. Stern, Security arguments for digital signatures and blind signatures,, Journal of Cryptology, 13 (2000), 361. doi: 10.1007/s001450010003. 
[60] 
R. Rivest, A. Shamir and Y. Tauman, How to leak a secret, in "Proceedings of Asiacrypt'01" (ed. C. Boyd),, SpringerVerlag, (2001), 552. 
[61] 
R. Sakai, K. Ohgishi and M. Kasahara, Cryptosystems based on pairings,, in, (2000). 
[62] 
A. Shamir, Identitybased cryptosystems and signature schemes,, in, (1985), 47. 
[63] 
A. Shamir and Y. Tauman, Improved online/offline signature schemes,, in, (2001), 355. 
[64] 
W. Susilo, F. Zhang and Y. Mu, Identitybased strong designated verifier signature schemes,, in, (2004), 313. 
[65] 
W. Susilo, F. Zhang and Y. Mu, On the security of nominative signatures,, in, (2005), 329. 
[66] 
G. Wang, W. Gao, X. Wang and F. Li, Oneround idbased blind signature scheme without ROS assumption,, in, (2008), 316. 
[67] 
J. Weng, S. Liu, K. Chen and X. Li, Identitybased keyinsulated signature with secure keyupdates,, in, (2006), 13. 
[68] 
J. Xu, Z. Zhang and D. Feng, IDbased proxy signature using bilinear pairings,, in, (2005), 359. 
[69] 
S. Xu, Y. Mu and W. Susilo, Efficient authentication scheme for routing in mobile ad hoc networks,, in, (2005), 854. 
[70] 
F. Zhang and K. Kim, Idbased blind signature and ring signature from pairings,, in, (2002), 533. 
[71] 
F. Zhang and K. Kim, Efficient IDbased blind signature and proxy signature from bilinear pairings,, in, (2003), 312. 
[72] 
Y. Zhou, Z. Cao and Z. Chai, Identity based key insulated signature,, in, (2006), 226. 
[1] 
Yang Lu, Jiguo Li. Forwardsecure identitybased encryption with direct chosenciphertext security in the standard model. Advances in Mathematics of Communications, 2017, 11 (1) : 161177. doi: 10.3934/amc.2017010 
[2] 
Florian Luca, Igor E. Shparlinski. On finite fields for pairing based cryptography. Advances in Mathematics of Communications, 2007, 1 (3) : 281286. doi: 10.3934/amc.2007.1.281 
[3] 
Gérard Maze, Chris Monico, Joachim Rosenthal. Public key cryptography based on semigroup actions. Advances in Mathematics of Communications, 2007, 1 (4) : 489507. doi: 10.3934/amc.2007.1.489 
[4] 
Zoltán Faigl, Miklós Telek. Modeling the signaling overhead in Host Identity Protocolbased secure mobile architectures. Journal of Industrial & Management Optimization, 2015, 11 (3) : 887920. doi: 10.3934/jimo.2015.11.887 
[5] 
Gregory M. Zaverucha, Douglas R. Stinson. Short onetime signatures. Advances in Mathematics of Communications, 2011, 5 (3) : 473488. doi: 10.3934/amc.2011.5.473 
[6] 
Andreas Klein. How to say yes, no and maybe with visual cryptography. Advances in Mathematics of Communications, 2008, 2 (3) : 249259. doi: 10.3934/amc.2008.2.249 
[7] 
Gerhard Frey. Relations between arithmetic geometry and public key cryptography. Advances in Mathematics of Communications, 2010, 4 (2) : 281305. doi: 10.3934/amc.2010.4.281 
[8] 
Diego F. Aranha, Ricardo Dahab, Julio López, Leonardo B. Oliveira. Efficient implementation of elliptic curve cryptography in wireless sensors. Advances in Mathematics of Communications, 2010, 4 (2) : 169187. doi: 10.3934/amc.2010.4.169 
[9] 
Marco Abate, Francesca Tovena. Formal normal forms for holomorphic maps tangent to the identity. Conference Publications, 2005, 2005 (Special) : 110. doi: 10.3934/proc.2005.2005.1 
[10] 
Gyula Csató, Bernard Dacorogna. An identity involving exterior derivatives and applications to Gaffney inequality. Discrete & Continuous Dynamical Systems  S, 2012, 5 (3) : 531544. doi: 10.3934/dcdss.2012.5.531 
[11] 
Changyou Wang, Shenzhou Zheng. Energy identity for a class of approximate biharmonic maps into sphere in dimension four. Discrete & Continuous Dynamical Systems  A, 2013, 33 (2) : 861878. doi: 10.3934/dcds.2013.33.861 
[12] 
Liliana Borcea, Fernando Guevara Vasquez, Alexander V. Mamonov. A discrete Liouville identity for numerical reconstruction of Schrödinger potentials. Inverse Problems & Imaging, 2017, 11 (4) : 623641. doi: 10.3934/ipi.2017029 
[13] 
Giovanni P. Crespi, Ivan Ginchev, Matteo Rocca. Two approaches toward constrained vector optimization and identity of the solutions. Journal of Industrial & Management Optimization, 2005, 1 (4) : 549563. doi: 10.3934/jimo.2005.1.549 
[14] 
A. V. Grishin. On nonSpechtianness of the variety of associative rings that satisfy the identity $x^{32} = 0$. Electronic Research Announcements, 2000, 6: 5051. 
[15] 
David Keyes. $\mathbb F_p$codes, theta functions and the Hamming weight MacWilliams identity. Advances in Mathematics of Communications, 2012, 6 (4) : 401418. doi: 10.3934/amc.2012.6.401 
[16] 
Jonathan Jedwab, Jane Wodlinger. Structural properties of Costas arrays. Advances in Mathematics of Communications, 2014, 8 (3) : 241256. doi: 10.3934/amc.2014.8.241 
[17] 
Vadim S. Anishchenko, Tatjana E. Vadivasova, Galina I. Strelkova, George A. Okrokvertskhov. Statistical properties of dynamical chaos. Mathematical Biosciences & Engineering, 2004, 1 (1) : 161184. doi: 10.3934/mbe.2004.1.161 
[18] 
Giovanni Panti. Dynamical properties of logical substitutions. Discrete & Continuous Dynamical Systems  A, 2006, 15 (1) : 237258. doi: 10.3934/dcds.2006.15.237 
[19] 
Keonhee Lee, Kazuhiro Sakai. Various shadowing properties and their equivalence. Discrete & Continuous Dynamical Systems  A, 2005, 13 (2) : 533540. doi: 10.3934/dcds.2005.13.533 
[20] 
S. Yu. Pilyugin, A. A. Rodionova, Kazuhiro Sakai. Orbital and weak shadowing properties. Discrete & Continuous Dynamical Systems  A, 2003, 9 (2) : 287308. doi: 10.3934/dcds.2003.9.287 
2016 Impact Factor: 0.8
Tools
Metrics
Other articles
by authors
[Back to Top]