| 2012 | ||
|---|---|---|
| c18 | Julia Borghoff, Anne Canteaut, Tim Güneysu, Elif Bilge Kavun, Miroslav Knezevic, Lars R. Knudsen, Gregor Leander, Ventzislav Nikov, Christof Paar, Christian Rechberger, Peter Rombouts, Søren S. Thomsen, Tolga Yalçin: PRINCE - A Low-Latency Block Cipher for Pervasive Computing Applications - Extended Abstract. ASIACRYPT 2012: 208-225 | |
| c17 | Begül Bilgin, Svetla Nikova, Ventzislav Nikov, Vincent Rijmen, Georg Stütz: Threshold Implementations of All 3 ×3 and 4 ×4 S-Boxes. CHES 2012: 76-91 | |
| c16 | Miroslav Knezevic, Ventzislav Nikov, Peter Rombouts: Low-Latency Encryption - Is "Lightweight = Light + Wait"? CHES 2012: 426-446 | |
| i13 | Begül Bilgin, Svetla Nikova, Ventzislav Nikov, Vincent Rijmen, Georg Stütz: Threshold Implementations of all 3x3 and 4x4 S-boxes. IACR Cryptology ePrint Archive 2012: 300 (2012) | |
| i12 | Julia Borghoff, Anne Canteaut, Tim Güneysu, Elif Bilge Kavun, Miroslav Knezevic, Lars R. Knudsen, Gregor Leander, Ventzislav Nikov, Christof Paar, Christian Rechberger, Peter Rombouts, Søren S. Thomsen, Tolga Yalçin: PRINCE - A Low-latency Block Cipher for Pervasive Computing Applications (Full version). IACR Cryptology ePrint Archive 2012: 529 (2012) | |
| 2010 | ||
| j2 | Paulo S. L. M. Barreto, Ventzislav Nikov, Svetla Nikova, Vincent Rijmen, Elmar Tischhauser: Whirlwind: a new cryptographic hash function. Des. Codes Cryptography 56(2-3): 141-162 (2010) | |
| 2008 | ||
| c15 | Ventzislav Nikov, Marc Vauclair: Yet Another Secure Distance-Bounding Protocol. SECRYPT 2008: 218-221 | |
| i11 | Ventzislav Nikov, Marc Vauclair: Yet Another Secure Distance-Bounding Protocol. IACR Cryptology ePrint Archive 2008: 319 (2008) | |
| 2006 | ||
| c14 | Ventzislav Nikov, Svetla Nikova, Bart Preneel: A Weakness in Some Oblivious Transfer and Zero-Knowledge Protocols. ASIACRYPT 2006: 348-363 | |
| c13 | ||
| i10 | Ventzislav Nikov, Svetla Nikova, Bart Preneel: A Weakness in Some Oblivious Transfer and Zero-Knowledge Protocols. IACR Cryptology ePrint Archive 2006: 363 (2006) | |
| i9 | Ventzislav Nikov: A DoS Attack Against the Integrity-Less ESP (IPSec). IACR Cryptology ePrint Archive 2006: 370 (2006) | |
| i8 | An Braeken, Ventzislav Nikov, Svetla Nikova: On Zigzag Functions and Related Objects in New Metric. IACR Cryptology ePrint Archive 2006: 437 (2006) | |
| 2005 | ||
| c12 | An Braeken, Ventzislav Nikov, Svetla Nikova: Error-Set Codes and Related Objects. COCOON 2005: 577-585 | |
| c11 | Ventzislav Nikov, Svetla Nikova: On a Relation Between Verifiable Secret Sharing Schemes and a Class of Error-Correcting Codes. WCC 2005: 275-290 | |
| 2004 | ||
| c10 | Ventzislav Nikov, Svetla Nikova, Bart Preneel: Robust Metering Schemes for General Access Structures. ICICS 2004: 53-65 | |
| c9 | An Braeken, Ventzislav Nikov, Svetla Nikova, Bart Preneel: On Boolean Functions with Generalized Cryptographic Properties. INDOCRYPT 2004: 120-135 | |
| c8 | Ventzislav Nikov, Svetla Nikova: On Proactive Secret Sharing Schemes. Selected Areas in Cryptography 2004: 308-325 | |
| c7 | Ventzislav Nikov, Svetla Nikova, Bart Preneel: On the Size of Monotone Span Programs. SCN 2004: 249-262 | |
| i7 | An Braeken, Svetla Nikova, Ventzislav Nikov: On Cheating Immune Secret Sharing. IACR Cryptology ePrint Archive 2004: 200 (2004) | |
| i6 | An Braeken, Ventzislav Nikov, Svetla Nikova, Bart Preneel: On Boolean Functions with Generalized Cryptographic Properties. IACR Cryptology ePrint Archive 2004: 259 (2004) | |
| i5 | Ventzislav Nikov, Svetla Nikova: New Monotone Span Programs from Old. IACR Cryptology ePrint Archive 2004: 282 (2004) | |
| 2003 | ||
| j1 | 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) | |
| c6 | 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 | |
| c5 | Ventzislav Nikov, Svetla Nikova, Bart Preneel: On Multiplicative Linear Secret Sharing Schemes. INDOCRYPT 2003: 135-147 | |
| i4 | Ventzislav Nikov, Svetla Nikova, Bart Preneel: Multi-Party Computation from any Linear Secret Sharing Scheme Secure against Adaptive Adversary: The Zero-Error Case. IACR Cryptology ePrint Archive 2003: 6 (2003) | |
| i3 | Ventzislav Nikov, Svetla Nikova: On a Relation Between Verifiable Secret Sharing Schemes and a Class of Error-Correcting Codes. IACR Cryptology ePrint Archive 2003: 210 (2003) | |
| 2002 | ||
| c4 | Ventzislav Nikov, Svetla Nikova, Bart Preneel, Joos Vandewalle: On Unconditionally Secure Distributed Oblivious Transfer. INDOCRYPT 2002: 395-408 | |
| c3 | 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 | |
| i2 | Ventzislav Nikov, Svetla Nikova, Bart Preneel, Joos Vandewalle: Applying General Access Structure to Metering Schemes. IACR Cryptology ePrint Archive 2002: 102 (2002) | |
| i1 | Ventzislav Nikov, Svetla Nikova, Bart Preneel, Joos Vandewalle: Applying General Access Structure to Proactive Secret Sharing Schemes. IACR Cryptology ePrint Archive 2002: 141 (2002) | |
| 2001 | ||
| c2 | Svetla Nikova, Ventzislav Nikov: Improvement of the Delsarte Bound for tau-Designs in Finite Polynomial Metric Spaces. IMA Int. Conf. 2001: 191-204 | |
| 1999 | ||
| c1 | Svetla Nikova, Ventzislav Nikov: Some Applications of Bounds for Designs to the Cryptography. IMA Int. Conf. 1999: 25-34 | |
Data released under the ODC-BY 1.0 license — See also our legal information page