|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-540-78524-8 |
| 003 |
DE-He213 |
| 005 |
20220114225140.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2008 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540785248
|9 978-3-540-78524-8
|
| 024 |
7 |
|
|a 10.1007/978-3-540-78524-8
|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 Theory of Cryptography
|h [electronic resource] :
|b Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008, Proceedings /
|c edited by Ran Canetti.
|
| 250 |
|
|
|a 1st ed. 2008.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2008.
|
| 300 |
|
|
|a XII, 645 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 4948
|
| 505 |
0 |
|
|a Technical Session 1 -- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency -- On Seed-Incompressible Functions -- Technical Session 2 -- Asymptotically Efficient Lattice-Based Digital Signatures -- Basing Weak Public-Key Cryptography on Strong One-Way Functions -- Technical Session 3 -- Which Languages Have 4-Round Zero-Knowledge Proofs? -- How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge -- General Properties of Quantum Zero-Knowledge Proofs -- Technical Session 4 -- The Layered Games Framework for Specifications and Analysis of Security Protocols -- Universally Composable Multi-party Computation with an Unreliable Common Reference String -- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries -- Fast Private Norm Estimation and Heavy Hitters -- Technical Session 5 -- Matroids Can Be Far from Ideal Secret Sharing -- Perfectly-Secure MPC with Linear Communication Complexity -- MPC vs. SFE: Perfect Security in a Unified Corruption Model -- Invited Talk -- Bridging Game Theory and Cryptography: Recent Results and Future Directions -- Technical Session 6 -- Verifiably Secure Devices -- Lower Bounds on Implementing Robust and Resilient Mediators -- Cryptography and Game Theory: Designing Protocols for Exchanging Information -- Technical Session 7 -- Equivocal Blind Signatures and Adaptive UC-Security -- P-signatures and Noninteractive Anonymous Credentials -- Technical Session 8 -- Multi-property Preserving Combiners for Hash Functions -- OT-Combiners via Secure Computation -- Semi-honest to Malicious Oblivious Transfer-The Black-Box Way -- Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One -- Technical Session 9 -- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval -- Randomness Extraction Via ?-Biased Masking in the Presence of a Quantum Attacker -- Technical Session 10 -- An Equivalence Between Zero Knowledge and Commitments -- Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model -- Technical Session 11 -- The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization -- On Constant-Round Concurrent Zero-Knowledge -- Technical Session 12 -- Concurrent Non-malleable Commitments from Any One-Way Function -- Faster and Shorter Password-Authenticated Key Exchange -- Technical Session 13 -- Saving Private Randomness in One-Way Functions and Pseudorandom Generators -- Degradation and Amplification of Computational Hardness.
|
| 650 |
|
0 |
|a Cryptography.
|
| 650 |
|
0 |
|a Data encryption (Computer science).
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer science-Mathematics.
|
| 650 |
|
0 |
|a Discrete mathematics.
|
| 650 |
|
0 |
|a Data protection.
|
| 650 |
|
0 |
|a Electronic data processing-Management.
|
| 650 |
|
0 |
|a Computers and civilization.
|
| 650 |
1 |
4 |
|a Cryptology.
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Data and Information Security.
|
| 650 |
2 |
4 |
|a IT Operations.
|
| 650 |
2 |
4 |
|a Computers and Society.
|
| 700 |
1 |
|
|a Canetti, Ran.
|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 9783540847755
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540785231
|
| 830 |
|
0 |
|a Security and Cryptology ;
|v 4948
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-540-78524-8
|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)
|
