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