000 | 05264nam a22006615i 4500 | ||
---|---|---|---|
001 | 978-3-540-32267-2 | ||
003 | DE-He213 | ||
005 | 20240730202144.0 | ||
007 | cr nn 008mamaa | ||
008 | 100410s2005 gw | s |||| 0|eng d | ||
020 |
_a9783540322672 _9978-3-540-32267-2 |
||
024 | 7 |
_a10.1007/11593447 _2doi |
|
050 | 4 | _aQA268 | |
050 | 4 | _aQ350-390 | |
072 | 7 |
_aGPJ _2bicssc |
|
072 | 7 |
_aGPF _2bicssc |
|
072 | 7 |
_aCOM031000 _2bisacsh |
|
072 | 7 |
_aGPJ _2thema |
|
072 | 7 |
_aGPF _2thema |
|
082 | 0 | 4 |
_a003.54 _223 |
245 | 1 | 0 |
_aAdvances in Cryptology - ASIACRYPT 2005 _h[electronic resource] : _b11th International Conference on the Theory and Application of Cryptology and Information Security, Chennai, India, December 4-8, 2005, Proceedings / _cedited by Bimal Kumar Roy. |
250 | _a1st ed. 2005. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2005. |
|
300 |
_aXIV, 706 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 ; _v3788 |
|
505 | 0 | _aAlgebra and Number Theory -- Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log -- Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log? -- Adapting Density Attacks to Low-Weight Knapsacks -- Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains -- Multiparty Computation -- Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation -- Graph-Decomposition-Based Frameworks for Subset-Cover Broadcast Encryption and Efficient Instantiations -- Revealing Additional Information in Two-Party Computations -- Zero Knowledge and Secret Sharing -- Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation -- Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes -- Updatable Zero-Knowledge Databases -- Information and Quantum Theory -- Simple and Tight Bounds for Information Reconciliation and Privacy Amplification -- Quantum Anonymous Transmissions -- Privacy and Anonymity -- Privacy-Preserving Graph Algorithms in the Semi-honest Model -- Spreading Alerts Quietly and the Subgroup Escape Problem -- A Sender Verifiable Mix-Net and a New Proof of a Shuffle -- Universally Anonymizable Public-Key Encryption -- Cryptanalytic Techniques -- Fast Computation of Large Distributions and Its Cryptographic Applications -- An Analysis of the XSL Algorithm -- Stream Cipher Cryptanalysis -- New Applications of Time Memory Data Tradeoffs -- Linear Cryptanalysis of the TSC Family of Stream Ciphers -- A Practical Attack on the Fixed RC4 in the WEP Mode -- A Near-Practical Attack Against B Mode of HBB -- Block Ciphers and Hash Functions -- New Improvements of Davies-Murphy Cryptanalysis -- A Related-Key Rectangle Attack on the Full KASUMI -- Some Attacks Against a DoubleLength Hash Proposal -- A Failure-Friendly Design Principle for Hash Functions -- Bilinear Maps -- Identity-Based Hierarchical Strongly Key-Insulated Encryption and Its Application -- Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps -- Verifier-Local Revocation Group Signature Schemes with Backward Unlinkability from Bilinear Maps -- Key Agreement -- Modular Security Proofs for Key Agreement Protocols -- A Simple Threshold Authenticated Key Exchange from Short Secrets -- Examining Indistinguishability-Based Proof Models for Key Establishment Protocols -- Provable Security -- Server-Aided Verification: Theory and Practice -- Errors in Computational Complexity Proofs for Protocols -- Signatures -- Universal Designated Verifier Signature Proof (or How to Efficiently Prove Knowledge of a Signature) -- Efficient Designated Confirmer Signatures Without Random Oracles or General Zero-Knowledge Proofs -- Universally Convertible Directed Signatures. | |
650 | 0 |
_aCoding theory. _94154 |
|
650 | 0 |
_aInformation theory. _914256 |
|
650 | 0 |
_aCryptography. _91973 |
|
650 | 0 |
_aData encryption (Computer science). _99168 |
|
650 | 0 |
_aOperating systems (Computers). _95329 |
|
650 | 0 |
_aAlgorithms. _93390 |
|
650 | 0 |
_aElectronic data processing _xManagement. _9170153 |
|
650 | 0 |
_aComputer networks . _931572 |
|
650 | 1 | 4 |
_aCoding and Information Theory. _9170154 |
650 | 2 | 4 |
_aCryptology. _931769 |
650 | 2 | 4 |
_aOperating Systems. _937074 |
650 | 2 | 4 |
_aAlgorithms. _93390 |
650 | 2 | 4 |
_aIT Operations. _931703 |
650 | 2 | 4 |
_aComputer Communication Networks. _9170155 |
700 | 1 |
_aRoy, Bimal Kumar. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9170156 |
|
710 | 2 |
_aSpringerLink (Online service) _9170157 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540306849 |
776 | 0 | 8 |
_iPrinted edition: _z9783540818366 |
830 | 0 |
_aSecurity and Cryptology, _x2946-1863 ; _v3788 _9170158 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/11593447 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c96876 _d96876 |