2005 |
25 | EE | Gregory A. Kabatiansky,
Ben J. M. Smeets:
Authentication.
Encyclopedia of Cryptography and Security 2005 |
2001 |
24 | EE | Nicklas Ekstrand,
Bela Rathonyi,
Yuri M. Shtarkov,
Ben J. M. Smeets:
The Qualitative Modeling and Compression of the Request Sequences in ARQ Protocols.
Data Compression Conference 2001: 494 |
2000 |
23 | EE | Nicklas Ekstrand,
Ben J. M. Smeets:
Some Notes on the Context Mapping Function in Lossless Data Compression.
Data Compression Conference 2000: 553 |
22 | EE | Vladimor V. Chepyzhov,
Thomas Johansson,
Ben J. M. Smeets:
A Simple Algorithm for Fast Correlation Attacks on Stream Ciphers.
FSE 2000: 181-195 |
1999 |
21 | | Patrik Ekdahl,
Ben J. M. Smeets:
Incremental Authentication of Tree-Structured Documents.
ICICS 1999: 275-283 |
1998 |
20 | EE | Jan Åberg,
Yuri M. Shtarkov,
Ben J. M. Smeets:
Non-Uniform PPM and Context Tree Models.
Data Compression Conference 1998: 279-288 |
19 | EE | Nicklas Ekstrand,
Ben J. M. Smeets:
Weighting of Double Exponential Distributed Data in Lossless Image Compression.
Data Compression Conference 1998: 543 |
18 | | Marten van Dijk,
Christian Gehrmann,
Ben J. M. Smeets:
Unconditionally Secure Group Authentication.
Des. Codes Cryptography 14(3): 281-296 (1998) |
1997 |
17 | | Jan Åberg,
Yuri M. Shtarkov,
Ben J. M. Smeets:
Towards Understanding and Improving Escape Probabilities in PPM.
Data Compression Conference 1997: 22-31 |
16 | EE | Valentine Afanassiev,
Christian Gehrmann,
Ben J. M. Smeets:
Fast Message Authentication Using Efficient Polynomial Evaluation.
FSE 1997: 190-204 |
15 | | Gregory Kabatianskii,
E. Krouk,
Ben J. M. Smeets:
A Digital Signature Scheme Based on Random Error-Correcting Codes.
IMA Int. Conf. 1997: 161-167 |
1996 |
14 | | Gregory Kabatianskii,
Ben J. M. Smeets,
Thomas Johansson:
On the cardinality of systematic authentication codes via error-correcting codes.
IEEE Transactions on Information Theory 42(2): 566-578 (1996) |
1994 |
13 | EE | Thomas Johansson,
Ben J. M. Smeets:
On A²-Codes Including Arbiter's Attacks.
EUROCRYPT 1994: 456-460 |
12 | | Zhe-xian Wan,
Ben J. M. Smeets,
Peter Vanroose:
On the construction of cartesian authentication codes over symplectic spaces.
IEEE Transactions on Information Theory 40(3): 920- (1994) |
11 | | Ben J. M. Smeets:
Bounds on the probability of deception in multiple authentication.
IEEE Transactions on Information Theory 40(5): 1586- (1994) |
1993 |
10 | EE | Jürgen Bierbrauer,
Thomas Johansson,
Gregory Kabatianskii,
Ben J. M. Smeets:
On Families of Hash Functions via Geometric Codes and Concatenation.
CRYPTO 1993: 331-342 |
9 | EE | Thomas Johansson,
Gregory Kabatianskii,
Ben J. M. Smeets:
On the Relation between A-Codes and Codes Correcting Independent Errors.
EUROCRYPT 1993: 1-11 |
1992 |
8 | | Vladimir V. Chepyzhov,
Ben J. M. Smeets,
Kamil Sh. Zigangirov:
The free distance of fixed convolutional rate 2/4 codes meets the Costello bound.
IEEE Transactions on Information Theory 38(4): 1360- (1992) |
1991 |
7 | EE | Vladimor V. Chepyzhov,
Ben J. M. Smeets:
On A Fast Correlation Attack on Certain Stream Ciphers.
EUROCRYPT 1991: 176-185 |
1990 |
6 | EE | Ben J. M. Smeets,
Peter Vanroose,
Zhe-xian Wan:
On the Construction of Authentication Codes With Secrecy and Codes Withstanding Spoofing Attacks of Order L >= 2.
EUROCRYPT 1990: 306-312 |
1988 |
5 | EE | Ben J. M. Smeets,
William G. Chambers:
Windmill Generators: A Generalization and an Observation of How Many There Are.
EUROCRYPT 1988: 325-330 |
1986 |
4 | | Bernhard Smeets:
Some Properties of Sequences Generated by a Windmill Machine.
EUROCRYPT 1986: 37 |
1985 |
3 | EE | Bernhard Smeets:
A Note On Sequences Generated by Clock Controlled Shift Registers.
EUROCRYPT 1985: 142-148 |
2 | EE | Bernhard Smeets:
A Comment on Niederreiter's Public Key Cryptosystem.
EUROCRYPT 1985: 40-42 |
1984 |
1 | EE | Ben J. M. Smeets:
On the Use of the Binary Multiplying Channel in a Private Communication System.
EUROCRYPT 1984: 339-348 |