---

＜電子ブック＞
Advances in Cryptology – EUROCRYPT ’95 : International Conference on the Theory and Application of Cryptographic Techniques, Saint-Malo, France, May 21–25, 1995 Proceedings / edited by Louis C. Guillou, Jean-Jacques Quisquater
(Lecture Notes in Computer Science. ISSN:16113349 ; 921)

版	1st ed. 1995.
出版者	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年	1995
本文言語	英語
大きさ	XIV, 417 p : online resource
著者標目	Guillou, Louis C editor Quisquater, Jean-Jacques editor SpringerLink (Online service)
件　名	LCSH:Cryptography LCSH:Data encryption (Computer science) LCSH:Coding theory LCSH:Information theory LCSH:Discrete mathematics LCSH:Computer networks  LCSH:Business information services LCSH:Number theory FREE:Cryptology FREE:Coding and Information Theory FREE:Discrete Mathematics FREE:Computer Communication Networks FREE:IT in Business FREE:Number Theory
一般注記	Cryptanalysis -- Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction -- Convergence in Differential Distributions -- A Generalization of Linear Cryptanalysis and the Applicability of Matsui’s Piling-up Lemma -- Signatures -- On the Efficiency of Group Signatures Providing Information-Theoretic Anonymity -- Verifiable Signature Sharing -- Server(Prover/Signer)-Aided Verification of Identity Proofs and Signatures -- Number Theory -- Counting the number of points on elliptic curves over finite fields: strategies and performances -- An Implementation of the General Number Field Sieve to Compute Discrete Logarithms mod p -- A Block Lanczos Algorithm for Finding Dependencies over GF(2) -- Protocol Aspects -- How to Break Another “Provably Secure” Payment System -- Quantum Oblivious Mutual Identification -- Securing Traceability of Ciphertexts — Towards a Secure Software Key Escrow System -- Secure Multiround Authentication Protocols -- Secret Sharing -- Verifiable Secret Sharing as Secure Computation -- Efficient Secret Sharing Without a Mutually Trusted Authority -- General Short Computational Secret Sharing Schemes -- Electronic Cash -- Fair Blind Signatures -- Ripping Coins for a Fair Exchange -- Restrictive Binding of Secret-Key Certificates -- Shift Registers and Boolean Functions -- Towards Fast Correlation Attacks on Irregularly Clocked Shift Registers -- Large Period Nearly deBruijn FCSR Sequences -- On Nonlinear Resilient Functions -- Authentication Codes -- Combinatorial Bounds for Authentication Codes with Arbitration -- New Hash Functions for Message Authentication -- A 2—codes from universal hash classes -- New Schemes -- A New Identification Scheme Based on the Perceptrons Problem -- Fast RSA-type Schemes Based on Singular Cubic Curves y 2 + axy ? x 3 (mod n) -- Complexity Aspects -- Relationships among the Computational Powers of Breaking Discrete Log Cryptosystems -- Universal Hash Functions & Hard Core Bits -- Recycling Random Bits in Composed Perfect Zero-Knowledge -- Implementation Aspects -- On the Matsumoto and Imai’s Human Identification Scheme -- Receipt-Free Mix-Type Voting Scheme -- Are Crypto-Accelerators Really Inevitable? -- Rump Session -- Anonymous NIZK Proofs of Knowledge with Preprocessing HTTP:URL=https://doi.org/10.1007/3-540-49264-X

 類似資料