TY  - BOOK
AU  - Stern,Jacques
ED  - SpringerLink (Online service)
TI  - Advances in Cryptology — EUROCRYPT ’99: International Conference on the Theory and Application of Cryptographic Techniques Prague, Czech Republic, May 2–6, 1999 Proceedings 
T2  - Lecture Notes in Computer Science,
SN  - 9783540489108
AV  - QA76.9.A25 
U1  - 005.82 23
PY  - 1999///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Computer Communication Networks
KW  - Data encryption (Computer science)
KW  - Computer software
KW  - Computational complexity
KW  - Mathematics
KW  - Computer Science
KW  - Data Encryption
KW  - Discrete Mathematics in Computer Science
KW  - Algorithm Analysis and Problem Complexity
KW  - Computational Mathematics and Numerical Analysis
N1  - Cryptanalysis I -- Cryptanalysis of RSA with Private Key d Less than N 0.292 -- Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials -- Hash Functions -- Software Performance of Universal Hash Functions -- Foundations I -- Lower Bounds for Oblivious Transfer Reductions -- On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions -- Conditional Oblivious Transfer and Timed-Release Encryption -- Public Key -- An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract) -- Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes -- Secure Hash-and-Sign Signatures Without the Random Oracle -- Watermarking and Fingerprinting -- A Note on the Limits of Collusion-Resistant Watermarks -- Coin-Based Anonymous Fingerprinting -- Elliptic Curve -- On the Performance of Hyperelliptic Cryptosystems -- Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic -- Comparing the MOV and FR Reductions in Elliptic Curve Cryptography -- New Schemes -- Unbalanced Oil and Vinegar Signature Schemes -- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes -- New Public Key Cryptosystems Based on the Dependent-RSA Problems -- Block Ciphers -- Resistance Against General Iterated Attacks -- XOR and Non-XOR Differential Probabilities -- S-boxes with Controllable Nonlinearity -- Distributed Cryptography -- Secure Distributed Key Generation for Discrete-Log Based Cryptosystems -- Efficient Multiparty Computations Secure Against an Adaptive Adversary -- Distributed Pseudo-random Functions and KDCs -- Cryptanalysis II -- Improved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes -- Cryptanalysis of an Identification Scheme Based on the Permuted Perceptron Problem -- Tools from Related areas -- An Analysis of Exponentiation Based on Formal Languages -- Dealing Necessary and Sufficient Numbers of Cards for Sharing a One-Bit Secret Key (Extended Abstract) -- Foundations IIz -- Computationally Private Information Retrieval with Polylogarithmic Communication -- On the Concurrent Composition of Zero-Knowledge Proofs -- Pseudorandom Function Tribe Ensembles Based on One-Way Permutations: Improvements and Applications -- Broadcast and Multicast -- Secure Communication in Broadcast Channels: The Answer to Franklin and Wright’s Question -- Efficient Communication-Storage Tradeoffs for Multicast Encryption
UR  - http://dx.doi.org/10.1007/3-540-48910-X
ER  -