000 | 05023nam a22006495i 4500 | ||
---|---|---|---|
001 | 978-3-540-78524-8 | ||
003 | DE-He213 | ||
005 | 20240730182835.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2008 gw | s |||| 0|eng d | ||
020 |
_a9783540785248 _9978-3-540-78524-8 |
||
024 | 7 |
_a10.1007/978-3-540-78524-8 _2doi |
|
050 | 4 | _aQA268 | |
072 | 7 |
_aGPJ _2bicssc |
|
072 | 7 |
_aURY _2bicssc |
|
072 | 7 |
_aCOM083000 _2bisacsh |
|
072 | 7 |
_aGPJ _2thema |
|
072 | 7 |
_aURY _2thema |
|
082 | 0 | 4 |
_a005.824 _223 |
245 | 1 | 0 |
_aTheory of Cryptography _h[electronic resource] : _bFifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008, Proceedings / _cedited by Ran Canetti. |
250 | _a1st ed. 2008. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2008. |
|
300 |
_aXII, 645 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aSecurity and Cryptology, _x2946-1863 ; _v4948 |
|
505 | 0 | _aTechnical 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 |
_aCryptography. _91973 |
|
650 | 0 |
_aData encryption (Computer science). _99168 |
|
650 | 0 |
_aAlgorithms. _93390 |
|
650 | 0 |
_aComputer science _xMathematics. _93866 |
|
650 | 0 |
_aDiscrete mathematics. _912873 |
|
650 | 0 |
_aData protection. _97245 |
|
650 | 0 |
_aElectronic data processing _xManagement. _9129404 |
|
650 | 0 |
_aComputers and civilization. _921733 |
|
650 | 1 | 4 |
_aCryptology. _931769 |
650 | 2 | 4 |
_aAlgorithms. _93390 |
650 | 2 | 4 |
_aDiscrete Mathematics in Computer Science. _931837 |
650 | 2 | 4 |
_aData and Information Security. _931990 |
650 | 2 | 4 |
_aIT Operations. _931703 |
650 | 2 | 4 |
_aComputers and Society. _931668 |
700 | 1 |
_aCanetti, Ran. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9129405 |
|
710 | 2 |
_aSpringerLink (Online service) _9129406 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540785231 |
776 | 0 | 8 |
_iPrinted edition: _z9783540847755 |
830 | 0 |
_aSecurity and Cryptology, _x2946-1863 ; _v4948 _9129407 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-540-78524-8 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c91524 _d91524 |