Edizione	[1st ed. 2010.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Descrizione fisica	1 online resource (XIV, 744 p. 63 illus.)
Disciplina	005.8
Collana	Security and Cryptology
Soggetto topico	Data encryption (Computer science) Management information systems Computer science Computer communication systems Computer security Computers and civilization Computer science—Mathematics Cryptology Management of Computing and Information Systems Computer Communication Networks Systems and Data Security Computers and Society Discrete Mathematics in Computer Science
ISBN	3-642-14623-6
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Leakage -- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability -- Leakage-Resilient Pseudorandom Functions and Side-Channel Attacks on Feistel Networks -- Protecting Cryptographic Keys against Continual Leakage -- Securing Computation against Continuous Leakage -- Lattice -- An Efficient and Parallel Gaussian Sampler for Lattices -- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE -- Homomorphic Encryption -- Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness -- Additively Homomorphic Encryption with d-Operand Multiplications -- i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits -- Theory and Applications -- Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography -- Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption -- Structure-Preserving Signatures and Commitments to Group Elements -- Efficient Indifferentiable Hashing into Ordinary Elliptic Curves -- Key Exchange, OAEP/RSA, CCA -- Credential Authenticated Identification and Key Exchange -- Password-Authenticated Session-Key Generation on the Internet in the Plain Model -- Instantiability of RSA-OAEP under Chosen-Plaintext Attack -- Efficient Chosen-Ciphertext Security via Extractable Hash Proofs -- Attacks -- Factorization of a 768-Bit RSA Modulus -- Correcting Errors in RSA Private Keys -- Improved Differential Attacks for ECHO and Grøstl -- A Practical-Time Related-Key Attack on the KASUMI Cryptosystem Used in GSM and 3G Telephony -- Composition -- Universally Composable Incoercibility -- Concurrent Non-Malleable Zero Knowledge Proofs -- Equivalence of Uniform Key Agreement and Composition Insecurity -- Computation Delegation and Obfuscation -- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers -- Improved Delegation of Computation Using Fully Homomorphic Encryption -- Oblivious RAM Revisited -- On Strong Simulation and Composable Point Obfuscation -- Multiparty Computation -- Protocols for Multiparty Coin Toss with Dishonest Majority -- Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost -- Secure Multiparty Computation with Minimal Interaction -- A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security -- Pseudorandomness -- On Generalized Feistel Networks -- Cryptographic Extraction and Key Derivation: The HKDF Scheme -- Time Space Tradeoffs for Attacks against One-Way Functions and PRGs -- Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks -- Quantum -- Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries -- On the Efficiency of Classical and Quantum Oblivious Transfer Reductions -- Sampling in a Quantum Population, and Applications.
Record Nr.	UNISA-996466424503316

Edizione	[1st ed. 2011.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011
Descrizione fisica	1 online resource (XV, 782 p. 84 illus., 4 illus. in color.)
Disciplina	005.82
Collana	Security and Cryptology
Soggetto topico	Data encryption (Computer science) Management information systems Computer science Computer communication systems Computer security Computers and civilization Computer science—Mathematics Cryptology Management of Computing and Information Systems Computer Communication Networks Systems and Data Security Computers and Society Discrete Mathematics in Computer Science
ISBN	3-642-22792-9
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Leftover hash lemma, revisited / Boaz Barak [and 6 others] -- Random Oracle reducibility / Paul Baecher, Marc Fischlin -- Time-lock puzzles in the random Oracle model / Mohammad Mahmoody, Tal Moran, Salil Vadhan.
Record Nr.	UNISA-996466003703316

Edizione	[1st ed. 2012.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012
Descrizione fisica	1 online resource (XV, 888 p. 103 illus.)
Disciplina	005.8/2
Collana	Security and Cryptology
Soggetto topico	Data encryption (Computer science) Management information systems Computer science Computer communication systems Computer security Computers and civilization Computer science—Mathematics Cryptology Management of Computing and Information Systems Computer Communication Networks Systems and Data Security Computers and Society Discrete Mathematics in Computer Science
Soggetto genere / forma	Conference proceedings.
ISBN	3-642-32009-0
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Symmetric Cryptosystems -- An Enciphering Scheme Based on a Card Shuffle.- Tweakable Blockciphers with Beyond Birthday-Bound Security.- Breaking and Repairing GCM Security Proofs.- On the Distribution of Linear Biases: Three Instructive Examples.- Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs.- Invited Talk -- The End of Crypto.- Secure Computation I.- Adaptively Secure Multi-Party Computation with Dishonest Majority.- Collusion-Preserving Computation.- Secret Sharing Schemes for Very Dense Graphs.- Attribute-Based and Functional Encryption -- Functional Encryption with Bounded Collusions via Multi-party Computation.- New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques.- Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption -- Functional Encryption for Regular Languages.- Proof Systems.- Database Commitments and Universal Arguments of Quasi Knowledge.- Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits.- Protocols -- On the Security of TLS-DHE in the Standard Model.- Semantic Security for the Wiretap Channel.- Multi-instance Security and Its Application to Password-Based Cryptography.- Hash Functions -- Hash Functions Based on Three Permutations: A Generic Security Analysis.- Hash or Not to Hash Again? (In)Differentiability Results for H2 and HMAC.- New Preimage Attacks against Reduced SHA-1.- Stam’s Conjecture and Threshold Phenomena in Collision Resistance.- Composable Security -- Universal Composability from Essentially Any Trusted Setup.- Impossibility Results for Static Input Secure Computation.- New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure Computation.- Black-Box Constructions of Composable Protocols without Set-Up.- Privacy -- Crowd-Blending Privacy.- Differential Privacy with Imperfect Randomness.- Leakage and Side-Channels -- Tamper and Leakage Resilience in the Split-State Model.- Securing Circuits against Constant-Rate Tampering.- How to Compute under AC0 Leakage without Secure Hardware.- Invited Talk -- Recent Advances and Existing Research Questions in Platform Security.- Signatures -- Group Signatures with Almost-for-Free Revocation.- Tightly Secure Signatures and Public-Key Encryption.- Implementation Analysis -- Efficient Padding Oracle Attacks on Cryptographic Hardware.- Public Keys.- Secure Computation II -- Multiparty Computation from Somewhat Homomorphic Encryption -- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority -- A New Approach to Practical Active-Secure Two-Party Computation -- Black-Box Separation -- The Curious Case of Non-Interactive Commitments – On the Power of Black-Box vs. Non-Black-Box Use of Primitive -- Cryptanalysis -- Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems -- Resistance against Iterated Attacks by Decorrelation Revisited -- Quantum Cryptography -- Secure Identity-Based Encryption in the Quantum Random Oracle Model -- Quantum to Classical Randomness Extractors -- Actively Secure Two-Party Evaluation of Any Quantum Operation -- Key Encapsulation and One-Way functions -- On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups -- Hardness of Computing Individual Bits for One-Way Functions on Elliptic Curves -- Homomorphic Evaluation of the AES Circuit -- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP. An Enciphering Scheme Based on a Card Shuffle.- Tweakable Blockciphers with Beyond Birthday-Bound Security.- Breaking and Repairing GCM Security Proofs.- On the Distribution of Linear Biases: Three Instructive Examples.- Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs.- Invited Talk -- The End of Crypto.- Secure Computation I.- Adaptively Secure Multi-Party Computation with Dishonest Majority.- Collusion-Preserving Computation.- Secret Sharing Schemes for Very Dense Graphs.- Attribute-Based and Functional Encryption -- Functional Encryption with Bounded Collusions via Multi-party Computation.- New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques.- Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption -- Functional Encryption for Regular Languages.- Proof Systems.- Database Commitments and Universal Arguments of Quasi Knowledge.- Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits.- Protocols -- On the Security of TLS-DHE in the Standard Model.- Semantic Security for the Wiretap Channel.- Multi-instance Security and Its Application to Password-Based Cryptography.- Hash Functions -- Hash Functions Based on Three Permutations: A Generic Security Analysis.- Hash or Not to Hash Again? (In)Differentiability Results for H2 and HMAC.- New Preimage Attacks against Reduced SHA-1.- Stam’s Conjecture and Threshold Phenomena in Collision Resistance.- Composable Security -- Universal Composability from Essentially Any Trusted Setup.- Impossibility Results for Static Input Secure Computation.- New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure Computation.- Black-Box Constructions of Composable Protocols without Set-Up.- Privacy -- Crowd-Blending Privacy.- Differential Privacy with Imperfect Randomness.- Leakage and Side-Channels -- Tamper and Leakage Resilience in the Split-State Model.- Securing Circuits against Constant-Rate Tampering.- How to Compute under AC0 Leakage without Secure Hardware.- Invited Talk -- Recent Advances and Existing Research Questions in Platform Security.- Signatures -- Group Signatures with Almost-for-Free Revocation.- Tightly Secure Signatures and Public-Key Encryption.- Implementation Analysis -- Efficient Padding Oracle Attacks on Cryptographic Hardware.- Public Keys.- Secure Computation II -- Multiparty Computation from Somewhat Homomorphic Encryption -- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority -- A New Approach to Practical Active-Secure Two-Party Computation -- Black-Box Separation -- The Curious Case of Non-Interactive Commitments – On the Power of Black-Box vs. Non-Black-Box Use of Primitive -- Cryptanalysis -- Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems -- Resistance against Iterated Attacks by Decorrelation Revisited -- Quantum Cryptography -- Secure Identity-Based Encryption in the Quantum Random Oracle Model -- Quantum to Classical Randomness Extractors -- Actively Secure Two-Party Evaluation of Any Quantum Operation -- Key Encapsulation and One-Way functions -- On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups -- Hardness of Computing Individual Bits for One-Way Functions on Elliptic Curves -- Homomorphic Evaluation of the AES Circuit -- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP.
Record Nr.	UNISA-996465545803316

Edizione	[1st ed. 2014.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014
Descrizione fisica	1 online resource (XVIII, 532 p. 53 illus.)
Disciplina	005.82
Collana	Security and Cryptology
Soggetto topico	Data encryption (Computer science) Computer security Algorithms Computer science—Mathematics Cryptology Systems and Data Security Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science
ISBN	3-662-44381-3
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Quantum Cryptography -- Foundations of Hardness -- Obfuscation.- Number-Theoretic Hardness -- Side Channels and Leakage Resilience -- Information-Theoretic Security -- Key Exchange and Secure Communication -- Zero Knowledge -- Composable Security -- Secure Computation – Foundations -- Secure Computation – Implementations.
Record Nr.	UNINA-9910483702103321

Edizione	[1st ed. 2015.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2015
Descrizione fisica	1 online resource (XVIII, 783 p. 76 illus.)
Disciplina	005.82
Collana	Security and Cryptology
Soggetto topico	Data encryption (Computer science) Computer security Algorithms Computer science—Mathematics Cryptology Systems and Data Security Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science
ISBN	3-662-48000-X
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Lattice-based cryptography -- Cryptanalytic insights -- Modes and constructions -- Multilinear maps and IO -- Pseudorandomness -- Block cipher cryptanalysis -- Integrity -- Assumptions -- Hash functions and stream cipher cryptanalysis -- Implementations -- Multiparty computation -- Zero-knowledge -- Theory -- Signatures -- Non-signaling and information-theoretic crypto -- Attribute-based encryption -- New primitives -- Fully homomorphic/functional encryption.
Record Nr.	UNINA-9910484621903321