Cantitate/Preț
Produs

Advances in Cryptology – EUROCRYPT 2015: 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26-30, 2015, Proceedings, Part I: Lecture Notes in Computer Science, cartea 9056

Editat de Elisabeth Oswald, Marc Fischlin
en Limba Engleză Paperback – apr 2015
The two-volume proceedings LNCS 9056 + 9057 constitutes the proceedings of the 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2015, held in Sofia, Bulgaria, in April 2015.
The 57 full papers included in these volumes were carefully reviewed and selected from 194 submissions. The papers are organized in topical sections named: honorable mentions, random number generators, number field sieve, algorithmic cryptanalysis, symmetric cryptanalysis, hash functions, evaluation implementation, masking, fully homomorphic encryption, related-key attacks, fully monomorphic encryption, efficient two-party protocols, symmetric cryptanalysis, lattices, signatures, zero-knowledge proofs, leakage-resilient cryptography, garbled circuits, crypto currencies, secret sharing, outsourcing computations, obfuscation and e-voting, multi-party computations, encryption, resistant protocols, key exchange, quantum cryptography, and discrete logarithms.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 41932 lei  6-8 săpt.
  Springer Berlin, Heidelberg – apr 2015 41932 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 31 mar 2015 66786 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 41932 lei

Nou

Puncte Express: 629

Preț estimativ în valută:
8026 8347$ 6726£

Carte tipărită la comandă

Livrare economică 13-27 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783662467992
ISBN-10: 3662467992
Pagini: 836
Ilustrații: XVII, 818 p. 123 illus.
Dimensiuni: 155 x 235 x 44 mm
Greutate: 1.15 kg
Ediția:2015
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Security and Cryptology

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Cryptanalysis of the Multilinear Map over the Integers.- Robust Authenticated-Encryption AEZ and the Problem That It Solves.- On the Behaviors of Affine Equivalent Sboxes Regarding Differential and Linear Attacks.- A Provable-Security Analysis of Intel’s Secure Key RNG.- A Formal Treatment of Backdoored Pseudorandom Generators.- Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields.- The Multiple Number Field Sieve with Conjugation and Generalized.- Better Algorithms for LWE and LWR.- On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes.- Cryptanalytic Time-Memory-Data Tradeoffs for FX-Constructions with Applications to PRINCE and PRIDE.- A Generic Approach to Invariant Subspace Attacks: Cryptanalysis of Robin, iSCREAM and Zorro.- Structural Evaluation by Generalized Integral Property.- Cryptanalysis of SP Networks with Partial Non-Linear Layers.- The Sum Can Be Weaker Than Each Part.- SPHINCS: Practical Stateless Hash-Based Signatures.- Making Masking Security Proofs Concrete: Or How to Evaluate the Security of Any Leaking Device.- Ciphers for MPC and FHE.- Verified Proofs of Higher-Order Masking.- Inner Product Masking Revisited.- Fully Homomophic Encryption over the Integers Revisited.- (Batch) Fully Homomorphic Encryption over Integers for Non-Binary Message Spaces .- KDM-CCA Security from RKA Secure Authenticated Encryption.- On the Provable Security of the Iterated Even-Mansour Cipher Against Related-Key and Chosen-Key Attacks.- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second.- Bootstrapping for HElib.- More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries.- How to Efficiently Evaluate RAM Programs with Malicious Security.- Cube Attacks and Cube-Attack-Like Cryptanalysis on the Round-Reduced Keccak Sponge Function.- Twisted Polynomials and Forgery Attacks on GCM.- Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Samplingin Structured Lattices.