Advances in Cryptology - EUROCRYPT '99 International Conference on the Theory and Application of Cryptographic Techniques, Prague, Czech Republic, May 2-6, 1999, Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Stern, Jacques (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1999.
Έκδοση:1st ed. 1999.
Σειρά:Lecture Notes in Computer Science, 1592
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 05032nam a2200565 4500
001 978-3-540-48910-8
003 DE-He213
005 20191023192430.0
007 cr nn 008mamaa
008 121227s1999 gw | s |||| 0|eng d
020 |a 9783540489108  |9 978-3-540-48910-8 
024 7 |a 10.1007/3-540-48910-X  |2 doi 
040 |d GrThAP 
050 4 |a QA76.9.D335 
072 7 |a GPJ  |2 bicssc 
072 7 |a COM053000  |2 bisacsh 
072 7 |a GPJ  |2 thema 
072 7 |a URY  |2 thema 
082 0 4 |a 005.82  |2 23 
245 1 0 |a Advances in Cryptology - EUROCRYPT '99  |h [electronic resource] :  |b International Conference on the Theory and Application of Cryptographic Techniques, Prague, Czech Republic, May 2-6, 1999, Proceedings /  |c edited by Jacques Stern. 
250 |a 1st ed. 1999. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 1999. 
300 |a XII, 480 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 1592 
505 0 |a 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. 
650 0 |a Data encryption (Computer science). 
650 0 |a Computer science-Mathematics. 
650 0 |a Algorithms. 
650 0 |a Computer communication systems. 
650 0 |a Computer mathematics. 
650 1 4 |a Cryptology.  |0 http://scigraph.springernature.com/things/product-market-codes/I28020 
650 2 4 |a Discrete Mathematics in Computer Science.  |0 http://scigraph.springernature.com/things/product-market-codes/I17028 
650 2 4 |a Algorithm Analysis and Problem Complexity.  |0 http://scigraph.springernature.com/things/product-market-codes/I16021 
650 2 4 |a Computer Communication Networks.  |0 http://scigraph.springernature.com/things/product-market-codes/I13022 
650 2 4 |a Computational Mathematics and Numerical Analysis.  |0 http://scigraph.springernature.com/things/product-market-codes/M1400X 
700 1 |a Stern, Jacques.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783662211007 
776 0 8 |i Printed edition:  |z 9783540658894 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 1592 
856 4 0 |u https://doi.org/10.1007/3-540-48910-X  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
912 |a ZDB-2-BAE 
950 |a Computer Science (Springer-11645)