Publications and Conference talks

• P.Boyvalenkov, S.Nikova, New Lower Bounds for Some Spherical Designs, 1st French-Israeli Workshop on Algebraic Coding, Paris, France, July 10-14, 1993; LNCS 781, pp. 207-216.
• S.Nikova,On Bounds on the Size of Designs in Complex Projective Spaces, International Workshop on Optimal Codes and Related Topics, Sozopol, Bulgaria, May 26 - June 1, 1995, pp. 121-126.
• P.Boyvalenkov,S.Nikova Some Characterizations of Spherical Designs with Small Cardinalities, 5h International Workshop Algebraic and Combinatorial Coding Theory, Sozopol, Bulgaria, June 1-7, 1996, pp. 77-80.
• P.Boyvalenkov, V.Nikov, S.Nikova, Nonexistence results for spherical 3-designs of small cardinalities, IEEE International Symposium on Information Theory,Ulm, Germany, June 29 - July 4, 1997,  pp. 298.
• P.Boyvalenkov, S.Nikova, On Lower Bounds on the Size of Designs in Compact Symmetric Spaces of Rank 1, Archiv der Mathematik 68, 1997, pp. 81-88.
• P.Boyvalenkov, S.Nikova, Improvements of the Lower Bounds on the Size of Some Spherical Designs, Mathematica Balkanica  12, 1998, pp. 151-160.
• P.Boyvalenkov, D.Danev, S.Nikova, On antipodal spherical 5-designs with n^2+n+4 points, International Workshop on Optimal Codes and Related Topics, Sozopol, Bulgaria, June 9-15 , 1998, pp. 39-43.
• S.Nikova, V.Nikov, Necessary and sufficient conditions for improving the Delsarte bound for tau-designs, 6th International Workshop on Algebr. and Comb. Codding Theory, Pskov,  Russia, September 6-12, 1998, pp. 191-195.
• S.Nikova, Bounds for Designs in Infinite Polynomial Metric Spaces, Ph.D. Thesis, Eindhoven University of Technology, September 1998. (the book)
• P.Boyvalenkov, D.Danev, S.Nikova, Nonexistence of certain spherical designs of odd strengths and cardinalities, Discrete and Computational Geometry 21, 1999, pp. 143-156.
• S.Nikova, V.Nikov, Extremal polynomials of degree tau+2 and tau+3, which improve the Delsarte bound for tau-designs, Workshop on Coding and Cryptography (WCC), Paris, France, January 11-14, 1999, pp. 361-367.
• S.Nikova,, V.Nikov, Some Applications of Bounds for Designs to the Cryptography, 7th IMA Conference on Cryptography & Coding, Cirencester, UK, December 20-22,1999; LNCS 1746, pp. 25-34.
• S.Nikova, V.Nikov, Extremal polynomials for codes in polynomial metric spaces, IEEE International Symposium on Information Theory, Sorento, Italy, June 25-30, 2000, pp. 60.
• Y.Borissov, N.Manev, S.Nikova, On the Non-Minimal codewords of weight $2d_{min}$ in the binary Reed-Muller Code ,Workshop on Coding and Cryptography (WCC), Paris, France, January 8-12, 2001, pp. 103-110.
• Y.Borissov, N.Manev, S.Nikova, On Non-Minimal codewords in the binary Reed-Muller Code,  IEEE International Symposium on Information Theory, Washington, D.C., U.S.A., June 24 -29, 2001, pp. 39.
• V.Nikov, S.Nikova, Improvement of the Delsarte bound for tau-designs in finite polynomial metric spaces, 8th IMA Conference on Cryptography & Coding, Cirencester, UK, December 16-19, 2001 , LNCS 2260, pp. 191-204.
• V.Nikov, S.Nikova, Improvement of the Delsarte bound for tau-designs when it is not the best bound possible, Designs Codes and Cryptography, vol. 28, Number 2, 2003, pp. 201-222.
• Y.Borissov, N.Manev, S.Nikova, On the Non-Minimal codewords in the binary Reed-Muller Code, Discrete Applied Mathematics, vol. 128, 2003, pp. 65-74.
• S.Nikova, V.Nikov, B.Preneel, J.Vandewalle, Applying General Access Structure to Proactive Secret Sharing Schemes, 23rd Symposium on Information Theory in the BENELUX, May 29-31, 2002, Louvain-la-Neuve, Belgium, pp. 197-206, Cryptology ePrint Archive: Report 2002/141.
• S.Nikova, V.Nikov, B.Preneel, J.Vandewalle, Operations on Access Structures, EWM International Workshop on Groups and Graphs, September 1-6, 2002, Varna, Bulgaria, pp. 79-83.
• S.Nikova, Y.Borissov, B.Preneel, J.Vandewalle, On a Resynchronization Weakness in a Class of Combiners with Memory, 3rd Conference on Security in Communication Networks (SCN), September 12-13, 2002, Amalfi, Italy, LNCS 2576, 2003, pp. 165-177.
• S.Nikova, V.Nikov, B.Preneel, J.Vandewalle, On Distributed Key Distribution Centers and Unconditionally Secure Proactive Verifiable Secret Sharing  Schemes based on General Access Structure, INDOCRYPT 2002, December 15-18, 2002, Hyderabad, India, LNCS 2551, 2002, pp. 422-437.
• S.Nikova, V.Nikov, B.Preneel, J.Vandewalle, On Unconditionally Secure Distributed Oblivious Transfer, INDOCRYPT 2002, December 15-18, 2002, Hyderabad, India, LNCS 2551, 2002, pp. 395-409.
• S.Nikova, V.Nikov, B.Preneel, J.Vandewalle, Applying General Access Structure to Metering Schemes, Workshop on Coding and Cryptography (WCC), March 24-28, 2003, Versailles, France, pp. 337-347, Cryptology ePrint Archive: Report 2002/102.
• S.Nikova, V.Nikov, Constructing New Monotone Span Programs from Existing Ones,  Proc. of the 4th International Workshop on Optimal Codes and Related Topics, Juni 17-23, 2005, Pamporovo, Bulgaria pp. 237-244.   Cryptology ePrint Archive: Report 2004/282.
• S.Nikova, V.Nikov, B.Preneel, Upper Bound for the Size of Monotone Span Programs, IEEE International Symposium on Information Theory, Yokohama, Japan June 29 - July 4, 2003, pp. 284.
• S.Nikova, V.Nikov, B.Preneel, Multi-Party Computation from any Linear Secret Sharing Scheme Unconditionally Secure against Adaptive Adversary: The Zero-Error Case, ACNS 2003, October 16-19, 2003, Kunming, China, LNCS 2846, 2003, pp.1-15.
• A.Braeken, Y.Borissov, S.Nikova, B.Preneel, On the Covering Radius of Second Order Binary Reed-Muller Code in the Set of Resilient Boolean Functions, 9th IMA Conference on Cryptography and Coding, 16-18 December 2003, Cirencester, UK, LNCS 2898, 2003, pp. 82-92.
• S.Nikova, V.Nikov, B.Preneel, On Multiplicative Linear Secret Sharing Schemes,  INDOCRYPT 2003, December 08-10, 2002, New Delhi, India,  LNCS 2904, 2003, pp.135-147, Cryptology ePrint Archive: Report 2003/006.
• ;A.Braeken, S.Nikova, V.Nikov, On Cheating Immune Secret Sharing, 25th Symposium on Information Theory in the Benelux, June 02-04, 2004 , Kerkrade, The Netherlands, pp. 113-120, Cryptology ePrint Archive: Report 2004/200.
• A.Braeken, Y.Borissov, S.Nikova, Covering Radius of the (n-3)-rd Order Reed-Muller Code in the Set of Resilient Functions, 25th Symposium on Information Theory in the Benelux, June2-4, 2004 , Kerkrade, The Netherlands, pp. 89-96, Cryptology ePrint Archive: Report 2004/202.
• S.Nikova, V.Nikov, On Proactive Secret Sharing Schemes, 11th Workshop on Selected Areas in Cryptography (SAC), August 9-10, 2004, Waterloo, Canada, LNCS 3357, 2004,  pp. 314-331.
• S.Nikova, V.Nikov, B.Preneel, On the Size of Monotone Span Programs, 4th Conference on Security in Communication Networks (SCN), September 08-10, 2004, Amalfi, Italy, LNCS 3352, 2004, pp. 252-265.
• S.Nikova, V.Nikov, B.Preneel, Robust Metering Schemes for General Access Structures, 6th International Conference on Information and Communications Security (ICICS), Malaga, Spain 27-29 October, 2004, LNCS 3269, 2004, pp. 53-65.
• A.Braeken, S.Nikova, V.Nikov, B.Preneel, On Boolean Functions with Generalized Cryptographic Properties, INDOCRYPT 2004,  December 20-22, 2004, Madras, India, LNCS 3348, 2004, pp. 119-134, Cryptology ePrint Archive: Report 2004/259.
• A.Braeken, S.Nikova, V.Nikov, Zigzag Functions and Related Objects in New Metric, 8th Nordic Combinatorial Conference 2004,  October 20-22, 2004,  Aalborg, Denmark, pp. 45-58.
• S.Nikova, V.Nikov, B.Preneel, On Metering Schemes, Journal of Indian Statistical Association, vol 42, No.2, 2004, pp. 261-286.
• Y.Borissov, A.Braeken, S.Nikova, B.Preneel, On the Covering Radii of Binary Reed-Muller Codes in the Set of Resilient Boolean Functions, IEEE Transactions on IT, vol. 51, No.3, March 2005, pp. 1182-1189.
• S.Nikova, V.Nikov, On a Relation between Verifiable Secret Sharing and a Class of Error-Correcting Codes, Proceedings of the Workshop on Coding and Cryptography (WCC), March 14-18, Bergen, Norway, 2005, pp. 372-382, 2005, LNCS 3969, 2005,  pp.275-290, Cryptology ePrint Archive: Report 2003/210.
• A.Braeken, Y.Borissov, S.Nikova, B.Preneel, Classification of Cubic Boolean Functions in 7 variables, 26th Symposium on Information Theory in the Benelux 2005, May 19-20, 2005, Brussels, Belgium, pp. 285-292.
• A.Braeken, Y.Borissov, S.Nikova, Classification of Boolean Functions of 6 Variables or Less with Respect to Some Cryptographic Properties, International Colloquium on Automata, Languages and Programming (ICALP), July 11-15, Lisboa, Portugal 2005, LNCS 3580, 2005, pp. 324-334.
• A. Braeken, S.Nikova, V.Nikov, Error-Set Codes and Related Objects, 11th International Computing and Combinatorics Conference (COCOON), August 16-19, Kunming, China 2005, LNCS 3595, 2005, pp. 577-585.
• S.Nikova, V.Nikov, On Secret Sharing Schemes, Proceeding of the Contact Forum "Coding theory and cryptography", October 7, 2005, Royal Flemish Academy for Science and the Arts, Brussels, Belgium, pp. 16.
• A.Braeken, Y.Borissov, S.Nikova, B.Preneel, Classification of Cubic (n-4)-resilient Boolean Functions, IEEE Transactions on Information Theory 52(4), pp. 1670-1676, 2006, Cryptology ePrint Archive: Report 2005/332.
• Y.Borissov, N.Manev, S.Nikova, On primitive polynomials over GF(2) the duals of which are also primitive, 27th Symposium on Information Theory in the Benelux 2006, June 8-9, Noordwijk, The Netherlands, 2006, pp. 221-226.
• S.Nikova, V.Nikov, B.Preneel, On Proactive Verifiable Secret Sharing Schemes, Serdica Journal of Computing, vol. 1, 3 2007, pp. 337-364. Proc. “Pioneers of Bulgarian Mathematics”, July 8-10, Sofia, Bulgaria, 2006, pp.90.
• S.Nikova, V.Nikov, B.Preneel, On Distributed Oblivious transfer, Serdica Journal of Computing, vol. 1, 3 2007, pp. 313-336. Proc. “Pioneers of Bulgarian Mathematics”, July 8-10, Sofia, Bulgaria, 2006, pp.89.
• S.Nikova, C.Rechberger, V.Rijmen, Threshold Implementations Against Side-Channel Attacks and Glitches, In Information and Communications Security, 8th International Conference (ICICS), December 4-7, North Carolina, USA, 2006, LNCS 4307, 2006, pp.529-545.
• S.Nikova, V.Nikov, B.Preneel, A Weakness in Some Oblivious Transfer and Zero-Knowledge Protocols, ASIACRYPT 2006, December 3-7, Shanghai, China, 2006, LNCS 4284, 2006, pp. 348-363, Cryptology ePrint Archive: Report 2006/363.
• E.Kasper, S.Nikova, V.Nikov, Strongly Multiplicative Hierarchical Threshold Secret Sharing, ICITS 2007, May 25-29, Madrid, Spain, 2007, LNCS, 2007, pp.
• S.Nikova, V.Nikov, On Multiplicative Secret Sharing Schemes Realizing Graph Access Structures, International Workshop on Optimal Codes and Related Topics, June 16-22, Balchik, Bulgaria, 2007, pp.194-199.
• S.Nikova, V.Nikov, Modification of Jarecki and Saxena Proactive RSA Signature Scheme, IEEE ISIT, June 24-29, Nice, France, 2007, pp. 5.
• Y.Borissov, M.Ho Lee, S.Nikova, Asymptotic Behavior of the Ratio Between the Numbers of Binary Primitive and Irreducible Polynomials, Finite Fileds and Applications (FQ8), July 9-13, Melbourne, Australia, 2007, pp. 10. Cryptology ePrint Archive: Report 2007/301.
• R.Peeters, S.Nikova, B.Preneel, Practical RSA Threshold Decryption for Things That Think ,In 3rd Benelux Workshop on Information and System Security (WISSec 2008), 16 pages, 2008.
• S.Nikova, V.Rijmen, M.Schläffer, Secure hardware implementations of non-linear functions in the presence of glitches, In Information Security and Cryptology (ICISC 2008), LNCS 5461, 2008, pp.218-234.
• S.Nikova, V.Rijmen, M.Schläffer, Using normal bases for compact hardware implementations of the AES S-box, In Security in Communication Networks (SCN 2008), LCNS 5229, 2008, pp.236-245.
• S.Indesteege, E.Andreeva, C.De Cannière, O.Dunkelman, E.Käsper, S.Nikova, B.Preneel, E.Tischhauser, The Lane Hash Function, NIST SHA3 submission, 72 pages, 2008.
• S.Nikova, V.Nikov, Efficient Perfectly Secure Verifiable Secret Sharing and Distributed Commitment Schemes , In Proceedings of the International Workshop on Coding and Cryptography (WCC 2009), Electronic Notes in Discrete Mathematics, Elsevier, 15 pages, 2009.
• V.Nikov, S.Nikova, Secret Sharing and Error Correcting , In Enhancing cryptographic primitives with techniques from error correcting codes, NATO Science for Peace and Security Series D - Information and Communication Security 23, IOS Press, pp.28-39, 2009.
• Z.Gong, P.Hartel, S.Nikova, B.Zhu, Towards Secure and Practical MACs for Body Sensor Networks , INDOCRYPT 2009, LNCS 5922, pp.182-198.
• L.Ibraimi, M.Petkovic, S.Nikova, P.Hartel, W.Jonker, Mediated Ciphertext-Policy Attribute-Based Encryption and Its application , WISA 2009, LNCS 5932, pp.309-323.
• S.Sedghi, P.van Liesdonk, S.Nikova, P.Hartel, W.Jonker, Searching Keywords with Wildcards on Encrypted Data , 7th international Conference on Security and Cryptography for Networks (SCN 2010), 13-15 September 2010, Amalfy, Italy. pp.138-153. LNCS 6280.
• P.S.Barreto, V.Nikov, S.Nikova, V.Rijmen, E.Tischhauser, Wirlwind: a New Cryptographic Hash Function , Designs Codes and Cryptography 56(2-3), pp.141-162, 2010.
• S.Nikova, V.Rijmen, M.Schläffer, Secure Hardware Implementation of Nonlinear Functions in the Presence of Glitches , Special Issue on Hardware and Security of Journal of Cryptology, 27 pages, 2011.

 

Last modified: Mar 20 2011
 

Back to Main Page