|
|
|
|
| LEADER |
00000cam a2200000Ia 4500 |
| 001 |
3780347 |
| 005 |
20160422170545.6 |
| 008 |
990508s1999 gw b 000 0 eng d |
| 003 |
ICU |
| 020 |
|
|
|a 3540658890
|
| 035 |
|
|
|a (OCoLC)41327093
|
| 040 |
|
|
|a EUE
|c EUE
|d ORU
|d OrLoB-B
|d ICU
|d OCoLC
|
| 049 |
|
|
|a CGUA
|
| 090 |
|
|
|a QA76.9.A25
|b E964 1999
|
| 111 |
2 |
|
|a EUROCRYPT
|d (1999 :
|c Prague)
|1 http://viaf.org/viaf/266493979
|
| 245 |
1 |
0 |
|a Advances in cryptology, EUROCRYPT '99 :
|b International Conference on the Theory and Application of Cryptographic Techniques, Prague, Czech Republic, May 2-6, 1999 : proceedings /
|c Jacques Stern, ed.
|
| 246 |
1 |
3 |
|a EUROCRYPT '99
|
| 260 |
|
|
|a Berlin :
|b Springer,
|c c1999.
|
| 300 |
|
|
|a xii, 474 p. ;
|c 24 cm.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|0 http://id.loc.gov/vocabulary/contentTypes/txt
|
| 337 |
|
|
|a unmediated
|b n
|2 rdamedia
|0 http://id.loc.gov/vocabulary/mediaTypes/n
|
| 338 |
|
|
|a volume
|b nc
|2 rdacarrier
|0 http://id.loc.gov/vocabulary/carriers/nc
|
| 440 |
|
0 |
|a Lecture notes in computer science
|v 1592
|
| 504 |
|
|
|a Includes bibliographical references.
|
| 505 |
0 |
0 |
|t Cryptanalysis of RSA with Private Key d Less than N[superscript 0.292] /
|r Dan Boneh and Glenn Durfee --
|t Differentials /
|r Eli Biham, Alex Biryukov and Adi Shamir --
|t Software Performance of Universal Hash Functions /
|r Wim Nevelsteen and Bart Preneel --
|t Lower Bounds for Oblivious Transfer Reductions /
|r Yevgeniy Dodis and Silvio Micali --
|t On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions /
|r Ivan Damgard, Joe Kilian and Louis Salvail --
|t Conditional Oblivious Transfer and Timed-Release Encryption /
|r Giovanni Di Crescenzo, Rafail Ostrovsky and Sivaramakrishnan Rajagopalan --
|t An Efficient Threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack /
|r Ran Canetti and Shafi Goldwasser --
|t Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes /
|r Jan Camenisch and Markus Michels --
|t Secure Hash-and-Sign Signatures Without the Random Oracle /
|r Rosario Gennaro, Shai Halevi and Tal Rabin --
|t A Note on the Limits of Collusion-Resistant Watermarks /
|r Funda Ergun, Joe Kilian and Ravi Kumar --
|t Coin-Based Anonymous Fingerprinting /
|r Birgit Pfitzmann and Ahmad-Reza Sadeghi --
|t On the Performance of Hyperelliptic Cryptosystems /
|r Nigel P. Smart --
|t Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic /
|r Tetsutaro Kobayashi, Hikaru Morita and Kunio Kobayashi /
|r [et al.] --
|t Comparing the MOV and FR Reductions in Elliptic Curve Cryptography /
|r Ryuichi Harasawa, Junji Shikata and Joe Suzuki /
|r [et al.] --
|t Unbalanced Oil and Vinegar Signature Schemes /
|r Aviad Kipnis, Jacques Patarin and Louis Goubin --
|t Public-Key Cryptosystems Based on Composite Degree Residuosity Classes /
|r Pascal Paillier --
|t New Public Key Cryptosystems Based on the Dependent-RSA Problems /
|r David Pointcheval --
|t Resistance Against General Iterated Attacks /
|r Serge Vaudenay --
|t XOR and Non-XOR Differential Probabilities /
|r Philip Hawkes and Luke O'Connor --
|t S-boxes with Controllable Nonlinearity /
|r Jung Hee Cheon, Seongtaek Chee and Choonsik Park --
|t Secure Distributed Key Generation for Discrete-Log Based Cryptosystems /
|r Rosario Gennaro, Stanislaw Jarecki and Hugo Krawczyk /
|r [et al.] --
|t Efficient Multiparty Computations Secure Against an Adaptive Adversary /
|r Ronald Cramer, Ivan Damgard and Stefan Dziembowski /
|r [et al.] --
|t Distributed Pseudo-random Functions and KDCs /
|r Moni Naor, Benny Pinkas and Omer Reingold --
|t Improved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes /
|r Thomas Johansson and Fredrik Jonsson --
|t Cryptanalysis of an Identification Scheme Based on the Permuted Perceptron Problem /
|r Lars R. Knudsen and Willi Meier --
|t An Analysis of Exponentiation Based on Formal Languages /
|r Luke O'Connor --
|t Dealing Necessary and Sufficient Numbers of Cards for Sharing a One-Bit Secret Key /
|r Takaaki Mizuki, Hiroki Shizuya and Takao Nishizeki --
|t Computationally Private Information Retrieval with Polylogarithmic Communication /
|r Christian Cachin, Silvio Micali and Markus Stadler --
|t On the Concurrent Composition of Zero-Knowledge Proofs /
|r Ransom Richardson and Joe Kilian --
|t Pseudorandom Function Tribe Ensembles Based on One-Way Permutations: Improvements and Applications /
|r Marc Fischlin --
|t Secure Communication in Broadcast Channels: The Answer to Franklin and Wright's Question /
|r Yongge Wang and Yvo Desmedt --
|t Efficient Communication-Storage Tradeoffs for Multicast Encryption /
|r Ran Canetti, Tal Malkin and Kobbi Nissim.
|
| 530 |
|
|
|a Also available on the Internet.
|
| 650 |
|
0 |
|a Cryptography
|v Congresses.
|0 http://id.loc.gov/authorities/subjects/sh2008101157
|
| 650 |
|
0 |
|a Data encryption (Computer science)
|v Congresses.
|0 http://id.loc.gov/authorities/subjects/sh2008102033
|
| 650 |
|
7 |
|a Cryptography.
|2 fast
|0 http://id.worldcat.org/fast/fst00884552
|
| 650 |
|
7 |
|a Data encryption (Computer science)
|2 fast
|0 http://id.worldcat.org/fast/fst00887935
|
| 655 |
|
7 |
|a Conference papers and proceedings.
|2 fast
|0 http://id.worldcat.org/fast/fst01423772
|
| 700 |
1 |
|
|a Stern, Jacques,
|c professeur.
|1 http://viaf.org/viaf/94823154
|
| 856 |
4 |
1 |
|u http://link.springer.com/book/10.1007%2F3-540-48910-X
|
| 901 |
|
|
|a ToCBNA
|
| 903 |
|
|
|a HeVa
|
| 929 |
|
|
|a cat
|
| 999 |
f |
f |
|i 170f9950-650b-53d3-bce0-40fb7f76883d
|s 8fb2b6e2-0c67-5b04-acb6-dcef6b391ddf
|
| 928 |
|
|
|t Library of Congress classification
|a QA76.9.A25E964 1999
|l ASR
|c ASR-SciASR
|i 4176126
|
| 928 |
|
|
|t Library of Congress classification
|a QA76.9.A25E964 1999
|l Online
|c UC-FullText
|u http://link.springer.com/book/10.1007%2F3-540-48910-X
|g ebooks
|i 6927623
|
| 927 |
|
|
|t Library of Congress classification
|a QA76.9.A25E964 1999
|l ASR
|c ASR-SciASR
|e CRERAR
|b 50243475
|i 6216210
|
