UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Short Linkable Ring Signatures for E-Voting, E-Cash and Attestation

Information Security Practice and Experience, 2005, p.48-60

2005

Volltextzugriff (PDF)

Linkable Spontaneous Anonymous Group Signature for Ad Hoc Groups

Information Security and Privacy, 2004, Vol.3108, p.325-335

2004

Volltextzugriff (PDF)

Separable Linkable Threshold Ring Signatures

Lecture notes in computer science, 2004-01, p.384-398

2004

Volltextzugriff (PDF)

On equidistant constant weight codes

Discrete Applied Mathematics, 2003-05, Vol.128 (1), p.157-164

2003

Volltextzugriff (PDF)

Tracing-by-Linking Group Signatures

Information Security, 2005, p.149-163

1st ed, 2005

Volltextzugriff (PDF)

Fast and Proven Secure Blind Identity-Based Signcryption from Pairings

Lecture notes in computer science, 2005, p.305-322

2005

Volltextzugriff (PDF)

Blind Spontaneous Anonymous Group Signatures for Ad Hoc Groups

Lecture notes in computer science, 2005, p.82-94

2005

Volltextzugriff (PDF)

The redundancy of source coding with a fidelity criterion--part one: Known statistics

IEEE transactions on information theory, 1997-01, Vol.43 (1), p.71

1997

Volltextzugriff (PDF)

Group Signature Where Group Manager, Members and Open Authority Are Identity-Based

Information Security and Privacy, 2005, p.468-480

2005

Volltextzugriff (PDF)

A Separable Threshold Ring Signature Scheme

Information Security and Cryptology - ICISC 2003, 2004, Vol.2971, p.12-26

2004

Volltextzugriff (PDF)

An on-line universal lossy data compression algorithm via continuous codebook refinement--Part I: Basic results

IEEE transactions on information theory, 1996, Vol.42 (3), p.803-821

1996

Volltextzugriff (PDF)

On the constructions of highly nonlinear zigzag functions and unbiased functions

Information processing letters, 2001-07, Vol.79 (3), p.135-140

2001

Volltextzugriff (PDF)

On the generalized Hamming weights of product codes

IEEE transactions on information theory, 1993-09, Vol.39 (5), p.1709-1713

1993

Volltextzugriff (PDF)

On the capacity of write-unidirectional memories with nonperiodic codes

IEEE transactions on information theory, 2004-04, Vol.50 (4), p.649-656

2004

Volltextzugriff (PDF)

On the Svanstrom bound for ternary constant-weight codes

IEEE transactions on information theory, 2001-07, Vol.47 (5), p.2061-2064

2001

Volltextzugriff (PDF)

Defenses against the Truncation of Computation Results of Free-Roaming Agents

Information and Communications Security, 2002, Vol.2513, p.1-12

2002

Volltextzugriff (PDF)

On the minimum average distance of binary codes: linear programming approach

Discrete Applied Mathematics, 2001-08, Vol.111 (3), p.263-281

2001

Volltextzugriff (PDF)

Generalized Hamming weights for linear codes

IEEE transactions on information theory, 1991-09, Vol.37 (5), p.1412-1418

Wei, V.K.

1991

Volltextzugriff (PDF)

Simplified understanding and efficient decoding of a class of algebraic-geometric codes

IEEE transactions on information theory, 1994-07, Vol.40 (4), p.981-1002

1994

Volltextzugriff (PDF)

Ring signatures without random oracles

Conference on Computer and Communications Security: Proceedings of the 2006 ACM Symposium on Information, computer and communications security; 21-24 Mar. 2006, 2006, p.297-302

2006

Volltextzugriff (PDF)

Constructions of permutation arrays

IEEE transactions on information theory, 2002-04, Vol.48 (4), p.977-980

2002

Volltextzugriff (PDF)

Invisible designated confirmer signatures without random oracles

Conference on Computer and Communications Security: Proceedings of the 2nd ACM symposium on Information, computer and communications security; 20-22 Mar. 2007, 2007, p.356-358

2007

Volltextzugriff (PDF)

Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions

Mathematics of operations research, 1990-11, Vol.15 (4), p.736-748

1990

Volltextzugriff (PDF)

Improved lower bounds on the sizes of error-correcting codes for list decoding

IEEE transactions on information theory, 1994-03, Vol.40 (2), p.558-563

1994

Volltextzugriff (PDF)

Intersection graphs of paths in a tree

Journal of combinatorial theory. Series B, 1986-10, Vol.41 (2), p.141-181

1986

Volltextzugriff (PDF)

1 – 25 von 365

Menü

Weitere Dienste

Einstellungen

Short Linkable Ring Signatures for E-Voting, E-Cash and Attestation

Linkable Spontaneous Anonymous Group Signature for Ad Hoc Groups

Separable Linkable Threshold Ring Signatures

On equidistant constant weight codes

Tracing-by-Linking Group Signatures

Fast and Proven Secure Blind Identity-Based Signcryption from Pairings

Blind Spontaneous Anonymous Group Signatures for Ad Hoc Groups

The redundancy of source coding with a fidelity criterion--part one: Known statistics

Group Signature Where Group Manager, Members and Open Authority Are Identity-Based

A Separable Threshold Ring Signature Scheme

An on-line universal lossy data compression algorithm via continuous codebook refinement--Part I: Basic results

On the constructions of highly nonlinear zigzag functions and unbiased functions

On the generalized Hamming weights of product codes

On the capacity of write-unidirectional memories with nonperiodic codes

On the Svanstrom bound for ternary constant-weight codes

Defenses against the Truncation of Computation Results of Free-Roaming Agents

On the minimum average distance of binary codes: linear programming approach

Generalized Hamming weights for linear codes

Simplified understanding and efficient decoding of a class of algebraic-geometric codes

Ring signatures without random oracles

Constructions of permutation arrays

Invisible designated confirmer signatures without random oracles

Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions

Improved lower bounds on the sizes of error-correcting codes for list decoding

Intersection graphs of paths in a tree

Suchergebnisse filtern