|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-540-74143-5 |
| 003 |
DE-He213 |
| 005 |
20220115070810.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2007 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540741435
|9 978-3-540-74143-5
|
| 024 |
7 |
|
|a 10.1007/978-3-540-74143-5
|2 doi
|
| 050 |
|
4 |
|a QA268
|
| 072 |
|
7 |
|a GPJ
|2 bicssc
|
| 072 |
|
7 |
|a URY
|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.824
|2 23
|
| 245 |
1 |
0 |
|a Advances in Cryptology - CRYPTO 2007
|h [electronic resource] :
|b 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007, Proceedings /
|c edited by Alfred Menezes.
|
| 250 |
|
|
|a 1st ed. 2007.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2007.
|
| 300 |
|
|
|a XIV, 634 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 Security and Cryptology ;
|v 4622
|
| 505 |
0 |
|
|a Cryptanalysis I -- Practical Cryptanalysis of SFLASH -- Full Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5 -- Secure Searching -- How Should We Solve Search Problems Privately? -- Public Key Encryption That Allows PIR Queries -- Invited Talk -- Information Security Economics - and Beyond -- Theory I -- Cryptography with Constant Input Locality -- Universally-Composable Two-Party Computation in Two Rounds -- Indistinguishability Amplification -- Lattices -- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU -- Improved Analysis of Kannan's Shortest Lattice Vector Algorithm -- Random Oracles -- Domain Extension of Public Random Functions: Beyond the Birthday Barrier -- Random Oracles and Auxiliary Input -- Hash Functions -- Security-Amplifying Combiners for Collision-Resistant Hash Functions -- Hash Functions and the (Amplified) Boomerang Attack -- Amplifying Collision Resistance: A Complexity-Theoretic Treatment -- Theory II -- How Many Oblivious Transfers Are Needed for Secure Multiparty Computation? -- Simulatable VRFs with Applications to Multi-theorem NIZK -- Cryptography in the Multi-string Model -- Quantum Cryptography -- Secure Identification and QKD in the Bounded-Quantum-Storage Model -- A Tight High-Order Entropic Quantum Uncertainty Relation with Applications -- Cryptanalysis II -- Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach -- A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073 -- Encryption -- Invertible Universal Hashing and the TET Encryption Mode -- Reducing Trust in the PKG in Identity Based Cryptosystems -- Pirate Evolution: How to Make the Most of Your Traitor Keys -- Protocol Analysis -- A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator -- A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness -- Chernoff-Type Direct Product Theorems -- Public-Key Encryption -- Rerandomizable RCCA Encryption -- Deterministic and Efficiently Searchable Encryption -- Secure Hybrid Encryption from Weakened Key Encapsulation -- Multi-party Computation -- Scalable and Unconditionally Secure Multiparty Computation -- On Secure Multi-party Computation in Black-Box Groups -- A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra.
|
| 650 |
|
0 |
|a Cryptography.
|
| 650 |
|
0 |
|a Data encryption (Computer science).
|
| 650 |
|
0 |
|a Electronic data processing-Management.
|
| 650 |
|
0 |
|a Computer networks .
|
| 650 |
|
0 |
|a Data protection.
|
| 650 |
|
0 |
|a Computers and civilization.
|
| 650 |
|
0 |
|a Computer science-Mathematics.
|
| 650 |
|
0 |
|a Discrete mathematics.
|
| 650 |
1 |
4 |
|a Cryptology.
|
| 650 |
2 |
4 |
|a IT Operations.
|
| 650 |
2 |
4 |
|a Computer Communication Networks.
|
| 650 |
2 |
4 |
|a Data and Information Security.
|
| 650 |
2 |
4 |
|a Computers and Society.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 700 |
1 |
|
|a Menezes, Alfred.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540842095
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540741428
|
| 830 |
|
0 |
|a Security and Cryptology ;
|v 4622
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-540-74143-5
|z Texto Completo
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
