The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Svetla Nikova: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ventzislav Nikov, Svetla Nikova, Bart Preneel
    Multi-party Computation from Any Linear Secret Sharing Scheme Unconditionally Secure against Adaptive Adversary: The Zero-Error Case. [Citation Graph (0, 0)][DBLP]
    ACNS, 2003, pp:1-15 [Conf]
  2. Ventzislav Nikov, Svetla Nikova, Bart Preneel
    A Weakness in Some Oblivious Transfer and Zero-Knowledge Protocols. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2006, pp:348-363 [Conf]
  3. An Braeken, Ventzislav Nikov, Svetla Nikova
    Error-Set Codes and Related Objects. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:577-585 [Conf]
  4. Peter Boyvalenkov, Svetla Nikova
    New lower bounds for some spherical designs. [Citation Graph (0, 0)][DBLP]
    Algebraic Coding, 1993, pp:207-216 [Conf]
  5. An Braeken, Yuri Borissov, Svetla Nikova, Bart Preneel
    Classification of Boolean Functions of 6 Variables or Less with Respect to Some Cryptographic Properties. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:324-334 [Conf]
  6. Ventzislav Nikov, Svetla Nikova, Bart Preneel
    Robust Metering Schemes for General Access Structures. [Citation Graph (0, 0)][DBLP]
    ICICS, 2004, pp:53-65 [Conf]
  7. Svetla Nikova, Christian Rechberger, Vincent Rijmen
    Threshold Implementations Against Side-Channel Attacks and Glitches. [Citation Graph (0, 0)][DBLP]
    ICICS, 2006, pp:529-545 [Conf]
  8. Svetla Nikova, Ventzislav Nikov
    Improvement of the Delsarte Bound for tau-Designs in Finite Polynomial Metric Spaces. [Citation Graph (0, 0)][DBLP]
    IMA Int. Conf., 2001, pp:191-204 [Conf]
  9. Yuri Borissov, An Braeken, Svetla Nikova, Bart Preneel
    On the Covering Radius of Second Order Binary Reed-Muller Code in the Set of Resilient Boolean Functions. [Citation Graph (0, 0)][DBLP]
    IMA Int. Conf., 2003, pp:82-92 [Conf]
  10. Svetla Nikova, Ventzislav Nikov
    Some Applications of Bounds for Designs to the Cryptography. [Citation Graph (0, 0)][DBLP]
    IMA Int. Conf., 1999, pp:25-34 [Conf]
  11. An Braeken, Ventzislav Nikov, Svetla Nikova, Bart Preneel
    On Boolean Functions with Generalized Cryptographic Properties. [Citation Graph (0, 0)][DBLP]
    INDOCRYPT, 2004, pp:120-135 [Conf]
  12. Ventzislav Nikov, Svetla Nikova, Bart Preneel
    On Multiplicative Linear Secret Sharing Schemes. [Citation Graph (0, 0)][DBLP]
    INDOCRYPT, 2003, pp:135-147 [Conf]
  13. Ventzislav Nikov, Svetla Nikova, Bart Preneel, Joos Vandewalle
    On Unconditionally Secure Distributed Oblivious Transfer. [Citation Graph (0, 0)][DBLP]
    INDOCRYPT, 2002, pp:395-408 [Conf]
  14. Ventzislav Nikov, Svetla Nikova, Bart Preneel, Joos Vandewalle
    On Distributed Key Distribution Centers and Unconditionally Secure Proactive Verifiable Secret Sharing Schemes Based on General Access Structure. [Citation Graph (0, 0)][DBLP]
    INDOCRYPT, 2002, pp:422-436 [Conf]
  15. Ventzislav Nikov, Svetla Nikova
    On Proactive Secret Sharing Schemes. [Citation Graph (0, 0)][DBLP]
    Selected Areas in Cryptography, 2004, pp:308-325 [Conf]
  16. Yuri Borissov, Svetla Nikova, Bart Preneel, Joos Vandewalle
    On a Resynchronization Weakness in a Class of Combiners with Memory. [Citation Graph (0, 0)][DBLP]
    SCN, 2002, pp:164-173 [Conf]
  17. Ventzislav Nikov, Svetla Nikova, Bart Preneel
    On the Size of Monotone Span Programs. [Citation Graph (0, 0)][DBLP]
    SCN, 2004, pp:249-262 [Conf]
  18. Ventzislav Nikov, Svetla Nikova
    On a Relation Between Verifiable Secret Sharing Schemes and a Class of Error-Correcting Codes. [Citation Graph (0, 0)][DBLP]
    WCC, 2005, pp:275-290 [Conf]
  19. Yuri Borissov, Nickolai Manev, Svetla Nikova
    On the Non-minimal Codewords in Binary Reed-Muller Codes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:128, n:1, pp:65-74 [Journal]
  20. Svetla Nikova, Ventzislav Nikov
    Improvement of the Delsarte Bound for t-Designs When It Is Not the Best Bound Possible. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:28, n:2, pp:201-222 [Journal]
  21. Peter Boyvalenkov, Danyo Danev, Svetla Nikova
    Nonexistence of Certain Spherical Designs of Odd Strengths and Cardinalities. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:21, n:1, pp:143-156 [Journal]
  22. An Braeken, Yuri Borissov, Svetla Nikova, Bart Preneel
    Classification of cubic (n-4)-resilient Boolean functions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:4, pp:1670-1676 [Journal]
  23. Yuri Borissov, An Braeken, Svetla Nikova, Bart Preneel
    On the covering radii of binary Reed-Muller codes in the set of resilient Boolean functions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:3, pp:1182-1189 [Journal]

  24. Secure Hardware Implementation of Non-linear Functions in the Presence of Glitches. [Citation Graph (, )][DBLP]


  25. Towards Secure and Practical MACs for Body Sensor Networks. [Citation Graph (, )][DBLP]


  26. Using Normal Bases for Compact Hardware Implementations of the AES S-Box. [Citation Graph (, )][DBLP]


  27. Searching Keywords with Wildcards on Encrypted Data. [Citation Graph (, )][DBLP]


  28. Mediated Ciphertext-Policy Attribute-Based Encryption and Its Application. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.303secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002