Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Advances in Cryptology -- ASIACRYPT 2011 [[electronic resource] ] : 17th International Conference on the Theory and Application of Cryptology and Information Security, Seoul, South Korea, December 4-8, 2011, Proceedings / / edited by Dong Hoon Lee, Xiaoyun Wang
| Advances in Cryptology -- ASIACRYPT 2011 [[electronic resource] ] : 17th International Conference on the Theory and Application of Cryptology and Information Security, Seoul, South Korea, December 4-8, 2011, Proceedings / / edited by Dong Hoon Lee, Xiaoyun Wang |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (XIV, 760 p.) |
| Disciplina | 005.8 |
| 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 |
| ISBN | 3-642-25385-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Title -- Preface -- Table of Contents -- Lattices and Quantum Cryptography -- BKZ 2.0: Better Lattice Security Estimates -- Introduction -- Preliminaries -- The Blockwise Korkine-Zolotarev (BKZ) Algorithm -- Description -- Enumeration Subroutine -- Analysis -- BKZ 2.0 -- Sound Pruning -- Preprocessing of Local Blocks -- Optimizing the Enumeration Radius -- New Lattice Records -- Darmstadt's Lattice Challenge -- SVP Challenges -- Predicting BKZ 2.0 by Simulation -- Description -- Consistency with Experiments -- Enumeration Subroutine -- Revising Security Estimates -- NTRU Lattices -- Gentry-Halevi's Fully-Homomorphic Encryption Challenges -- References -- Functional Encryption for Inner Product Predicates from Learning with Errors -- Introduction -- Overview of the Construction -- Predicate Encryption -- Security -- Lattice Preliminaries -- Lattices -- Sampling Algorithms -- The LWE Problem -- A Functional Encryption Scheme for Inner Product Predicates -- The Construction -- Correctness -- Security -- Parameter Selection -- Conclusion and Open Questions -- References -- Random Oracles in a Quantum World -- Introduction -- Our Contributions -- Preliminaries -- Quantum Computation -- Quantum-Accessible Random Oracles -- Hard Problems for Quantum Computers -- Cryptographic Primitives -- Separation Result -- Construction -- Signature Schemes in the Quantum-Accessible Random Oracle Model -- Secure Signatures from Preimage Sampleable Trapdoor Functions (PSF) -- Secure Signatures from Claw-Free Permutations -- Encryption Schemes in the Quantum-Accessible Random Oracle Model -- CPA Security of BR Encryption -- CCA Security of Hybrid Encryption -- Conclusion -- References -- Public Key Encryption I -- Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security -- Introduction -- Background.
Selective Opening Secure Encryption -- Lossy Encryption -- Constructing Lossy Encryption Schemes -- Re-Randomizable Encryption Implies Lossy Encryption -- Statistically-Hiding {Catalog} < -- < -- /PageLabels< -- < -- /Nums[0< -- < -- /S/D /St 70> -- > -- ]> -- > -- > -- > -- ()21-OT Implies Lossy Encryption -- Chosen-Ciphertext Security -- Chosen-Ciphertext Security: Indistinguishability -- Chameleon Hash Functions -- A Special Use of the Canetti-Halevi-Katz Paradigm -- Lossy and All-But-n Trapdoor Functions -- An IND-SO-stag-wCCA2 TBE Construction -- An All-But-n Function with Short Outputs -- References -- Structure Preserving CCA Secure Encryption and Applications -- Introduction -- Structure Preserving Encryption -- Basic Notation -- Construction -- Correctness and Security -- Secure Joint Ciphertext Computation -- Preliminaries -- Construction -- Oblivious Third Parties -- Conclusion -- References -- Decoding Random Linear Codes in (20.054n) -- Introduction -- Notation -- Information Set Decoding Algorithms -- Information Set Decoding -- Stern's Algorithm -- The Finiasz-Sendrier ISD Algorithm -- Ball-collision Decoding -- How to Solve the Submatrix Problem -- The ColumnMatch Algorithm -- Our New Decoding Algorithm -- Experiments -- References -- Lower and Upper Bounds for Deniable Public-Key Encryption -- Introduction -- Deniable Public-Key Encryption -- Security Notions -- Full Bi-deniablity Implies Full Sender/Receiver-Deniability -- Impossibility of Fully Receiver/Bi-deniable Encryption -- Security of Parallel Self-composition -- Lower Bound -- From Multi-distributional to Poly Deniability -- Poly-Sender-Deniability -- Poly-Receiver-Deniability -- Poly-Bi-Deniability -- References -- Public Key Encryption II -- Bridging Broadcast Encryption and Group Key Agreement -- Introduction -- Our Contributions. Related Work -- Paper Organization -- Modeling Contributory Broadcast Encryption -- Syntax -- Security Definitions -- Remarks on Complexity Bounds of CBE and BE Schemes -- An Aggregatable BE Scheme -- Review of Aggregatable Signature-Based Broadcast -- An Aggregatable BE Scheme Based on ASBB -- Useful Properties -- Proposed CBE Scheme -- High-Level Description -- The Proposal -- Discussion -- Conclusions -- References -- On the Joint Security of Encryption and Signature, Revisited -- Introduction -- Our Contribution -- Further Related Work -- Preliminaries -- Combined Signature and Encryption Schemes -- A Cartesian Product Construction -- An Insecure CSE Scheme whose Components are Secure -- A Generic Construction from IBE -- A More Efficient Construction -- Comparison of Schemes -- Conclusions and Future Research -- References -- Polly Cracker, Revisited -- Introduction -- Related Work -- Preliminaries -- Gr bner Basis and Ideal Membership Problems -- Symmetric Polly Cracker: Noise-Free Version -- Homomorphic Symmetric Encryption -- The Scheme -- Security -- Symmetric-to-Asymmetric Conversion -- Gr\"{o} bner Bases with Noise -- Hardness Assumptions and Justifications -- Polly Cracker with Noise -- References -- Database Privacy -- Oblivious RAM with O((logN)3)Worst-Case Cost -- Introduction -- Our Contributions -- Related Work -- Preliminaries -- Defining O-RAM with Enriched Operations -- Relationship with the Standard O-RAM Definition -- Implementing Enriched Semantics -- Encryption and Authentication -- Two Simple O-RAM Constructions with Deterministic Guarantees -- Basic Construction -- Overview of the Binary Tree Construction -- Detailed Construction -- Security Analysis -- Asymptotic Performance of the Basic Construction -- Recursive Construction and How to Achieve the Desired Asymptotics. Recursive O-RAM Construction: O(1) Client-Side Storage -- References -- Noiseless Database Privacy -- Introduction -- Our Privacy Notion -- Boolean Queries -- The No Auxiliary Information Setting -- Handling Auxiliary Information -- Handling Multiple Queries in Adversarial Refreshment Model -- Real Queries -- Sums of Functions of Database Rows -- Privacy Analysis of fin(T)=j[n]aij tj -- Privacy under Multiple Queries on Changing Databases -- References -- Hash Function -- The Preimage Security of Double-Block-Length Compression Functions -- Introduction -- The Model -- An Example Case -- Preimage Security Results for Hirose's Scheme -- Preimage Security Results for Abreast-DM -- Preimage Security Results for Tandem-DM -- Conclusion -- References -- Rebound Attack on JH42 -- Introduction -- Preliminaries -- The JH42 Hash Function -- Properties of the Linear Transformation L -- Observations on the Compression Function -- The Rebound Attack -- Semi-free-start Internal Near-Collisions -- Matching the Active Bytes -- Matching the Passive Bytes -- Outbound Phase -- Distinguishers on JH -- Distinguishers on the Reduced Round Internal Permutation -- Distinguishers on the Full Internal Permutation -- Distinguishers on the Full Compression Function -- Conclusion -- References -- Second-Order Differential Collisions for Reduced SHA-256 -- Introduction -- Higher-Order Differential Collisions for Compression Functions -- Second-Order Differential Collision for Block-Cipher-Based Compression Functions -- Related Work -- Application to SHA-256 -- Description of SHA-256 -- Differential Characteristics -- Complexity of the Attack -- Applications to Related Primitives -- Application to SHA-512 -- Application to SHACAL-2 -- Conclusions -- References -- Finding SHA-2 Characteristics: Searching through a Minefield of Contradictions -- Introduction. Description of SHA-256 -- Basic Attack Strategy -- Determining a Starting Point -- Searching for Valid Differential Characteristics and Conforming Message Pairs in SHA-2 -- Difference and Condition Propagation in SHA-2 -- Alternative Description of SHA-2 -- Generalized Conditions -- Efficiently Implementing the Propagation of Generalized Conditions -- Two-Bit Conditions -- Inconsistency Checks -- Searching for Differential Characteristics -- Search Strategy -- Results -- Conclusions and Future Work -- References -- Symmetric Key Encryption -- Cryptanalysis of ARMADILLO2 -- Introduction -- Description of ARMADILLO2 -- Description -- A Multi-purpose Cryptographic Primitive -- Inverting the ARMADILLO2 Function -- The Meet-in-the-Middle Technique -- ARMADILLO2 Matching Problem: Matching Non-random Elements -- Applying the Parallel Matching Algorithm to ARMADILLO2 -- Meet in the Middle Key Recovery Attacks -- Key Recovery Attack in the FIL-MAC Setting -- Key Recovery Attack in the Stream Cipher Setting -- (Second) Preimage Attack on the Hashing Applications -- Meet-in-the-Middle (Second) Preimage Attack -- Inverting the Compression Function -- Experimental Verifications -- Generalization of the Parallel Matching Algorithm -- The Generalized Problem 1 -- Generalized Parallel Matching Algorithm -- Link with Formulas in the Case of ARMADILLO -- Conclusion -- References -- An Experimentally Verified Attack on Full Grain-128 Using Dedicated Reconfigurable Hardware -- Introduction -- Preliminaries -- Description on Grain-128 -- Previous Results on Grain-128 -- Cube Testers -- Dynamic Cube Attacks -- A Partial Simulation Phase -- A New Approach for Attacking Grain-128 -- Description of the Dedicated Hardware Used to Attack Grain-128 -- Architectural Considerations -- Hardware Implementation Results -- Conclusions -- References. Biclique Cryptanalysis of the Full AES. |
| Record Nr. | UNISA-996466249803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computing and Combinatorics [[electronic resource] ] : 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020, Proceedings / / edited by Donghyun Kim, R. N. Uma, Zhipeng Cai, Dong Hoon Lee
| Computing and Combinatorics [[electronic resource] ] : 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020, Proceedings / / edited by Donghyun Kim, R. N. Uma, Zhipeng Cai, Dong Hoon Lee |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (691 pages) |
| Disciplina | 511.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer engineering Computer networks Data structures (Computer science) Information theory Artificial intelligence Theory of Computation Computer Engineering and Networks Data Structures and Information Theory Artificial Intelligence |
| ISBN | 3-030-58150-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Subspace approximation with outliers -- Linear-time Algorithms for Eliminating Claws in Graphs -- A new lower bound for the eternal vertex cover number of graphs -- Bounded-Degree Spanners in the Presence of Polygonal Obstacles -- End-Vertices of AT-free Bigraphs -- Approaching Optimal Duplicate Detection in a Sliding Window -- Computational Complexity Characterization of Protecting Elections from Bribery -- Coding with Noiseless Feedback over the Z-channel -- Path-monotonic Upward Drawings of Plane Graphs -- Seamless Interpolation between Contraction Hierarchies and Hub Labels for fast and space-e cient Shortest Path Queries in Road Networks -- Visibility polygon queries among dynamic polygonal obstacles in plane -- How Hard is Completeness Reasoning for Conjunctive Queries? -- Imbalance Parameterized by Twin Cover Revisited -- Local Routing in a Tree Metric 1-Spanner -- Deep Specification Mining with Attention -- Constructing Independent Spanning Trees in Alternating Group Networks -- W[1]-Hardness of the k-Center Problem Parameterized by the Skeleton Dimension -- An Optimal Lower Bound for Hierarchical Universal Solutions for TSP on the Plane -- Quantum Speedup for the Minimum Steiner Tree Problem -- Access Structure Hiding Secret Sharing from Novel Set Systems and Vector Families -- Approximation algorithms for car-sharing problems -- Realization Problems on Reachability Sequences -- Power of Decision Trees with Monotone Queries -- Computing a maximum clique in geometric superclasses of disk graphs -- Visibility -- Tight approximation for the minimum bottleneck generalized matching problem -- Graph Classes and Approximability of the Happy Set Problem -- A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs -- Uniqueness of $DP$-Nash Subgraphs and $D$-sets -- On the Enumeration of Minimal Non-Pairwise Compatibility Graphs -- Constructing Tree Decompositions of Graphs with Bounded Gonality -- Election Control through Social In uence with Unknown Preferences -- New Symmetry-less ILP Formulation for the Classical One Dimensional Bin-Packing Problem -- On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs -- On the Restricted 1-Steiner Tree Problem -- Computational Complexity of Synchronization under Regular Commutative Constraints -- Approximation algorithms for general cluster routing problem -- Hardness of Sparse Sets and Minimal Circuit Size Problem -- Succinct Monotone Circuit Certi cation: Planarity and Parameterized Complexity -- On Measures of Space Over Real and Complex Numbers -- Parallelized maximization of nonsubmodular function subject to a cardinality constraint -- An improved Bregman $k$-means++ algorithm via local search -- On the Complexity of Directed Intersection Representation of DAGs -- On the Mystery of Negations in Circuits : Structure vs Power -- Even better xed-parameter algorithms for bicluster editing -- Approximate Set Union via Approximate Randomization -- A Non-Extendibility Certi cate for Submodularity and Applications -- Parameterized Complexity of Maximum Edge Colorable Subgraph -- Approximation Algorithms for the Lower-Bounded k-Median and Ist Generalizations -- A Survey for Conditional Diagnosability of Alternating Group Networks -- Fixed Parameter Tractability of Graph Deletion Problems over Data Streams -- Mixing of Markov Chains for Independent Sets on Chordal Graphs with Bounded Separators. |
| Record Nr. | UNISA-996418294103316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computing and Combinatorics : 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020, Proceedings / / edited by Donghyun Kim, R. N. Uma, Zhipeng Cai, Dong Hoon Lee
| Computing and Combinatorics : 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020, Proceedings / / edited by Donghyun Kim, R. N. Uma, Zhipeng Cai, Dong Hoon Lee |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (691 pages) |
| Disciplina | 511.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer engineering Computer networks Data structures (Computer science) Information theory Artificial intelligence Theory of Computation Computer Engineering and Networks Data Structures and Information Theory Artificial Intelligence |
| ISBN | 3-030-58150-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Subspace approximation with outliers -- Linear-time Algorithms for Eliminating Claws in Graphs -- A new lower bound for the eternal vertex cover number of graphs -- Bounded-Degree Spanners in the Presence of Polygonal Obstacles -- End-Vertices of AT-free Bigraphs -- Approaching Optimal Duplicate Detection in a Sliding Window -- Computational Complexity Characterization of Protecting Elections from Bribery -- Coding with Noiseless Feedback over the Z-channel -- Path-monotonic Upward Drawings of Plane Graphs -- Seamless Interpolation between Contraction Hierarchies and Hub Labels for fast and space-e cient Shortest Path Queries in Road Networks -- Visibility polygon queries among dynamic polygonal obstacles in plane -- How Hard is Completeness Reasoning for Conjunctive Queries? -- Imbalance Parameterized by Twin Cover Revisited -- Local Routing in a Tree Metric 1-Spanner -- Deep Specification Mining with Attention -- Constructing Independent Spanning Trees in Alternating Group Networks -- W[1]-Hardness of the k-Center Problem Parameterized by the Skeleton Dimension -- An Optimal Lower Bound for Hierarchical Universal Solutions for TSP on the Plane -- Quantum Speedup for the Minimum Steiner Tree Problem -- Access Structure Hiding Secret Sharing from Novel Set Systems and Vector Families -- Approximation algorithms for car-sharing problems -- Realization Problems on Reachability Sequences -- Power of Decision Trees with Monotone Queries -- Computing a maximum clique in geometric superclasses of disk graphs -- Visibility -- Tight approximation for the minimum bottleneck generalized matching problem -- Graph Classes and Approximability of the Happy Set Problem -- A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs -- Uniqueness of $DP$-Nash Subgraphs and $D$-sets -- On the Enumeration of Minimal Non-Pairwise Compatibility Graphs -- Constructing Tree Decompositions of Graphs with Bounded Gonality -- Election Control through Social In uence with Unknown Preferences -- New Symmetry-less ILP Formulation for the Classical One Dimensional Bin-Packing Problem -- On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs -- On the Restricted 1-Steiner Tree Problem -- Computational Complexity of Synchronization under Regular Commutative Constraints -- Approximation algorithms for general cluster routing problem -- Hardness of Sparse Sets and Minimal Circuit Size Problem -- Succinct Monotone Circuit Certi cation: Planarity and Parameterized Complexity -- On Measures of Space Over Real and Complex Numbers -- Parallelized maximization of nonsubmodular function subject to a cardinality constraint -- An improved Bregman $k$-means++ algorithm via local search -- On the Complexity of Directed Intersection Representation of DAGs -- On the Mystery of Negations in Circuits : Structure vs Power -- Even better xed-parameter algorithms for bicluster editing -- Approximate Set Union via Approximate Randomization -- A Non-Extendibility Certi cate for Submodularity and Applications -- Parameterized Complexity of Maximum Edge Colorable Subgraph -- Approximation Algorithms for the Lower-Bounded k-Median and Ist Generalizations -- A Survey for Conditional Diagnosability of Alternating Group Networks -- Fixed Parameter Tractability of Graph Deletion Problems over Data Streams -- Mixing of Markov Chains for Independent Sets on Chordal Graphs with Bounded Separators. |
| Record Nr. | UNINA-9910416079703321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Information Security and Cryptology - ICISC 2003 [[electronic resource] ] : 6th International Conference, Seoul, Korea, November 27-28, 2003, Revised Papers / / edited by Jong In Lim, Dong Hoon Lee
| Information Security and Cryptology - ICISC 2003 [[electronic resource] ] : 6th International Conference, Seoul, Korea, November 27-28, 2003, Revised Papers / / edited by Jong In Lim, Dong Hoon Lee |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XII, 464 p.) |
| Disciplina | 005.8 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data encryption (Computer science)
Computer communication systems Operating systems (Computers) Algorithms Computer science—Mathematics Management information systems Computer science Cryptology Computer Communication Networks Operating Systems Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Management of Computing and Information Systems |
| ISBN |
1-280-30725-0
9786610307258 3-540-24691-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk -- Binary Tree Encryption: Constructions and Applications -- Digital Signatures I -- A Separable Threshold Ring Signature Scheme -- On the Security of a Group Signature Scheme with Forward Security -- An Efficient Strong Designated Verifier Signature Scheme -- Primitives -- Sound Computational Interpretation of Formal Encryption with Composed Keys -- On the Security of a New Variant of OMAC -- New Methods to Construct Cheating Immune Functions -- Yet Another Definition of Weak Collision Resistance and Its Analysis -- Fast Implementations -- Implementation of Tate Pairing on Hyperelliptic Curves of Genus 2 -- A General Expansion Method Using Efficient Endomorphisms -- Design of Bit Parallel Multiplier with Lower Time Complexity -- Architecture for an Elliptic Curve Scalar Multiplication Resistant to Some Side-Channel Attacks -- Efficient Scalar Multiplication in Hyperelliptic Curves Using A New Frobenius Expansion -- Computer Security/Mobile Security -- Adaptive Protocol for Entity Authentication and Key Agreement in Mobile Networks -- Extended Role Based Access Control and Procedural Restrictions -- Layer-Based Access Control Model in the Manufacturing Infrastructure and Design Automation System -- Voting/Auction Protocols -- Secure Double Auction Protocols with Full Privacy Protection -- Sealed-Bid Auctions with Efficient Bids -- Providing Receipt-Freeness in Mixnet-Based Voting Protocols -- Receipt-Free Electronic Auction Schemes Using Homomorphic Encryption -- Watermarking -- Software Watermarking Through Register Allocation: Implementation, Analysis, and Attacks -- Analysis of the Bounds for Linear Block Codes in Watermark Channel -- Digital Signatures II -- Security Analysis of Some Proxy Signatures -- A More Secure and Efficacious TTS Signature Scheme -- An Efficient Revocation Algorithm in Group Signatures -- Efficient Forward and Provably Secure ID-Based Signcryption Scheme with Public Verifiability and Public Ciphertext Authenticity -- Authentication/Threshold Protocols -- Group Oriented Cryptosystems Based on Linear Access Structures -- A New Algorithm for Searching a Consistent Set of Shares in a Threshold Scheme with Cheaters -- Non-interactive Deniable Ring Authentication -- Block/Stream Ciphers -- Differential Cryptanalysis of TEA and XTEA -- A Complete Divide and Conquer Attack on the Alpha1 Stream Cipher -- New Block Cipher: ARIA -- Truncated Differential Attacks on 8-Round CRYPTON. |
| Record Nr. | UNISA-996465534903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Information Security and Cryptology - ICISC 2003 : 6th International Conference, Seoul, Korea, November 27-28, 2003, Revised Papers / / edited by Jong In Lim, Dong Hoon Lee
| Information Security and Cryptology - ICISC 2003 : 6th International Conference, Seoul, Korea, November 27-28, 2003, Revised Papers / / edited by Jong In Lim, Dong Hoon Lee |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XII, 464 p.) |
| Disciplina | 005.8 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data encryption (Computer science)
Computer communication systems Operating systems (Computers) Algorithms Computer science—Mathematics Management information systems Computer science Cryptology Computer Communication Networks Operating Systems Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Management of Computing and Information Systems |
| ISBN |
1-280-30725-0
9786610307258 3-540-24691-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk -- Binary Tree Encryption: Constructions and Applications -- Digital Signatures I -- A Separable Threshold Ring Signature Scheme -- On the Security of a Group Signature Scheme with Forward Security -- An Efficient Strong Designated Verifier Signature Scheme -- Primitives -- Sound Computational Interpretation of Formal Encryption with Composed Keys -- On the Security of a New Variant of OMAC -- New Methods to Construct Cheating Immune Functions -- Yet Another Definition of Weak Collision Resistance and Its Analysis -- Fast Implementations -- Implementation of Tate Pairing on Hyperelliptic Curves of Genus 2 -- A General Expansion Method Using Efficient Endomorphisms -- Design of Bit Parallel Multiplier with Lower Time Complexity -- Architecture for an Elliptic Curve Scalar Multiplication Resistant to Some Side-Channel Attacks -- Efficient Scalar Multiplication in Hyperelliptic Curves Using A New Frobenius Expansion -- Computer Security/Mobile Security -- Adaptive Protocol for Entity Authentication and Key Agreement in Mobile Networks -- Extended Role Based Access Control and Procedural Restrictions -- Layer-Based Access Control Model in the Manufacturing Infrastructure and Design Automation System -- Voting/Auction Protocols -- Secure Double Auction Protocols with Full Privacy Protection -- Sealed-Bid Auctions with Efficient Bids -- Providing Receipt-Freeness in Mixnet-Based Voting Protocols -- Receipt-Free Electronic Auction Schemes Using Homomorphic Encryption -- Watermarking -- Software Watermarking Through Register Allocation: Implementation, Analysis, and Attacks -- Analysis of the Bounds for Linear Block Codes in Watermark Channel -- Digital Signatures II -- Security Analysis of Some Proxy Signatures -- A More Secure and Efficacious TTS Signature Scheme -- An Efficient Revocation Algorithm in Group Signatures -- Efficient Forward and Provably Secure ID-Based Signcryption Scheme with Public Verifiability and Public Ciphertext Authenticity -- Authentication/Threshold Protocols -- Group Oriented Cryptosystems Based on Linear Access Structures -- A New Algorithm for Searching a Consistent Set of Shares in a Threshold Scheme with Cheaters -- Non-interactive Deniable Ring Authentication -- Block/Stream Ciphers -- Differential Cryptanalysis of TEA and XTEA -- A Complete Divide and Conquer Attack on the Alpha1 Stream Cipher -- New Block Cipher: ARIA -- Truncated Differential Attacks on 8-Round CRYPTON. |
| Record Nr. | UNINA-9910144204303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Information Security Applications [[electronic resource] ] : 13th International Workshop, WISA 2012, Jeju Island, Korea, August 16-18, 2012, Revised Selected Papers / / edited by Dong Hoon Lee, Moti Yung
| Information Security Applications [[electronic resource] ] : 13th International Workshop, WISA 2012, Jeju Island, Korea, August 16-18, 2012, Revised Selected Papers / / edited by Dong Hoon Lee, Moti Yung |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XII, 371 p. 135 illus.) |
| Disciplina | 004 |
| Collana | Security and Cryptology |
| Soggetto topico |
Computer networks
Algorithms Cryptography Data encryption (Computer science) Electronic data processing—Management Application software Data protection Computer Communication Networks Cryptology IT Operations Computer and Information Systems Applications Data and Information Security |
| ISBN | 3-642-35416-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Security on LBlock against Biclique Cryptanalysis -- Improved Impossible Differential Attacks on Reduced-Round MISTY1.- Efficient Parallel Evaluation of Multivariate Quadratic Polynomials on GPUs.- Enumeration of Even-Variable Boolean Functions with Maximum Algebraic Immunity.- Multi-precision Multiplication for Public-Key Cryptography on Embedded Microprocessors.- Three Phase Dynamic Current Mode Logic: A More Secure DyCML to Achieve a More Balanced Power Consumption.- Improved Differential Fault Analysis on Block Cipher ARIA.- Multi-Level Controlled Signature.- Tate Pairing Computation on Generalized Hessian Curves -- Reduction-Centric Non-programmable Security Proof for the Full Domain Hash in the Random Oracle Model.- An Authentication and Key Management Scheme for the Proxy Mobile IPv6.- Payment Approval for PayWord -- Anonymity-Based Authenticated Key Agreement with Full Binding Property.- A Study for Classification of Web Browser Log and Timeline Visualization.- Intellectual Property Protection for Integrated Systems Using Soft Physical Hash Functions.- N-Victims: An Approach to Determine N-Victims for APT Investigations.- An Efficient Filtering Method for Detecting Malicous Web Pages.- Lightweight Client-Side Methods for Detecting Email Forgery.- AIGG Threshold Based HTTP GET Flooding Attack Detection.- Implementation of GESNIC for Web Server Protection against HTTP GET Flooding Attacks.- Privacy-Aware VANET Security: Putting Data-Centric Misbehavior and Sybil Attack Detection Schemes into Practice.- On Trigger Detection against Reactive Jamming Attacks: A Localized Solution.- Efficient Self-organized Trust Management in Location Privacy Enhanced VANETs.- A Trust Management Model for QoS-Based Service Selection.- Multilevel Secure Database on Security Enhanced Linux for System High Distributed Systems. |
| Record Nr. | UNISA-996465946403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||