FEEDBACK Smiley face
Normal view MARC view ISBD view

Advances in Cryptology — EUROCRYPT ’99 [electronic resource] :International Conference on the Theory and Application of Cryptographic Techniques Prague, Czech Republic, May 2–6, 1999 Proceedings /

Contributor(s): Stern, Jacques [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 1592Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1999.Description: XII, 480 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540489108.Subject(s): Computer science | Computer communication systems | Data encryption (Computer science) | Algorithms | Computer science -- Mathematics | Computer mathematics | Computer Science | Data Encryption | Discrete Mathematics in Computer Science | Algorithm Analysis and Problem Complexity | Computer Communication Networks | Computational Mathematics and Numerical AnalysisOnline resources: Click here to access online
Contents:
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.
In: Springer eBooks
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments for this item.

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in