
Previous Article
On the order bounds for onepoint AG codes
 AMC Home
 This Issue

Next Article
Spacetime block codes from nonassociative division algebras
Short onetime signatures
1.  Certicom Research, 5520 Explorer Drive, Mississauga, ON L4W 5L1, Canada 
2.  David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON N2L 3G1, Canada 
References:
[1] 
N. Asokan, V. Shoup and M. Waidner, Optimistic fair exchange of digital signatures, IEEE J. Selected Areas Commun., 18 (2000), 593610. doi: 10.1109/49.839935. 
[2] 
G. Ateniese, Verifiable encryption of digital signatures and applications, ACM Trans. Inform. Systems Security (TISSEC), 7 (2004), 120. doi: 10.1145/984334.984335. 
[3] 
M. Bellare, J. Garay and T. Rabin, Fast batch verification for modular exponentiation and digital signatures, in "Proceedings of EUROCRYPT '98,'' (1998), 236250. 
[4] 
M. Bellare and S. Shoup, Twotier signatures, strongly unforgeable signatures, and FiatShamir without random oracles, in "Public Key Cryptography (PKC'07),'' (2007), 201216. 
[5] 
D. J. Bernstein, Pippenger's exponentiation algorithm,, manuscript, (). 
[6] 
K. Bicakci, C. Gamage, B. Crispo and A. S. Tanenbaum, Onetime sensors: a novel concept to mitigate nodecapture attacks, in "Proceedings of Security and Privacy in Adhoc and Sensor Networks (ESAS'05),'' (2005), 8090. 
[7] 
K. Bicakci, G. Tsudik and B. Tung, How to construct optimal onetime signatures, Computer Networks, 43 (2003), 339349. doi: 10.1016/S13891286(03)002858. 
[8] 
D. Boneh, C. Gentry, B. Lynn and H. Shacham, Aggregate and verifiably encrypted signatures from bilinear maps, in "Proceedings of EUROCRYPT '03,'' (2003), 416432. 
[9] 
D. Boneh, B. Lynn and H. Shacham, Short signatures from the Weil pairing, J. Cryptology, 17 (2004), 297319. doi: 10.1007/s0014500403149. 
[10] 
J. Bos and D. Chaum, Provably unforgeable signatures, in "Proceedings of CRYPTO '92,'' (1992), 114. 
[11] 
J. Buchmann, E. Dahmen, E. Klintsevich, K. Okeya and C. Vuillaume, Merkle signatures with virtually unlimited signature capacity, in "Proceedings of Applied Cryptography and Network Security (ACNS'07),'' (2007), 3145. 
[12] 
J. Camenisch and V. Shoup, Practical verifiable encryption and decryption of discrete logarithms, in "Proceedings of CRYPTO '03,'' (2003), 126144. 
[13] 
J. Camenisch and M. Stadler, Proof systems for general statements about discrete logarithms, Technical Report TR 260, Institute for Theoretical Computer Science, ETH Zürich, 1997. 
[14] 
R. Canetti, S. Halevi and J. Katz, Chosenciphertext security from identitybased encryption, in "Proceedings of EUROCRYPT '04,'' (2004), 207222. 
[15] 
B. Chor and R. Rivest, A knapsacktype public key cryptosystem based on arithmetic in finite fields, IEEE Trans. Inform. Theory, 34 (1988), 901909. doi: 10.1109/18.21214. 
[16] 
T. M. Cover, Enumerative source coding, IEEE Trans. Inform. Theory, 19 (1973), 7377. doi: 10.1109/TIT.1973.1054929. 
[17] 
R. Cramer and V. Shoup, A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack, in "Proceedings of CRYPTO'98,'' (1998), 1325. 
[18] 
E. Dahmen and C. Krauß, Short hashbased signatures for wireless sensor networks, in "Proceedings of Cryptology and Network Security (CANS'09),'' (2009), 463476. 
[19] 
W. Dai, Crypto++: a free C++ class library of cryptographic schemes, http://www.cryptopp.com/, accessed January 2010. 
[20] 
I. Damgård, Efficient concurrent zeroknowledge in the auxiliary string model, in "Proceedings of EUROCRYPT'00,'' (2000), 418430. 
[21] 
I. Damgård and M. Jurik, A generalisation, a simplification and some applications of Paillier's probabilistic publickey system, in "Proceedings of PKC 2001,'' (1992), 119136. 
[22] 
C. Dods, N. P. Smart and M. Stam, Hash based digital signature schemes, in "Proceedings of Cryptography and Coding 2005,'' (2005), 96115. doi: 10.1007/11586821_8. 
[23] 
S. Even, O. Goldreich and S. Micali, Online/offline digital signatures, J. Cryptology, 9 (1996), 3567. doi: 10.1007/BF02254791. 
[24] 
R. Genarro and P. Rohatgi, How to sign digital streams, in "Proceedings of CRYPTO '97,'' (1997), 180197. 
[25] 
S. Goldwasser, S. Micali and R. L. Rivest, A digital signature scheme secure against adaptive chosenmessage attacks, SIAM J. Comput., 17 (1988), 281308. doi: 10.1137/0217017. 
[26] 
J. Groth, Simulationsound NIZK proofs for a practical language and constant size group signatures, in "Proceedings of ASIACRYPT'06,'' (2006), 444459. 
[27] 
N. Gura, A. Patel, A. Wander, H. Eberle and S. C. Shantz, Comparing elliptic curve cryptography and RSA on 8bit CPUs, in "Proceedings of CHES '04,'' (2004), 118132. 
[28] 
F. Kargl, P. Papadimitratos, L. Buttyan, M. Müter, E. Schoch, B. Wiedersheim, T.V. Thong, G. Calandriello, A. Held, A. Kung and J.P. Hubaux, Secure vehicular communication systems: implementation, performance, and research challenges, IEEE Commun. Magazine, 46 (2008), 110118. doi: 10.1109/MCOM.2008.4689253. 
[29] 
J. Katz, Signature schemes with bounded leakage resilience, IACR ePrint Archive Report 2009/220, available online at http://eprint.iacr.org/2009/220 
[30] 
D. L. Kreher and D. R. Stinson, "Combinatorial Algorithms: Generation, Enumeration and Search,'' CRC Press, Boca Raton, FL, 1999. 
[31] 
L. Lamport, Constructing digital signatures from a oneway function, Technical Report CSL98, SRI International, Palo Alto, 1979. 
[32] 
M. Luk, A. Perrig and B. Whillock, Seven cardinal properties of sensor network broadcast authentication, in "SASN '06: Proceedings of the fourth ACM Workshop on Security of ad hoc and Sensor Networks,'' ACM Press, (2006), 147156. 
[33] 
A. J. Menezes, P. C. van Oorschot and S. A. Vanstone, "Handbook of Applied Cryptography,'' CRC Press LLC, Boca Raton, FL, 1996. doi: 10.1201/9781439821916. 
[34] 
R. Merkle, A certified digital signature, in "Proceedings of CRYPTO '89,'' (1989), 218238. 
[35] 
P. Mohassel, Onetime signatures and Chameleon hash functions, in "Proceedings of Selected Areas in Cryptography (SAC'10),'' (2011), 302319. 
[36] 
D. Naor, A. Shenhav and A. Wool, Onetime signatures revisited: have they become practical?, IACR ePrint Archive Report 2005/442, available online at http://eprint.iacr.org/2005/442 
[37] 
National Institute of Standards and Technology, Digital signature standard (DSS), FIPS PUB, 1862, (2000). 
[38] 
P. Paillier, Publickey cryptosystems based on composite residuosity classes, in "Proceedings of EUROCRYPT '99,'' (1999), 223239. 
[39] 
P. Paillier and D. Vergnaud, Discretelogbased signatures may not be equivalent to discrete log, in "Proceedings of ASIACRYPT '05,'' (2005), 120. 
[40] 
T. P. Pedersen, Noninteractive and informationtheoretic secure verifiable secret sharing, in "Proceedings of CRYPTO'91,'' (1992), 129140. 
[41] 
A. Perrig, The BiBa one time signature and broadcast authentication protocol, in "Proceedings of the 8th ACM Conference on Computer and Communications Security (CCS '01),'' ACM Press, New York, (2001), 2837. 
[42] 
J. Pieprzyk, H. Wang and C. Xing, Multipletime signature schemes against chosen message attacks, in "Proceedings of SAC '03,'' (2003), 88100. 
[43] 
M. O. Rabin, Digitalized signatures, in "Foundations of Secure Computation,'' Academic Press, New York, (1978), 155168. 
[44] 
L. Reyzin and N. Reyzin, New York: better than BiBa: short onetime signatures with fast signing and verifying, in "Proceedings of ACISP '02,'' (2002), 144153. 
[45] 
P. Rohatgi, A compact and fast hybrid signature scheme for multicast packet authentication, in "Proceedings of the 6th ACM Conference on Computer and Communications Security (CCS '99),'' ACM Press, New York, (1999), 93100. 
[46] 
S. Rohde, T. Eisenbarth, E. Dahmen, J. Buchmann and C. Paar, Fast hashbased signatures on constrained devices, in "Proceedings of CARDIS'08,'' (2008), 104117. 
[47] 
E. Sperner, Ein satz uber untermengen einer endliche menge, Math. Zeit., 27 (1928), 544548. doi: 10.1007/BF01171114. 
[48] 
D. R. Stinson and R. Wei, Generalized coverfree families, Disc. Math., 279 (2004), 463477. doi: 10.1016/S0012365X(03)002875. 
[49] 
D. R. Stinson, R. Wei and L. Zhu, Some new bounds for coverfree families, J. Combin. Theory Ser. A, 90 (2000), 224234. doi: 10.1006/jcta.1999.3036. 
[50] 
P. Szczechowiak, L. B. Oliveira, M. Scott, M. Collier and R. Dahab, NanoECC: testing the limits of elliptic curve cryptography in sensor networks, in "Proceedings of EWSN '08,'' (2008), 305320. 
[51] 
E. van Heyst and T. P. Pedersen, How to make efficient failstop signatures, in "Proceedings of EUROCRYPT '92,'' (1993), 366377. 
show all references
References:
[1] 
N. Asokan, V. Shoup and M. Waidner, Optimistic fair exchange of digital signatures, IEEE J. Selected Areas Commun., 18 (2000), 593610. doi: 10.1109/49.839935. 
[2] 
G. Ateniese, Verifiable encryption of digital signatures and applications, ACM Trans. Inform. Systems Security (TISSEC), 7 (2004), 120. doi: 10.1145/984334.984335. 
[3] 
M. Bellare, J. Garay and T. Rabin, Fast batch verification for modular exponentiation and digital signatures, in "Proceedings of EUROCRYPT '98,'' (1998), 236250. 
[4] 
M. Bellare and S. Shoup, Twotier signatures, strongly unforgeable signatures, and FiatShamir without random oracles, in "Public Key Cryptography (PKC'07),'' (2007), 201216. 
[5] 
D. J. Bernstein, Pippenger's exponentiation algorithm,, manuscript, (). 
[6] 
K. Bicakci, C. Gamage, B. Crispo and A. S. Tanenbaum, Onetime sensors: a novel concept to mitigate nodecapture attacks, in "Proceedings of Security and Privacy in Adhoc and Sensor Networks (ESAS'05),'' (2005), 8090. 
[7] 
K. Bicakci, G. Tsudik and B. Tung, How to construct optimal onetime signatures, Computer Networks, 43 (2003), 339349. doi: 10.1016/S13891286(03)002858. 
[8] 
D. Boneh, C. Gentry, B. Lynn and H. Shacham, Aggregate and verifiably encrypted signatures from bilinear maps, in "Proceedings of EUROCRYPT '03,'' (2003), 416432. 
[9] 
D. Boneh, B. Lynn and H. Shacham, Short signatures from the Weil pairing, J. Cryptology, 17 (2004), 297319. doi: 10.1007/s0014500403149. 
[10] 
J. Bos and D. Chaum, Provably unforgeable signatures, in "Proceedings of CRYPTO '92,'' (1992), 114. 
[11] 
J. Buchmann, E. Dahmen, E. Klintsevich, K. Okeya and C. Vuillaume, Merkle signatures with virtually unlimited signature capacity, in "Proceedings of Applied Cryptography and Network Security (ACNS'07),'' (2007), 3145. 
[12] 
J. Camenisch and V. Shoup, Practical verifiable encryption and decryption of discrete logarithms, in "Proceedings of CRYPTO '03,'' (2003), 126144. 
[13] 
J. Camenisch and M. Stadler, Proof systems for general statements about discrete logarithms, Technical Report TR 260, Institute for Theoretical Computer Science, ETH Zürich, 1997. 
[14] 
R. Canetti, S. Halevi and J. Katz, Chosenciphertext security from identitybased encryption, in "Proceedings of EUROCRYPT '04,'' (2004), 207222. 
[15] 
B. Chor and R. Rivest, A knapsacktype public key cryptosystem based on arithmetic in finite fields, IEEE Trans. Inform. Theory, 34 (1988), 901909. doi: 10.1109/18.21214. 
[16] 
T. M. Cover, Enumerative source coding, IEEE Trans. Inform. Theory, 19 (1973), 7377. doi: 10.1109/TIT.1973.1054929. 
[17] 
R. Cramer and V. Shoup, A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack, in "Proceedings of CRYPTO'98,'' (1998), 1325. 
[18] 
E. Dahmen and C. Krauß, Short hashbased signatures for wireless sensor networks, in "Proceedings of Cryptology and Network Security (CANS'09),'' (2009), 463476. 
[19] 
W. Dai, Crypto++: a free C++ class library of cryptographic schemes, http://www.cryptopp.com/, accessed January 2010. 
[20] 
I. Damgård, Efficient concurrent zeroknowledge in the auxiliary string model, in "Proceedings of EUROCRYPT'00,'' (2000), 418430. 
[21] 
I. Damgård and M. Jurik, A generalisation, a simplification and some applications of Paillier's probabilistic publickey system, in "Proceedings of PKC 2001,'' (1992), 119136. 
[22] 
C. Dods, N. P. Smart and M. Stam, Hash based digital signature schemes, in "Proceedings of Cryptography and Coding 2005,'' (2005), 96115. doi: 10.1007/11586821_8. 
[23] 
S. Even, O. Goldreich and S. Micali, Online/offline digital signatures, J. Cryptology, 9 (1996), 3567. doi: 10.1007/BF02254791. 
[24] 
R. Genarro and P. Rohatgi, How to sign digital streams, in "Proceedings of CRYPTO '97,'' (1997), 180197. 
[25] 
S. Goldwasser, S. Micali and R. L. Rivest, A digital signature scheme secure against adaptive chosenmessage attacks, SIAM J. Comput., 17 (1988), 281308. doi: 10.1137/0217017. 
[26] 
J. Groth, Simulationsound NIZK proofs for a practical language and constant size group signatures, in "Proceedings of ASIACRYPT'06,'' (2006), 444459. 
[27] 
N. Gura, A. Patel, A. Wander, H. Eberle and S. C. Shantz, Comparing elliptic curve cryptography and RSA on 8bit CPUs, in "Proceedings of CHES '04,'' (2004), 118132. 
[28] 
F. Kargl, P. Papadimitratos, L. Buttyan, M. Müter, E. Schoch, B. Wiedersheim, T.V. Thong, G. Calandriello, A. Held, A. Kung and J.P. Hubaux, Secure vehicular communication systems: implementation, performance, and research challenges, IEEE Commun. Magazine, 46 (2008), 110118. doi: 10.1109/MCOM.2008.4689253. 
[29] 
J. Katz, Signature schemes with bounded leakage resilience, IACR ePrint Archive Report 2009/220, available online at http://eprint.iacr.org/2009/220 
[30] 
D. L. Kreher and D. R. Stinson, "Combinatorial Algorithms: Generation, Enumeration and Search,'' CRC Press, Boca Raton, FL, 1999. 
[31] 
L. Lamport, Constructing digital signatures from a oneway function, Technical Report CSL98, SRI International, Palo Alto, 1979. 
[32] 
M. Luk, A. Perrig and B. Whillock, Seven cardinal properties of sensor network broadcast authentication, in "SASN '06: Proceedings of the fourth ACM Workshop on Security of ad hoc and Sensor Networks,'' ACM Press, (2006), 147156. 
[33] 
A. J. Menezes, P. C. van Oorschot and S. A. Vanstone, "Handbook of Applied Cryptography,'' CRC Press LLC, Boca Raton, FL, 1996. doi: 10.1201/9781439821916. 
[34] 
R. Merkle, A certified digital signature, in "Proceedings of CRYPTO '89,'' (1989), 218238. 
[35] 
P. Mohassel, Onetime signatures and Chameleon hash functions, in "Proceedings of Selected Areas in Cryptography (SAC'10),'' (2011), 302319. 
[36] 
D. Naor, A. Shenhav and A. Wool, Onetime signatures revisited: have they become practical?, IACR ePrint Archive Report 2005/442, available online at http://eprint.iacr.org/2005/442 
[37] 
National Institute of Standards and Technology, Digital signature standard (DSS), FIPS PUB, 1862, (2000). 
[38] 
P. Paillier, Publickey cryptosystems based on composite residuosity classes, in "Proceedings of EUROCRYPT '99,'' (1999), 223239. 
[39] 
P. Paillier and D. Vergnaud, Discretelogbased signatures may not be equivalent to discrete log, in "Proceedings of ASIACRYPT '05,'' (2005), 120. 
[40] 
T. P. Pedersen, Noninteractive and informationtheoretic secure verifiable secret sharing, in "Proceedings of CRYPTO'91,'' (1992), 129140. 
[41] 
A. Perrig, The BiBa one time signature and broadcast authentication protocol, in "Proceedings of the 8th ACM Conference on Computer and Communications Security (CCS '01),'' ACM Press, New York, (2001), 2837. 
[42] 
J. Pieprzyk, H. Wang and C. Xing, Multipletime signature schemes against chosen message attacks, in "Proceedings of SAC '03,'' (2003), 88100. 
[43] 
M. O. Rabin, Digitalized signatures, in "Foundations of Secure Computation,'' Academic Press, New York, (1978), 155168. 
[44] 
L. Reyzin and N. Reyzin, New York: better than BiBa: short onetime signatures with fast signing and verifying, in "Proceedings of ACISP '02,'' (2002), 144153. 
[45] 
P. Rohatgi, A compact and fast hybrid signature scheme for multicast packet authentication, in "Proceedings of the 6th ACM Conference on Computer and Communications Security (CCS '99),'' ACM Press, New York, (1999), 93100. 
[46] 
S. Rohde, T. Eisenbarth, E. Dahmen, J. Buchmann and C. Paar, Fast hashbased signatures on constrained devices, in "Proceedings of CARDIS'08,'' (2008), 104117. 
[47] 
E. Sperner, Ein satz uber untermengen einer endliche menge, Math. Zeit., 27 (1928), 544548. doi: 10.1007/BF01171114. 
[48] 
D. R. Stinson and R. Wei, Generalized coverfree families, Disc. Math., 279 (2004), 463477. doi: 10.1016/S0012365X(03)002875. 
[49] 
D. R. Stinson, R. Wei and L. Zhu, Some new bounds for coverfree families, J. Combin. Theory Ser. A, 90 (2000), 224234. doi: 10.1006/jcta.1999.3036. 
[50] 
P. Szczechowiak, L. B. Oliveira, M. Scott, M. Collier and R. Dahab, NanoECC: testing the limits of elliptic curve cryptography in sensor networks, in "Proceedings of EWSN '08,'' (2008), 305320. 
[51] 
E. van Heyst and T. P. Pedersen, How to make efficient failstop signatures, in "Proceedings of EUROCRYPT '92,'' (1993), 366377. 
[1] 
Thais Bardini Idalino, Lucia Moura. Embedding coverfree families and cryptographical applications. Advances in Mathematics of Communications, 2019, 13 (4) : 629643. doi: 10.3934/amc.2019039 
[2] 
David Galindo, Javier Herranz, Eike Kiltz. On the generic construction of identitybased signatures with additional properties. Advances in Mathematics of Communications, 2010, 4 (4) : 453483. doi: 10.3934/amc.2010.4.453 
[3] 
Sanjit Chatterjee, Berkant Ustaoğlu. Malleability and ownership of proxy signatures: Towards a stronger definition and its limitations. Advances in Mathematics of Communications, 2020, 14 (2) : 177205. doi: 10.3934/amc.2020015 
[4] 
Vincent Astier, Thomas Unger. Signatures, sums of hermitian squares and positive cones on algebras with involution. Electronic Research Announcements, 2018, 25: 1626. doi: 10.3934/era.2018.25.003 
[5] 
Guofu Lu. Nonexistence and short time asymptotic behavior of sourcetype solution for porous medium equation with convection in onedimension. Discrete and Continuous Dynamical Systems  B, 2016, 21 (5) : 15671586. doi: 10.3934/dcdsb.2016011 
[6] 
Jan Haškovec, Dietmar Oelz. A free boundary problem for aggregation by short range sensing and differentiated diffusion. Discrete and Continuous Dynamical Systems  B, 2015, 20 (5) : 14611480. doi: 10.3934/dcdsb.2015.20.1461 
[7] 
Daniel Schnellmann. Typical points for oneparameter families of piecewise expanding maps of the interval. Discrete and Continuous Dynamical Systems, 2011, 31 (3) : 877911. doi: 10.3934/dcds.2011.31.877 
[8] 
Patrick Martinez, Judith Vancostenoble. Exact controllability in "arbitrarily short time" of the semilinear wave equation. Discrete and Continuous Dynamical Systems, 2003, 9 (4) : 901924. doi: 10.3934/dcds.2003.9.901 
[9] 
Hyung Ju Hwang, Thomas P. Witelski. Shorttime pattern formation in thin film equations. Discrete and Continuous Dynamical Systems, 2009, 23 (3) : 867885. doi: 10.3934/dcds.2009.23.867 
[10] 
Juan Pablo Maldonado López. Discrete time mean field games: The shortstage limit. Journal of Dynamics and Games, 2015, 2 (1) : 89101. doi: 10.3934/jdg.2015.2.89 
[11] 
Mingming Chen, Xianguo Geng, Kedong Wang. Longtime asymptotics for the modified complex short pulse equation. Discrete and Continuous Dynamical Systems, 2022 doi: 10.3934/dcds.2022060 
[12] 
Shouchuan Hu, Xin Lu. Cover page and Preface. Conference Publications, 2015, 2015 (special) : ii. doi: 10.3934/proc.2015.2015.si 
[13] 
Naoki Sato, Toyohiko Aiki, Yusuke Murase, Ken Shirakawa. A one dimensional free boundary problem for adsorption phenomena. Networks and Heterogeneous Media, 2014, 9 (4) : 655668. doi: 10.3934/nhm.2014.9.655 
[14] 
Jun Hu, Oleg Muzician, Yingqing Xiao. Dynamics of regularly ramified rational maps: Ⅰ. Julia sets of maps in oneparameter families. Discrete and Continuous Dynamical Systems, 2018, 38 (7) : 31893221. doi: 10.3934/dcds.2018139 
[15] 
William Ott, Qiudong Wang. Periodic attractors versus nonuniform expansion in singular limits of families of rank one maps. Discrete and Continuous Dynamical Systems, 2010, 26 (3) : 10351054. doi: 10.3934/dcds.2010.26.1035 
[16] 
Giulio G. Giusteri, Alfredo Marzocchi, Alessandro Musesti. Nonlinear free fall of onedimensional rigid bodies in hyperviscous fluids. Discrete and Continuous Dynamical Systems  B, 2014, 19 (7) : 21452157. doi: 10.3934/dcdsb.2014.19.2145 
[17] 
Lambertus A. Peletier, Willem de Winter, An Vermeulen. Dynamics of a tworeceptor binding model: How affinities and capacities translate into long and short time behaviour and physiological corollaries. Discrete and Continuous Dynamical Systems  B, 2012, 17 (6) : 21712184. doi: 10.3934/dcdsb.2012.17.2171 
[18] 
Laura Cremaschi, Carlo Mantegazza. Shorttime existence of the second order renormalization group flow in dimension three. Discrete and Continuous Dynamical Systems, 2015, 35 (12) : 57875798. doi: 10.3934/dcds.2015.35.5787 
[19] 
Marcel Oliver. The Lagrangian averaged Euler equations as the shorttime inviscid limit of the Navier–Stokes equations with Besov class data in $\mathbb{R}^2$. Communications on Pure and Applied Analysis, 2002, 1 (2) : 221235. doi: 10.3934/cpaa.2002.1.221 
[20] 
Giovanni Gravina, Giovanni Leoni. On the behavior of the free boundary for a onephase Bernoulli problem with mixed boundary conditions. Communications on Pure and Applied Analysis, 2020, 19 (10) : 48534878. doi: 10.3934/cpaa.2020215 
2020 Impact Factor: 0.935
Tools
Metrics
Other articles
by authors
[Back to Top]