Sciweavers

IMA
1995
Springer
97views Cryptology» more  IMA 1995»
14 years 3 months ago
A New Algorithm for Finding Minimum-Weight Words in Large Linear Codes
An algorithm for finding small-weight words in large linear codes is developed and a precise analysis of its complexity is given. It is in particular able to decode random [512,256...
Anne Canteaut
IMA
1995
Springer
92views Cryptology» more  IMA 1995»
14 years 3 months ago
On-Line Secret Sharing
Christian Cachin
IMA
1995
Springer
168views Cryptology» more  IMA 1995»
14 years 3 months ago
The Main Conjecture for MDS Codes
J. W. P. Hirschfeld
IMA
1997
Springer
88views Cryptology» more  IMA 1997»
14 years 3 months ago
Increasing Efficiency of International Key Escrow in Mutually Mistrusting Domains
This paper is concerned with key escrow protocols for use in international communications environments, where communication domains do not necessarily trust one another. It is conc...
Keith M. Martin
EUROCRYPT
1995
Springer
14 years 3 months ago
Fair Blind Signatures
Abstract. A blind signature scheme is a protocol for obtaining a signature from a signer such that the signer's view of the protocol cannot be linked to the resulting message-...
Markus Stadler, Jean-Marc Piveteau, Jan Camenisch
EUROCRYPT
1995
Springer
14 years 3 months ago
Ripping Coins For a Fair Exchange
Markus Jakobsson
EUROCRYPT
1995
Springer
14 years 3 months ago
A Generalization of Linear Cryptanalysis and the Applicability of Matsui's Piling-Up Lemma
Matsui's linear cryptanalysis for iterated block ciphers is generalized by replacing his linear expressions with I O sums. For a single round, an I O sum is the XOR of a balan...
Carlo Harpes, Gerhard G. Kramer, James L. Massey
EUROCRYPT
1995
Springer
14 years 3 months ago
Verifiable Signature Sharing
Abstract. We introduce Verifiable Signature Sharing (VCS), a cryptographic primitive for protecting digital signatures. VCS enables the holder of a digitally signed document, who m...
Matthew K. Franklin, Michael K. Reiter