Del 403 - Lecture Notes in Computer Science

Advances in Cryptology - CRYPTO '88

Proceedings

Häftad, Engelska, 1990

Av Shafi Goldwasser

709 kr

Beställningsvara. Skickas inom 7-10 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

Produktinformation

Utgivningsdatum1990-03-13
Mått155 x 235 x 32 mm
Vikt908 g
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor591
Upplaga1990
FörlagSpringer-Verlag New York Inc.
EAN9780387971964

Du kanske också är intresserad av

Complexity of Lattice Problems

Del 671

Complexity of Lattice Problems

Daniele Micciancio, Shafi Goldwasser

3 469 kr

Complexity of Lattice Problems

Complexity of Lattice Problems

Daniele Micciancio, Shafi Goldwasser

3 469 kr

De fenomenala fruntimren på Grand Hôtel

4 pocket för 3

Del 1

De fenomenala fruntimren på Grand Hôtel

Ruth Kvarnström-Jones

125 kr

Kvinnorna

4 pocket för 3

Kvinnorna

125 kr

Charlies hämnd

Nyhet

Del 1

Charlies hämnd

Simona Ahrnstedt

79 kr125 kr

Väninnorna på Nordiska Kompaniet

Nyhet

Del 2

Väninnorna på Nordiska Kompaniet

Ruth Kvarnström-Jones

79 kr125 kr

Den yttersta hemligheten

Nyhet

Del 6

Den yttersta hemligheten

329 kr

Sly

4 pocket för 3

Del 1

Sly

Sara Strömberg

115 kr

Klenoden

Nyhet

Klenoden

Klas Östergren

329 kr

Gråterskan

Nyhet

Del 12

Gråterskan

Camilla Läckberg

289 kr319 kr

Tillhör följande kategorier

Tillämpad matematik inom Naturvetenskap och teknik
Matematisk statistik inom Naturvetenskap och teknik
Hårdvara inom Data och it
Referensverk och tvärvetenskap inom Samhalle och politik
Affärsapplikationer inom Data och it
Affärsförhandlingar inom Ekonomi och ledarskap
IT-säkerhet inom Data och it

Cryptographic Primitives.- Weakening Security Assumptions and Oblivious Transfer.- Limits on the Provable Consequences of One-way Permutations.- Generalized Secret Sharing and Monotone Functions.- Zero-Knowledge.- Everything Provable is Provable in Zero-Knowledge.- A Perfect Zero-Knowledge Proof for a Problem Equivalent to Discrete Logarithm.- Zero-Knowledge With Finite State Verifiers.- Number Theory.- Intractable Problems in Number Theory.- A Family of Jacobians Suitable for Discrete Log Cryptosystems.- Computation of Approximate L-th Roots Modulo n and Application to Cryptography.- Cryptanalysis.- On the McEliece Public-Key Cryptosystem.- A Constraint Satisfaction Algorithm for the Automated Decryption of Simple Substitution Ciphers.- Pseudorandomness.- On the Existence of Pseudorandom Generators.- On The Randomness of Legendre and Jacobi Sequences.- Efficient, Perfect Random Number Generators.- Signatures and Authentication.- How To Sign Given Any Trapdoor Function.- A “Paradoxical” Indentity-Based Signature Scheme Resulting from Zero-Knowledge.- A Modification of the Fiat-Shamir Scheme.- An Improvement of the Fiat-Shamir Identification and Signature Scheme.- On the Theory of Security I.- A Basic Theory of Public and Private Cryptosystems.- Proving Security Against Chosen Ciphertext Attacks.- Non-Interactive Zero-Knowledge with Preprocessing.- On the Theory of Security II.- The Noisy Oracle Problem.- On Generating Solved Instances of Computational Problems.- Bounds and Constructions for Authentication - Secrecy Codes with Splitting.- Protocols.- Untraceable Electronic Cash.- Payment Systems and Credential Mechanisms with Provable Security Against Abuse by Individuals.- A Universal Problem in Secure and Verifiable Distributed Computation.- Security Concerns.- AnAbstract Theory of Computer Viruses.- Abuses in Cryptography and How to Fight Them.- How to (Really) Share a Secret.- Linear Complexity.- The Strict Avalanche Criterion: Spectral Properties of Boolean Functions and an Extended Definition.- On the Linear Syndrome Method in Cryptanalysis.- Aperiodic Linear Complexities of de Bruijn Sequences.- Systems.- The Application of Smart Cards for Rsa Digital Signatures in a Network Comprising Both Interactive and Store-and-Forward Facilities.- Speeding Up Secret Computations with Insecure Auxiliary Devices.- Developing Ethernet Enhanced-Security System.- A Secure Audio Teleconference System.- Short Rump Session Presentations.- Diffie-Hellman is as Strong as Discrete Log for Certain Primes.- Secret Error-Correcting Codes (SECC).- The Detection of Cheaters in Threshold Schemes.- On the Power of 1-way Functions.- “Practical IP” ? MA.- Zero-Knowledge Authentication Scheme with Secret Key Exchange.