Edizione	[1st ed. 2010.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Descrizione fisica	1 online resource (X, 315 p. 158 illus.)
Disciplina	516.00285
Collana	Theoretical Computer Science and General Issues
Soggetto topico	Computer graphics Computer programming Computer science Computer science—Mathematics Discrete mathematics Algorithms Pattern recognition systems Computer Graphics Programming Techniques Theory of Computation Discrete Mathematics in Computer Science Automated Pattern Recognition
ISBN	1-280-38688-6 9786613564801 3-642-13411-4
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Global Solutions of Well-Constrained Transcendental Systems Using Expression Trees and a Single Solution Test -- Surfaces with Rational Chord Length Parameterization -- Support Function of Pythagorean Hodograph Cubics and G 1 Hermite Interpolation -- Piecewise Tri-linear Contouring for Multi-material Volumes -- An Efficient Algorithm for the Sign Condition Problem in the Semi-algebraic Context -- Constraints on Curve Networks Suitable for G 2 Interpolation -- Computing the Distance between Canal Surfaces -- A Subdivision Approach to Planar Semi-algebraic Sets -- Non-manifold Medial Surface Reconstruction from Volumetric Data -- Decomposing Scanned Assembly Meshes Based on Periodicity Recognition and Its Application to Kinematic Simulation Modeling -- Automatic Generation of Riemann Surface Meshes -- G 1 Bézier Surface Generation from Given Boundary Curve Network with T-Junction -- Efficient Point Projection to Freeform Curves and Surfaces -- Construction of Minimal Catmull-Clark’s Subdivision Surfaces with Given Boundaries -- Parameterization of Star-Shaped Volumes Using Green’s Functions -- Optimal Analysis-Aware Parameterization of Computational Domain in Isogeometric Analysis -- Construction of Subdivision Surfaces by Fourth-Order Geometric Flows with G 1 Boundary Conditions -- Efficient Computation of 3D Clipped Voronoi Diagram -- Selecting Knots Locally for Curve Interpolation with Quadratic Precision -- Eigenmodes of Surface Energies for Shape Analysis.
Record Nr.	UNISA-996465639803316

Edizione	[1st ed. 2008.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008
Descrizione fisica	1 online resource (XV, 606 p.)
Disciplina	004
Collana	Theoretical Computer Science and General Issues
Soggetto topico	Image processing—Digital techniques Computer vision Computer graphics Computer simulation Machine theory Pattern recognition systems Computer science—Mathematics Discrete mathematics Computer Imaging, Vision, Pattern Recognition and Graphics Computer Graphics Computer Modelling Formal Languages and Automata Theory Automated Pattern Recognition Discrete Mathematics in Computer Science
ISBN	3-540-79246-5
Classificazione	DAT 756f SS 4800
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	RegularPapers -- Automatic PolyCube-Maps -- Bicubic G1 Interpolation of Irregular Quad Meshes Using a 4-Split -- Bounding the Distance between a Loop Subdivision Surface and Its Limit Mesh -- A Carving Framework for Topology Simplification of Polygonal Meshes -- Comparing Small Visual Differences between Conforming Meshes -- Continuous Collision Detection between Two 2D Curved-Edge Polygons under Rational Motions -- Controlling Torsion Sign -- Cutting and Fracturing Models without Remeshing -- Detection of Planar Regions in Volume Data for Topology Optimization -- Determining Directional Contact Range of Two Convex Polyhedra -- Efficient Collision Detection Using a Dual Bounding Volume Hierarchy -- Fast and Local Fairing of B-Spline Curves and Surfaces -- Finite Element Methods for Geometric Modeling and Processing Using General Fourth Order Geometric Flows -- Geodesic as Limit of Geodesics on PL-Surfaces -- Hausdorff and Minimal Distances between Parametric Freeforms in and -- On Interpolation by Spline Curves with Shape Parameters -- Lepp Terminal Centroid Method for Quality Triangulation: A Study on a New Algorithm -- Mean Value Bézier Maps -- Meaningful Mesh Segmentation Guided by the 3D Short-Cut Rule -- Mesh Simplification with Vertex Color -- A Multistep Approach to Restoration of Locally Undersampled Meshes -- Noise Removal Based on the Variation of Digitized Energy -- Note on Industrial Applications of Hu’s Surface Extension Algorithm -- Parameterizing Marching Cubes Isosurfaces with Natural Neighbor Coordinates -- Parametric Polynomial Minimal Surfaces of Degree Six with Isothermal Parameter -- Physically-Based Surface Texture Synthesis Using a Coupled Finite Element System -- Planar Shape Matching and Feature Extraction Using Shape Profile -- Reconstructing a Mesh from a Point Cloud by Using a Moving Parabolic Approximation -- A Revisit to Least Squares Orthogonal Distance Fitting of Parametric Curves and Surfaces -- Shifting Planes to Follow a Surface of Revolution -- Slit Map: Conformal Parameterization for Multiply Connected Surfaces -- Solving Systems of 3D Geometric Constraints with Non-rigid Clusters -- Space-Time Curve Analogies for Motion Editing -- Variational Skinning of an Ordered Set of Discrete 2D Balls -- Short Papers -- 3D Mesh Segmentation Using Mean-Shifted Curvature -- Convex Surface Interpolation -- Deformation and Smooth Joining of Mesh Models for Cardiac Surgical Simulation -- Digital Design for Functionally Graded Material Components Rapid Prototyping Manufacturing -- Layer-Based Mannequin Reconstruction and Parameterization from 3D Range Data -- Manifoldization of ?-Shapes by Topology Operators -- A Mesh Simplification Method Using Noble Optimal Positioning -- Narrow-Band Based Radial Basis Functions Implicit Surface Reconstruction -- Progressive Interpolation Using Loop Subdivision Surfaces -- Protein Surface Modeling Using Active Contour Model -- Quasi-interpolation for Data Fitting by the Radial Basis Functions -- A Shape Feature Based Simplification Method for Deforming Meshes -- Shape Representation and Invariant Description of Protein Tertiary Structure in Applications to Shape Retrieval and Classification -- The Structure of V-System over Triangulated Domains -- Tool Path Planning for 5-Axis Flank Milling Based on Dynamic Programming Techniques -- Trimming Bézier Surfaces on Bézier Surfaces Via Blossoming -- A Volumetric Framework for the Modeling and Rendering of Dynamic and Heterogeneous Scenes -- Geometric Calibration of Projector Imagery on Curved Screen Based-on Subdivision Mesh -- A Comment -- A Comment on ‘Constructing Regularity Feature Trees for Solid Models’.
Record Nr.	UNISA-996465744403316

Edizione	[1st ed. 2005.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005
Descrizione fisica	1 online resource (XXI, 1198 p.)
Disciplina	004/.36
Collana	Information Systems and Applications, incl. Internet/Web, and HCI
Soggetto topico	Computer communication systems Software engineering Computer programming Operating systems (Computers) Algorithms Computer science—Mathematics Computer Communication Networks Software Engineering Programming Techniques Operating Systems Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science
Classificazione	54.32
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Telemedical Applications and Grid Technology -- Statistical Modeling and Segmentation in Cardiac MRI Using a Grid Computing Approach -- A Grid Molecular Simulator for E-Science -- Application Driven Grid Developments in the OpenMolGRID Project -- ATLAS Data Challenge 2: A Massive Monte Carlo Production on the Grid -- High Throughput Computing for Spatial Information Processing (HIT-SIP) System on Grid Platform -- The University of Virginia Campus Grid: Integrating Grid Technologies with the Campus Information Infrastructure -- M-Grid: Using Ubiquitous Web Technologies to Create a Computational Grid -- GLIDE: A Grid-Based Light-Weight Infrastructure for Data-Intensive Environments -- HotGrid: Graduated Access to Grid-Based Science Gateways -- Principles of Transactional Grid Deployment -- Experience with the International Testbed in the CrossGrid Project -- eNANOS Grid Resource Broker -- GridARM: Askalon’s Grid Resource Management System -- A Super-Peer Model for Building Resource Discovery Services in Grids: Design and Simulation Analysis -- Ontology-Based Grid Index Service for Advanced Resource Discovery and Monitoring -- Grid Service Based Collaboration for VL-e: Requirements, Analysis and Design -- A Fully Decentralized Approach to Grid Service Discovery Using Self-organized Overlay Networks -- Dynamic Parallelization of Grid–Enabled Web Services -- Automatic Composition and Selection of Semantic Web Services -- Grid Application Monitoring and Debugging Using the Mercury Monitoring System -- Interactive Visualization of Grid Monitoring Data on Multiple Client Platforms -- GridBench: A Workbench for Grid Benchmarking -- A Method for Estimating the Execution Time of a Parallel Task on a Grid Node -- Performance of a Parallel Astrophysical N-Body Solver on Pan-European Computational Grids -- Introducing Grid Speedup ? : A Scalability Metric for Parallel Applications on the Grid -- A Dynamic Key Infrastructure for Grid -- Experiences of Applying Advanced Grid Authorisation Infrastructures -- Towards a Grid-wide Intrusion Detection System -- International Grid CA Interworking, Peer Review and Policy Management Through the European DataGrid Certification Authority Coordination Group -- Grid Enabled Optimization -- Towards a Coordination Model for Parallel Cooperative P2P Multi-objective Optimization -- A Grid-Oriented Genetic Algorithm -- A Probabilistic Approach for Task and Result Certification of Large-Scale Distributed Applications in Hostile Environments -- A Service Oriented Architecture for Decision Making in Engineering Design -- A Grid Architecture for Comfortable Robot Control -- The Grid-Ireland Deployment Architecture -- UNICORE as Uniform Grid Environment for Life Sciences -- MyGridFTP: A Zero-Deployment GridFTP Client Using the .NET Framework -- On Using Jini and JXTA in Lightweight Grids -- Ticket-Based Grid Services Architecture for Dynamic Virtual Organizations -- Heterogeneity of Computing Nodes for Grid Computing -- Effective Job Management in the Virtual Laboratory -- Workflow Management in the CrossGrid Project -- Workflow-Oriented Collaborative Grid Portals -- Contextualised Workflow Execution in MyGrid -- Real World Workflow Applications in the Askalon Grid Environment -- OpenMolGRID: Using Automated Workflows in GRID Computing Environment -- Implementation of Replication Methods in the Grid Environment -- A Secure Wrapper for OGSA-DAI -- XDTM: The XML Data Type and Mapping for Specifying Datasets -- iGrid, a Novel Grid Information Service -- A Grid-Enabled Digital Library System for Natural Disaster Metadata -- Optimising Parallel Applications on the Grid Using Irregular Array Distributions -- Dynamic Adaptation for Grid Computing -- Improving Multilevel Approach for Optimizing Collective Communications in Computational Grids -- Rough Set Based Computation Times Estimation on Knowledge Grid -- A Behavior Characteristics-Based Reputation Evaluation Method for Grid Entities -- Dynamic Policy Management Framework for Partial Policy Information -- Security Architecture for Open Collaborative Environment -- An Experimental Information Grid Environment for Cultural Heritage Knowledge Sharing -- Implementation of Federated Databases Through Updatable Views -- Data Mining Tools: From Web to Grid Architectures -- Fault-Tolerant Scheduling for Bag-of-Tasks Grid Applications -- The Design and Implementation of the KOALA Co-allocating Grid Scheduler -- A Multi-agent Infrastructure and a Service Level Agreement Negotiation Protocol for Robust Scheduling in Grid Computing -- Towards Quality of Service Support for Grid Workflows -- Transparent Fault Tolerance for Grid Applications -- Learning Automata Based Algorithms for Mapping of a Class of Independent Tasks over Highly Heterogeneous Grids -- Grid Resource Broker Using Application Benchmarking -- The Grid Block Device: Performance in LAN and WAN Environments -- WS-Based Discovery Service for Grid Computing Elements -- Rapid Distribution of Tasks on a Commodity Grid -- Modeling Execution Time of Selected Computation and Communication Kernels on Grids -- Parallel Checkpointing on a Grid-Enabled Java Platform -- Fault Tolerance in the R-GMA Information and Monitoring System -- Deployment of Grid Gateways Using Virtual Machines -- Development of Cactus Driver for CFD Analyses in the Grid Computing Environment -- Striped Replication from Multiple Sites in the Grid Environment -- The Gridkit Distributed Resource Management Framework -- Stochastic Approach for Secondary Storage Data Access Cost Estimation -- A Cluster-Based Dynamic Load Balancing Middleware Protocol for Grids -- Reconfigurable Scientific Applications on GRID Services -- Geographic Information Systems Grid -- Tools for Distributed Development and Deployment on the Grid -- DNS-Based Discovery System in Service Oriented Programming -- Experiences with Deploying Legacy Code Applications as Grid Services Using GEMLCA, -- A Framework for Job Management in the NorduGrid ARC Middleware -- Data Management in Flood Prediction -- Adaptive Task Scheduling in Computational GRID Environments -- Large-Scale Computational Finance Applications on the Open Grid Service Environment -- Localized Communications of Data Parallel Programs on Multi-cluster Grid Systems -- VIRGO: Virtual Hierarchical Overlay Network for Scalable Grid Computing -- A Monitoring Architecture for Control Grids -- Mobile-to-Grid Middleware: Bridging the Gap Between Mobile and Grid Environments -- Role of N1 Technology in the Next Generation Grids Middleware -- Optimizing Grid Application Setup Using Operating System Mobility -- GriddLeS Enhancements and Building Virtual Applications for the GRID with Legacy Components -- Application Oriented Brokering in Medical Imaging: Algorithms and Software Architecture -- A Performance Contract System in a Grid Enabling, Component Based Programming Environment -- A WSRF Based Shopping Cart System -- Grid Access Middleware for Handheld Devices -- An Extendable GRID Application Portal -- A Task Replication and Fair Resource Management Scheme for Fault Tolerant Grids -- CrossGrid Integrated Workflow Management System -- Load Balancing by Changing the Graph Connectivity on Heterogeneous Clusters -- Threat Model for Grid Security Services -- A Loosely Coupled Application Model for Grids -- A Locking Protocol for a Distributed Computing Environment -- Grid-Based SLA Management -- A Heuristic Algorithm for Mapping Parallel Applications on Computational Grids -- A Bypass of Cohen’s Impossibility Result -- Mapping Workflows onto Grid Resources Within an SLA Context -- iShare – Open Internet Sharing Built on Peer-to-Peer and Web -- A Service-Based Architecture for Integrating Globus 2 and Globus 3 -- The CampusGrid Test Bed at Forschungszentrum Karlsruhe -- A Model for Flexible Service Use and Secure Resource Management -- Online Performance Monitoring and Analysis of Grid Scientific Workflows -- WebGrid: A New Paradigm for Web System -- Dynamic Failure Management for Parallel Applications on Grids -- A Novel Intrusion Detection Method for Mobile Ad Hoc Networks.
Record Nr.	UNISA-996465815403316

Edizione	[1st ed. 2015.]
Pubbl/distr/stampa	Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015
Descrizione fisica	1 online resource (XIII, 357 p. 51 illus.)
Disciplina	005.8
Collana	Security and Cryptology
Soggetto topico	Computer security Data encryption (Computer science) Computer science—Mathematics Algorithms Computer communication systems Systems and Data Security Cryptology Discrete Mathematics in Computer Science Algorithm Analysis and Problem Complexity Computer Communication Networks
ISBN	3-319-22425-5
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Intro -- Preface -- IWSEC 2015 10th International Workshop on Security -- Contents -- Identity-Based Encryption -- Identity-Based Lossy Encryption from Learning with Errors -- 1 Introduction -- 1.1 Background -- 1.2 Our Contributions -- 1.3 Related Work -- 1.4 Organization -- 2 Preliminaries -- 2.1 Notations -- 2.2 Min-Entropy -- 2.3 Learning with Errors -- 2.4 Discrete Gaussians -- 2.5 Lossy Encryption -- 2.6 Some Results About Randomness -- 3 Identity-Based Lossy Encryption -- 3.1 Selective Opening Security -- 3.2 Construction from LWE -- 4 Conclusion -- References -- Adaptive-ID Secure Revocable Hierarchical Identity-Based Encryption -- 1 Introduction -- 2 Preliminaries -- 3 Revocable Hierarchical Identity-Based Encryption -- 4 Proposed Adaptive-ID Secure RHIBE -- 5 Conclusion -- References -- Elliptic Curve Cryptography -- Invalid Curve Attacks in a GLS Setting -- 1 Introduction -- 2 Preliminaries -- 3 Invalid Curve Attack on GLS Scalar Multiplication -- 4 Complexity Analysis -- 5 Implementations -- 6 Conclusion -- A Computation of (u) on u [1, 3] -- References -- New Fast Algorithms for Elliptic Curve Arithmetic in Affine Coordinates -- 1 Introduction -- 2 Preliminary -- 3 Speeding up Some Elliptic Curve Operations in Affine Coordinates -- 4 Comparisons -- 4.1 Point Operations -- 4.2 Scalar Multiplications -- 5 Conclusions -- References -- Factoring -- Implicit Factorization of RSA Moduli Revisited (Short Paper) -- 1 Introduction -- 2 Preliminaries -- 3 Previous Method of Factoring Two RSA Moduli with Implicitly Common Middle Bits -- 4 Our Improvement -- 5 Conclusion -- References -- Symmetric Cryptanalysis -- Improved (Pseudo) Preimage Attacks on Reduced-Round GOST and Grøstl-256 and Studies on Several Truncation Patterns for AES-like Compression Functions -- 1 Introduction -- 2 The Hash Function Family. 3 Improved Preimage Attacks on Reduced-Round GOST -- 3.1 Overview of the Preimage Attack on 5-Round GOST-256 -- 3.2 Phase 1. Construct the Multicollisions -- 3.3 Phase 2. Invert the Output Transformation -- 3.4 Phase 3. Generate the Preimage -- 3.5 Summarize the 5-Round Attack -- 3.6 Extend the Preimage Attack to More Rounds -- 4 Conclusion and Open Problems -- References -- Improvement on the Method for Automatic Differential Analysis and Its Application to Two Lightweight Block Ciphers DESL and LBlock-s -- 1 Introduction -- 2 MILP Based Framework for Automatic Differential Cryptanalysis -- 3 Techniques for Obtaining Better Characteristics -- 4 Application to DESL and LBlock-s -- 4.1 Improved Single-Key and Related-Key Differential Characteristics for DESL -- 4.2 Tighter Security Bound for LBlock-s -- 5 Conclusion and Discussion -- References -- Provable Security -- NM-CPA Secure Encryption with Proofs of Plaintext Knowledge -- 1 Introduction -- 2 Preliminaries -- 2.1 Public Key Encryption -- 2.2 Proofs of Knowledge -- 3 Our Scheme -- 4 Security Proof -- 5 Applications: Electronic Voting -- 5.1 Election Schemes -- 5.2 Sufficient Conditions for Ballot Secrecy -- 5.3 Towards a Secure Variant of Helios -- 6 Related Work -- 7 Conclusion -- A Proof of Theorem 1 -- A.1 Game 0: IND-1-CPA -- A.2 Game 1: Simulate Decryption Oracle -- A.3 Game 2: Simulate the Challenge Oracle -- A.4 Game 3: Embed a Challenge Ciphertext -- References -- Improvement of UC Secure Searchable Symmetric Encryption Scheme -- 1 Introduction -- 2 Verifiable Searchable Symmetric Encryption -- 2.1 System Model -- 2.2 Security Definition -- 2.3 Kurosawa-Ohtaki Scheme (KO-Scheme) -- 2.4 Inefficiency of KO-Scheme -- 3 Improvement of KO-Scheme -- 3.1 Concrete Description of Our Scheme -- 3.2 Security -- 3.3 Comparison -- 4 Conclusion -- References. Fully Leakage-Resilient Non-malleable Identification Schemes in the Bounded-Retrieval Model -- 1 Introduction -- 1.1 Our Contribution -- 1.2 Related Work -- 2 Preliminaries -- 2.1 Bilinear Groups and Hardness Assumptions -- 3 Definition of Fully Leakage Resilient Non-malleable Identification Schemes -- 3.1 Tag-Based Fully Leakage-Resilient Non-malleable Identification Schemes -- 4 A Tag-Based Fully Leakage-Resilient Non-malleable Identification Scheme -- 4.1 Proof of Theorem 1 -- 5 A Fully Leakage-Resilient Non-malleable Identification Scheme -- 5.1 Proof of Security -- References -- LWE-Based Encryption -- LWE-Based FHE with Better Parameters -- 1 Introduction -- 1.1 Motivation and Techniques -- 1.2 Contribution -- 1.3 Other Related Works -- 1.4 Roadmap -- 2 Preliminaries -- 2.1 Homomorphism -- 2.2 Useful Tools -- 2.3 Learning with Errors -- 3 Building Block -- 4 A New LWE-Based PK-FHE -- 4.1 FHE Scheme: YAP -- 4.2 Homomorphic Property of YAP -- 4.3 Bootstrapping and Unbounded PK-FHE -- 5 Conclusions -- References -- Improved Efficiency of MP12 -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Related Works -- 2 Preliminaries -- 2.1 Tag-Based Encryption -- 2.2 Selective-Tag Weak CCA Security -- 2.3 Lattices -- 3 The Learning with Errors (LWE) Problem -- 3.1 Knapsack LWE -- 3.2 Extended-(knapsack) LWE -- 3.3 The Gadget Matrix G -- 4 Description of Our Scheme -- 4.1 Our Scheme -- 5 Conclusion -- References -- Secret Sharing -- Almost Optimum Secret Sharing Schemes with Cheating Detection for Random Bit Strings -- 1 Introduction -- 2 Preliminaries -- 2.1 Secret Sharing Scheme -- 2.2 Cheating Detectable Secret Sharing Schemes -- 2.3 Existing Schemes Secure Under the OKS Model -- 3 Proposed Schemes -- 3.1 Generalization -- 4 Concluding Remarks -- References -- Privacy-Preserving and Anonymity -- k-Anonymous Microdata Release via Post Randomisation Method. 1 Introduction -- 1.1 Motivations -- 1.2 Contributions -- 1.3 Related Work -- 2 Preliminaries -- 2.1 Publishing Scenario -- 2.2 Notation -- 2.3 PRAM -- 2.4 k-Anonymity -- 2.5 Anonymization and Privacy Mechanisms -- 3 Pk-Anonymity -- 3.1 Background Knowledge of Adversary -- 3.2 Definition of Pk-Anonymity -- 4 Applying Pk-Anonymity to PRAM -- 5 Conclusions -- References -- On Limitations and Alternatives of Privacy-Preserving Cryptographic Protocols for Genomic Data -- 1 Introduction -- 2 Protecting Genome Privacy By Cryptography -- 2.1 Example: Privacy-Preserving Data Mining for Allele Frequency -- 2.2 Limitation of Computationally Secure Cryptographic Tools -- 2.3 Everlasting Security -- 3 An Example of Everlasting Security -- 3.1 Observation for the Desired Security -- 3.2 Security Definition -- 4 Preliminaries for Protocol Construction -- 5 Proposed Oblivious Transfer Protocol -- 5.1 Overview of the Construction -- 5.2 Construction -- 5.3 Security Analysis -- 5.4 Execution Cost -- 6 Discussion -- 7 Conclusion -- References -- Anonymous Credential System with Efficient Proofs for Monotone Formulas on Attributes -- 1 Introduction -- 1.1 Backgrounds -- 1.2 Previous Works -- 1.3 Our Contributions -- 2 Preliminaries -- 2.1 Bilinear Maps -- 2.2 Complexity Assumptions -- 2.3 AHO Structure-Preserving Signatures -- 2.4 Groth-Sahai (GS) Proof -- 3 Accumulator to Verify Monotone Formulas -- 3.1 Tag Assignment Algorithm -- 3.2 Correctness of Tag Assignment Algorithm -- 3.3 Accumulator to Verify Monotone Formulas -- 3.4 Correctness and Security of Accumulator -- 4 Syntax and Security Model of Anonymous Credential System -- 4.1 Syntax -- 4.2 Security Model -- 5 Proposed Anonymous Credential System -- 5.1 Construction Overview -- 5.2 Construction -- 5.3 Security -- 6 Efficiency Consideration -- 7 Conclusions -- A Security Model of Anonymous Credential System. A.1 Misauthentication Resistance -- A.2 Anonymity -- References -- Secure Protocol -- Secure Multi-Party Computation Using Polarizing Cards -- 1 Introduction -- 1.1 Background -- 1.2 Our Contribution -- 1.3 Related Works -- 2 Polarizing Cards -- 2.1 Polarizing Cards -- 2.2 Operations -- 3 Multi-party Computation Using Polarizing Cards -- 3.1 Model -- 3.2 Security -- 4 COPY, XOR, and AND Protocols -- 4.1 COPY Protocol -- 4.2 XOR Protocol -- 4.3 AND Protocol -- 5 Applications -- 5.1 Input-Preserving Protocols -- 5.2 Applications -- 6 Discussions -- 6.1 One-Card-Per-Bit Scheme -- 6.2 Attacks from Outside of Our Model -- References -- Systems Security -- An Analysis Platform for the Information Security of In-Vehicle Networks Connected with External Networks -- Abstract -- 1 Introduction -- 2 Information Security of an Automobile -- 2.1 Security Issues of an Automobile Connected to External Networks -- 2.2 Drawbacks of CAN -- 2.3 Related Work -- 3 Development of the Analysis Platform -- 3.1 Outline -- 3.2 Message Analysis Platform -- 3.3 Attack Evaluation Platform -- 4 Experiments with an Actual Car -- 4.1 Acquisition of Automotive Status -- 4.2 Spoofing Attack -- 4.3 DoS Attack -- 4.4 Consideration Over Protection Mechanism -- 5 Conclusion -- References -- Beyond Scale: An Efficient Framework for Evaluating Web Access Control Policies in the Era of Big Data -- 1 Introduction -- 2 Preliminaries -- 2.1 Overview of XACML -- 2.2 Processing Attributes -- 3 Two-Stage Clustering -- 3.1 First Stage Clustering -- 3.2 Transition Work -- 3.3 Second Stage Clustering -- 3.4 Other Work -- 4 Experimental Results -- 5 Related Work -- 6 Conclusion -- A Appendix -- References -- Artifact-Metric-Based Authentication for Bottles of Wine (Short Paper) -- 1 Introduction -- 1.1 Our Contributions -- 2 Design of Authentication System -- 2.1 Construction of Authentication System. 2.2 Authentication Algorithm and Preparation.
Record Nr.	UNISA-996199938303316

Edizione	[1st ed. 2013.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Descrizione fisica	1 online resource (XII, 319 p. 53 illus.)
Disciplina	005.8
Collana	Security and Cryptology
Soggetto topico	Computer security Data encryption (Computer science) Computer science—Mathematics Algorithms Computer communication systems Systems and Data Security Cryptology Discrete Mathematics in Computer Science Algorithm Analysis and Problem Complexity Computer Communication Networks
ISBN	3-642-41383-8
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Software and System Security -- Secure Log Transfer by Replacing a Library in a Virtual Machine -- Static Integer Overflow Vulnerability Detection in Windows Binary -- Solving Google’s Continuous Audio CAPTCHA with HMM-Based Automatic Speech Recognition -- Constructions of Almost Secure Frameproof Codes Based on Small-Bias Probability Spaces -- Cryptanalysis -- Differential Power Analysis of MAC-Keccak at Any Key-Length -- Generic State-Recovery and Forgery Attacks on ChopMD-MAC and on NMAC/HMAC -- New Property of Diffusion Switching Mechanism on CLEFIA and Its Application to DFA -- Improvement of Faug`ere et al.’s Method to Solve ECDLP -- Privacy and Cloud Computing -- Statistics on Encrypted Cloud Data -- Toward Practical Searchable Symmetric Encryption -- Unconditionally Secure Oblivious Transfer from Real Network Behavior -- Cryptographically-Secure and Efficient Remote Cancelable Biometrics Based on Public-Key Homomorphic Encryption -- Public Key Cryptosystems -- Efficient Algorithm for Tate Pairing of Composite Order -- How to Factor N1 and N2 When p1 = p2 mod 2t -- Achieving Chosen Ciphertext Security from Detectable Public Key Encryption Efficiently via Hybrid Encryption -- Cryptanalysis of the Quaternion Rainbow -- Security Protocols -- On Cheater Identifiable Secret Sharing Schemes Secure against Rushing Adversary -- One-Round Authenticated Key Exchange without Implementation Trick -- Attacks to the Proxy Re-Encryption Schemes from IWSEC2011 -- Game-Theoretic Security for Bit Commitment.
Record Nr.	UNISA-996465440603316