Pubbl/distr/stampa	Amsterdam ; ; Washington, D.C., : IOS Press, c2011
Descrizione fisica	1 online resource (144 p.)
Disciplina	005.8/2 005.82
Altri autori (Persone)	JunodPascal CanteautAnne
Collana	Cryptology and information security series
Soggetto topico	Cryptography Ciphers
Soggetto genere / forma	Electronic books.
ISBN	6613433039 1-283-43303-6 9786613433039 1-60750-844-3
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Title page; Preface; Contents; Experimenting Linear Cryptanalysis; Linear Cryptanalysis Using Multiple Linear Approximations; Linear Attacks on Stream Ciphers; Using Tools from Error Correcting Theory in Linear Cryptanalysis; Correlation Analysis in GF(2n); Subject Index; Author Index
Record Nr.	UNINA-9910465191903321

Edizione	[1st ed. 2004.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004
Descrizione fisica	1 online resource (XVI, 548 p.)
Disciplina	005.8/2
Collana	Lecture Notes in Computer Science
Soggetto topico	Coding theory Information theory Data encryption (Computer science) Operating systems (Computers) Algorithms Management information systems Computer science Computer communication systems Coding and Information Theory Cryptology Operating Systems Algorithm Analysis and Problem Complexity Management of Computing and Information Systems Computer Communication Networks
ISBN	3-540-30539-4
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Block Ciphers -- On Feistel Ciphers Using Optimal Diffusion Mappings Across Multiple Rounds -- Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC -- Eliminating Random Permutation Oracles in the Even-Mansour Cipher -- Public Key Encryption -- Towards Plaintext-Aware Public-Key Encryption Without Random Oracles -- OAEP 3-Round:A Generic and Secure Asymmetric Encryption Padding -- Invited Talk I -- Stream Ciphers: Dead or Alive? -- Number Theory and Algebra -- On the Generalized Linear Equivalence of Functions Over Finite Fields -- Sieving Using Bucket Sort -- Right-Invariance: A Property for Probabilistic Analysis of Cryptography Based on Infinite Groups -- Secure Computation -- Practical Two-Party Computation Based on the Conditional Gate -- Privacy in Non-private Environments -- Asynchronous Proactive Cryptosystems Without Agreement -- Lattice-Based Threshold-Changeability for Standard Shamir Secret-Sharing Schemes -- Hash Functions -- Masking Based Domain Extenders for UOWHFs: Bounds and Constructions -- Higher Order Universal One-Way Hash Functions -- The MD2 Hash Function Is Not One-Way -- Key Management -- New Approaches to Password Authenticated Key Exchange Based on RSA -- Constant-Round Authenticated Group Key Exchange for Dynamic Groups -- A Public-Key Black-Box Traitor Tracing Scheme with Sublinear Ciphertext Size Against Self-Defensive Pirates -- Identification -- Batching Schnorr Identification Scheme with Applications to Privacy-Preserving Authorization and Low-Bandwidth Communication Devices -- Secret Handshakes from CA-Oblivious Encryption -- k-Times Anonymous Authentication (Extended Abstract) -- XL-Algorithms -- The XL-Algorithm and a Conjecture from Commutative Algebra -- Comparison Between XL and Gröbner Basis Algorithms -- Digital Signatures -- Generic Homomorphic Undeniable Signatures -- Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings -- Public Key Cryptanalysis -- On the Security of MOR Public Key Cryptosystem -- Cryptanalyzing the Polynomial-Reconstruction Based Public-Key System Under Optimal Parameter Choice -- Colluding Attacks to a Payment Protocol and Two Signature Exchange Schemes -- Invited Talk II -- Information Security in Korea IT839 Strategy -- Symmetric Key Cryptanalysis -- How Far Can We Go Beyond Linear Cryptanalysis? -- The Davies-Murphy Power Attack -- Time-Memory Trade-Off Attacks on Multiplications and T-Functions -- Cryptanalysis of Bluetooth Keystream Generator Two-Level E0 -- Protocols -- On Provably Secure Time-Stamping Schemes -- Strong Conditional Oblivious Transfer and Computing on Intervals -- Improved Setup Assumptions for 3-Round Resettable Zero Knowledge.
Record Nr.	UNISA-996466361603316

Edizione	[1st ed. 2000.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000
Descrizione fisica	1 online resource (XI, 543 p.)
Disciplina	005.8/2
Collana	Lecture Notes in Computer Science
Soggetto topico	Computer communication systems Data encryption (Computer science) Algorithms Management information systems Computer science Computer mathematics Computer Communication Networks Cryptology Algorithm Analysis and Problem Complexity Management of Computing and Information Systems Computational Mathematics and Numerical Analysis
ISBN	3-540-44598-6
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	XTR and NTRU -- The XTR Public Key System -- A Chosen-Ciphertext Attack against NTRU -- Privacy for Databases -- Privacy Preserving Data Mining -- Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing -- Secure Distributed Computation and Applications -- Parallel Reducibility for Information-Theoretically Secure Computation -- Optimistic Fair Secure Computation -- A Cryptographic Solution to a Game Theoretic Problem -- Algebraic Cryptosystems -- Differential Fault Attacks on Elliptic Curve Cryptosystems -- Quantum Public-Key Cryptosystems -- New Public-Key Cryptosystem Using Braid Groups -- Message Authentication -- Key Recovery and Forgery Attacks on the MacDES MAC Algorithm -- CBC MACs for Arbitrary-Length Messages: The Three-Key Constructions -- L-collision Attacks against Randomized MACs -- Digital Signatures -- On the Exact Security of Full Domain Hash -- Timed Commitments -- A Practical and Provably Secure Coalition-Resistant Group Signature Scheme -- Provably Secure Partially Blind Signatures -- Cryptanalysis -- Weaknesses in the SL2( ) Hashing Scheme -- Fast Correlation Attacks through Reconstruction of Linear Polynomials -- Traitor Tracing and Broadcast Encryption -- Sequential Traitor Tracing -- Long-Lived Broadcast Encryption -- Invited Talk -- Taming the Adversary -- Symmetric Encryption -- The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key Search -- On the Round Security of Symmetric-Key Cryptographic Primitives -- New Paradigms for Constructing Symmetric Encryption Schemes Secure against Chosen-Ciphertext Attack -- To Commit or Not to Commit -- Efficient Non-malleable Commitment Schemes -- Improved Non-committing Encryption Schemes Based on a General Complexity Assumption -- Protocols -- A Note on the Round-Complexity of Concurrent Zero-Knowledge -- An Improved Pseudo-random Generator Based on Discrete Log -- Linking Classical and Quantum Key Agreement: Is There “Bound Information”? -- Stream Ciphers and Boolean Functions -- Maximum Correlation Analysis of Nonlinear S-boxes in Stream Ciphers -- Nonlinearity Bounds and Constructions of Resilient Boolean Functions -- Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications.
Record Nr.	UNISA-996465407103316

Edizione	[1st ed. 2002.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Descrizione fisica	1 online resource (XIV, 630 p.)
Disciplina	005.8/2
Collana	Lecture Notes in Computer Science
Soggetto topico	Cryptography Data encryption (Computer science) Data protection Computer science—Mathematics Discrete mathematics Algorithms Operating systems (Computers) Electronic data processing—Management Cryptology Data and Information Security Discrete Mathematics in Computer Science Operating Systems IT Operations
ISBN	3-540-45708-9
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Block Ciphers -- Essential Algebraic Structure within the AES -- Blockwise-Adaptive Attackers Revisiting the (In)Security of Some Provably Secure Encryption Modes: CBC, GEM, IACBC -- Tweakable Block Ciphers -- Multi-user Oriented Cryptosystems -- The LSD Broadcast Encryption Scheme -- Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials -- Foundations and Methodology -- Provably Secure Steganography -- Flaws in Applying Proof Methodologies to Signature Schemes -- Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case -- Security of Practical Protocols -- On the Security of RSA Encryption in TLS -- Security Analysis of IKE’s Signature-Based Key-Exchange Protocol -- GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks -- Secure Multiparty Computation -- On 2-Round Secure Multiparty Computation -- Private Computation — k-Connected versus 1-Connected Networks -- Public-Key Encryption -- Analysis and Improvements of NTRU Encryption Paddings -- Universal Padding Schemes for RSA -- Cryptanalysis of Unbalanced RSA with Small CRT-Exponent -- Information Theory and Secret Sharing -- Hyper-encryption against Space-Bounded Adversaries from On-Line Strong Extractors -- Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups -- Cipher Design and Analysis -- A Generalized Birthday Problem -- (Not So) Random Shuffles of RC4 -- Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV -- Elliptic Curves and Abelian Varieties -- Supersingular Abelian Varieties in Cryptology -- Efficient Algorithms for Pairing-Based Cryptosystems -- Computing Zeta Functions of Hyperelliptic Curves over Finite Fields of Characteristic 2 -- Password-Based Authentication -- Threshold Password-Authenticated Key Exchange -- Distributed Cryptosystems -- A Threshold Pseudorandom Function Construction and Its Applications -- Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products -- Pseudorandomness and Applications -- Hidden Number Problem with the Trace and Bit Security of XTR and LUC -- Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security -- Variations on Signatures and Authentication -- Threshold Ring Signatures and Applications to Ad-hoc Groups -- Deniable Ring Authentication -- SiBIR: Signer-Base Intrusion-Resilient Signatures -- Stream Ciphers and Boolean Functions -- Cryptanalysis of Stream Ciphers with Linear Masking -- The Filter-Combiner Model for Memoryless Synchronous Stream Ciphers -- A Larger Class of Cryptographic Boolean Functions via a Study of the Maiorana-McFarland Construction -- Commitment Schemes -- Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks -- Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor -- Signature Schemes -- Unique Signatures and Verifiable Random Functions from the DH-DDH Separation -- Security Proof for Partial-Domain Hash Signature Schemes.
Record Nr.	UNISA-996465560903316

Edizione	[1st ed. 2012.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012
Descrizione fisica	1 online resource (XVI, 780 p. 64 illus.)
Disciplina	005.8/2
Collana	Security and Cryptology
Soggetto topico	Data encryption (Computer science) Algorithms Management information systems Computer science Computer science—Mathematics Computer security Applied mathematics Engineering mathematics Cryptology Algorithm Analysis and Problem Complexity Management of Computing and Information Systems Discrete Mathematics in Computer Science Systems and Data Security Applications of Mathematics
Soggetto genere / forma	Conference proceedings.
ISBN	3-642-34961-7
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Pairing-Based Cryptography -- Past, Present, and Future -- Some Mathematical Mysteries in Lattices -- Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions -- Dual Form Signatures: An Approach for Proving Security from Static Assumptions -- Breaking Pairing-Based Cryptosystems Using ηT Pairing over GF(397) -- On the (Im)possibility of Projecting Property in Prime-Order Setting -- Optimal Reductions of Some Decisional Problems to the Rank Problem -- Signature Schemes Secure against Hard-to-Invert Leakage -- Completeness for Symmetric Two-Party Functionalities - Revisited -- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing -- The Generalized Randomized Iterate and Its Application to New Efficient Constructions of UOWHFs from Regular One-Way Functions -- Symmetric Cipher Perfect Algebraic Immune Functions -- Differential Analysis of the LED Block Cipher -- PRINCE – A Low-Latency Block Cipher for Pervasive Computing Applications: Extended Abstract -- Analysis of Differential Attacks in ARX Constructions -- Integral and Multidimensional Linear Distinguishers with Correlation Zero -- Differential Attacks against Stream Cipher ZUC -- An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher -- 3kf9: Enhancing 3GPP-MAC beyond the Birthday Bound -- Understanding Adaptivity: Random Systems Revisited -- RKA Security beyond the Linear Barrier: IBE, Encryption and Signatures -- Fully Secure Unbounded Inner-Product and Attribute-Based Encryption -- Computing on Authenticated Data: New Privacy Definitions and Constructions -- A Coding-Theoretic Approach to Recovering Noisy RSA Keys -- Certifying RSA -- Lattice-Based Cryptography and Number Theory Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic -- Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures -- On Polynomial Systems Arising from a Weil Descent -- ECM at Work -- IND-CCA Secure Cryptography Based on a Variant of the LPN Problem -- Provable Security of the Knudsen-Preneel Compression Functions -- Optimal Collision Security in Double Block Length Hashing with Single Length Key -- Bicliques for Permutations: Collision and Preimage Attacks in Stronger Settings -- Investigating Fundamental Security Requirements on Whirlpool: Improved Preimage and Collision Attacks -- Generic Related-Key Attacks for HMAC -- The Five-Card Trick Can Be Done with Four Cards -- A Mix-Net from Any CCA2 Secure Cryptosystem -- How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios -- Sequential Aggregate Signatureswith Lazy Verification from Trapdoor Permutations (Extended Abstract) -- Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise -- Calling Out Cheaters: Covert Security with Public Verifiability -- A Unified Framework for UC from Only OT -- Four-Dimensional Gallant-Lambert-Vanstone Scalar Multiplication -- Shuffling against Side-Channel Attacks: A Comprehensive Study with Cautionary Note -- Theory and Practice of a Leakage Resilient Masking Scheme.
Record Nr.	UNISA-996466297403316