- A Weakness in Some Oblivious Transfer and Zero-Knowledge Protocols
- Secure Hardware Implementation of Non-Linear Functions in the Presence of Glitches
- A Modification of Jarecki and Saxena Proactive RSA Signature Scheme
- Strongly Multiplicative Hierarchical Threshold Secret Sharing
- Threshold Implementations Against Side-Channel Attacks and Glitches
- On Primitive Polynomials over GF(2) the Duals of which are also
- Classification of Boolean Functions of 6 Variables or Less with Respect to Some
- CLASSIFICATION OF CUBIC BOOLEAN FUNCTIONS IN 7 An Braeken, Svetla Nikova
- On the Non-Minimal codewords of weight 2dmin in the binary Reed-Muller Code
- Extremal polynomials of degree + 2 and + 3, which improve the Delsarte bound for -designs
- Nonexistence of Certain Spherical Designs of Odd Strengths and Cardinalities
- Necessary and sufficient conditions for improving the Delsarte bound for -designs
- New lower bounds for some spherical designs Peter Boyvalenkov, Svetla Nikova
- Bounds for Designs in Infinite Polynomial Metric Spaces
- Some Applications of Bounds for Designs to the Cryptography
- Extremal Polynomials for Codes in Polynomial Metric Spaces
- Improvement of the Delsarte Bound for -designs in Finite Polynomial Metric Spaces
- Improvement of the Delsarte bound for -designs when it is not the best bound
- On a Resynchronization Weakness in a Class of Combiners with Memory
- On Unconditionally Secure Distributed Oblivious Transfer
- ISIT 2003, Yokohama, Japan, June 29 July 4, 2003 Upper Bound for the Size of Monotone Span Programs
- Multi-Party Computation from any Linear Secret Sharing Scheme Unconditionally Secure
- COVERING RADIUS OF THE (N -3)-RD ORDER REED-MULLER CODE IN THE SET OF RESILIENT FUNCTIONS
- On Proactive Secret Sharing Schemes Ventzislav Nikov1
- Robust Metering Schemes for General Access Structures
- Zigzag Functions and Related Objects in New Metric An Braeken1, Ventzislav Nikov2, and Svetla Nikova1
- On a Relation Between Verifiable Secret Sharing and a Class of Error-Correcting Codes
- Error-Set Codes and Related Objects An Braeken1, Ventzislav Nikov2, and Svetla Nikova1
- On Secret Sharing Schemes Svetla Nikova
- Using Normal Bases for Compact Hardware Implementations of the AES S-box
- The Lane hash function Department of Electrical Engineering ESAT/SCD-COSIC,
- On Multiplicative Linear Secret Sharing Schemes Ventzislav Nikov1 , Svetla Nikova2 , and Bart Preneel2
- Operations on Access Structures (Corrected Version)
- On Metering Schemes Ventzislav Nikov
- On antipodal spherical 5-designs with + n + 4 points
- ISIT2001, Washington, DC, June 2429, 2001 On the Non-Minimal codewords in the binary Reed-Muller Code
- Practical RSA Threshold Decryption for Things Roel Peeters , Svetla Nikova, and Bart Preneel
- Some Characterizations of Spherical Designs with Small Cardinalities
- On the Non-Minimal Codewords in Binary Reed-Muller Codes
- Improvements of the lower bounds on the size of some spherical designs
- On bounds on the size of designs in complex projective spaces
- IEEE TRANSACTION ON INFORMATION THEORY, VOL.51 , NO.3 , 2004 1 On the Covering Radii of Binary Reed-Muller
- On Lower Bounds on the Size of Designs in Compact Symmetric Spaces of Rank 1
- On Multiplicative Secret Sharing Schemes Realizing Graph Access Structures
- On Distributed Key Distribution Centers and Unconditionally Secure Proactive Verifiable
- On the Covering Radius of Second Order Binary Reed-Muller Code in the Set of Resilient
- On the Size of Monotone Span Programs Ventzislav Nikov1