Sciweavers

INDOCRYPT
2001
Springer
14 years 4 months ago
A New Anonymous Fingerprinting Scheme with High Enciphering Rate
We propose a new anonymous fingerprinting scheme using Okamoto-Uchiyama cryptosystem[1]. In the previous schemes[2]-[4] the enciphering rate is so small that it seems very difficu...
Minoru Kuribayashi, Hatsukazu Tanaka
INDOCRYPT
2001
Springer
14 years 4 months ago
Elliptic Curves of Prime Order over Optimal Extension Fields for Use in Cryptography
We present an algorithm for generating elliptic curves of prime order over Optimal Extension Fields suitable for use in cryptography. The algorithm is based on the theory of Comple...
Harald Baier
INDOCRYPT
2001
Springer
14 years 4 months ago
Mobile Agent Route Protection through Hash-Based Mechanisms
Abstract. One approach to secure mobile agent execution is restricting the agent route to trusted environments. A necessary condition for this approach to be practical is that the ...
Josep Domingo-Ferrer
IMA
2001
Springer
90views Cryptology» more  IMA 2001»
14 years 4 months ago
Key Recovery Scheme Interoperability - A Protocol for Mechanism Negotiation
This paper investigates interoperability problems arising from the use of dissimilar key recovery mechanisms in encrypted communications. The components that can cause interoperabi...
Konstantinos Rantos, Chris J. Mitchell
IMA
2001
Springer
78views Cryptology» more  IMA 2001»
14 years 4 months ago
Unconditionally Secure Key Agreement Protocol
Abstract. The key agreement protocol are either based on some computational infeasability, such as the calculus of the discrete logarithm in [1], or on theoretical impossibility un...
Cyril Prissette
IMA
2001
Springer
80views Cryptology» more  IMA 2001»
14 years 4 months ago
Spectrally Bounded Sequences, Codes, and States: Graph Constructions and Entanglement
A recursive construction is provided for sequence sets which possess good Hamming Distance and low Peak-to-Average Power Ratio (PAR) under any Local Unitary Unimodular Transform. W...
Matthew G. Parker
IMA
2001
Springer
69views Cryptology» more  IMA 2001»
14 years 4 months ago
Generating Large Instances of the Gong-Harn Cryptosystem
Kenneth J. Giuliani, Guang Gong
IMA
2001
Springer
134views Cryptology» more  IMA 2001»
14 years 4 months ago
Almost-Certainly Runlength-Limiting Codes
Standard runlength-limiting codes – nonlinear codes defined by trellises – have the disadvantage that they disconnect the outer errorcorrecting code from the bit-by-bit likeli...
David J. C. MacKay
IMA
2001
Springer
91views Cryptology» more  IMA 2001»
14 years 4 months ago
The Wide Trail Design Strategy
n, important for interoperability only. We can make abstraction from the representation of the elements of GF(28 ) and consider a block cipher that operates on strings of elements ...
Joan Daemen, Vincent Rijmen
IMA
2001
Springer
117views Cryptology» more  IMA 2001»
14 years 4 months ago
An Identity Based Encryption Scheme Based on Quadratic Residues
We present a novel public key cryptosystem in which the public key of a subscriber can be chosen to be a publicly known value, such as his identity. We discuss the security of the ...
Clifford Cocks