000 04137nam a22006495i 4500
001 978-3-642-12678-9
003 DE-He213
005 20240423125753.0
007 cr nn 008mamaa
008 100429s2010 gw | s |||| 0|eng d
020 _a9783642126789
_9978-3-642-12678-9
024 7 _a10.1007/978-3-642-12678-9
_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 _aProgress in Cryptology - AFRICACRYPT 2010
_h[electronic resource] :
_bThird International Conference on Cryptology in Africa, Stellenbosch, South Africa, May 3-6, 2010, Proceedings /
_cedited by Daniel J. Bernstein, Tanja Lange.
250 _a1st ed. 2010.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2010.
300 _aXIII, 437 p. 43 illus.
_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 ;
_v6055
505 0 _aSignatures -- A New RSA-Based Signature Scheme -- Fair Blind Signatures without Random Oracles -- Fair Partially Blind Signatures -- Attacks -- Parallel Shortest Lattice Vector Enumeration on Graphics Cards -- Flexible Partial Enlargement to Accelerate Gröbner Basis Computation over -- Factoring RSA Modulus Using Prime Reconstruction from Random Known Bits -- Protocols -- Proofs of Restricted Shuffles -- Batch Range Proof for Practical Small Ranges -- Optimistic Fair Priced Oblivious Transfer -- Networks -- Information-Theoretically Secure Key-Insulated Multireceiver Authentication Codes -- Simple and Communication Complexity Efficient Almost Secure and Perfectly Secure Message Transmission Schemes -- Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience -- Elliptic Curves -- Avoiding Full Extension Field Arithmetic in Pairing Computations -- ECC2K-130 on Cell CPUs -- Side-Channel Attacks and Fault Attacks -- Practical Improvements of Profiled Side-Channel Attacks on a Hardware Crypto-Accelerator -- Differential Fault Analysis of HC-128 -- Fresh Re-keying: Security against Side-Channel and Fault Attacks for Low-Cost Devices -- Public-Key Encryption -- Strong Cryptography from Weak Secrets -- Efficient Unidirectional Proxy Re-Encryption -- Public-Key Encryption with Non-Interactive Opening: New Constructions and Stronger Definitions -- Keys and PUFs -- Flexible Group Key Exchange with On-demand Computation of Subgroup Keys -- Quantum Readout of Physical Unclonable Functions -- Ciphers and Hash Functions -- Parallelizing the Camellia and SMS4 Block Ciphers -- Improved Linear Differential Attacks on CubeHash -- Cryptanalysis of the 10-Round Hash and Full Compression Function of SHAvite-3-512.
650 0 _aCryptography.
650 0 _aData encryption (Computer science).
650 0 _aComputer networks .
650 0 _aElectronic data processing
_xManagement.
650 0 _aAlgorithms.
650 0 _aData protection.
650 0 _aOperating systems (Computers).
650 1 4 _aCryptology.
650 2 4 _aComputer Communication Networks.
650 2 4 _aIT Operations.
650 2 4 _aAlgorithms.
650 2 4 _aData and Information Security.
650 2 4 _aOperating Systems.
700 1 _aBernstein, Daniel J.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aLange, Tanja.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642126772
776 0 8 _iPrinted edition:
_z9783642126796
830 0 _aSecurity and Cryptology,
_x2946-1863 ;
_v6055
856 4 0 _uhttps://doi.org/10.1007/978-3-642-12678-9
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c181517
_d181517