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 Conceptual Modeling - Challenging Perspectives [[electronic resource] ] : ER 2009 Workshops CoMoL, ETheCoM, FP-UML, MOST-ONISW, QoIS, RIGiM, SeCoGIS, Gramado, Brazil, November 9-12, 2009, Proceedings / / edited by Carlos A. Heuser, Günther Pernul
| Advances in Conceptual Modeling - Challenging Perspectives [[electronic resource] ] : ER 2009 Workshops CoMoL, ETheCoM, FP-UML, MOST-ONISW, QoIS, RIGiM, SeCoGIS, Gramado, Brazil, November 9-12, 2009, Proceedings / / edited by Carlos A. Heuser, Günther Pernul |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XIX, 358 p.) |
| Disciplina | 005.74/3 |
| Collana | Information Systems and Applications, incl. Internet/Web, and HCI |
| Soggetto topico |
Software engineering
Information storage and retrieval Data mining Computer programming Database management Software Engineering/Programming and Operating Systems Information Storage and Retrieval Data Mining and Knowledge Discovery Software Engineering Programming Techniques Database Management |
| Soggetto genere / forma |
Gramado (2009)
Kongress. |
| ISBN | 3-642-04947-8 |
| Classificazione |
DAT 310f
DAT 600f SS 4800 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | CoMoL 2009 – Conceptual Modeling in the Large -- Preface to CoMoL 2009 -- Semantic Service Design for Collaborative Business Processes in Internetworked Enterprises -- Algebraic Meta-structure Handling of Huge Database Schemata -- On Computing the Importance of Entity Types in Large Conceptual Schemas -- ETheCoM 2009 – First International Workshop on Evolving Theories of Conceptual Modelling -- Preface to ETheCoM 2009 -- Invited Talks -- Is It Important to Explain a Theorem? A Case Study on UML and -- Towards a Theory of Conceptual Modelling -- Accepted Papers -- Assessing Modal Aspects of OntoUML Conceptual Models in Alloy -- First-Order Types and Redundant Relations in Relational Databases -- On Matrix Representations of Participation Constraints -- Toward Formal Semantics for Data and Schema Evolution in Data Stream Management Systems -- XML Machines -- FP-UML 2009 – Fifth International Workshop on Foundations and Practices of UML -- Preface to FP-UML 2009 -- Dependability and Agent Modeling -- Applying AUML and UML 2 in the Multi-agent Systems Project -- A Collaborative Support Approach on UML Sequence Diagrams for Aspect-Oriented Software -- Applying a UML Extension to Build Use Cases Diagrams in a Secure Mobile Grid Application -- Semantics Representation and Tools -- The MP (Materialization Pattern) Model for Representing Math Educational Standards -- XMI2USE: A Tool for Transforming XMI to USE Specifications -- MOST-ONISW 2009 – The Joint International Workshop on Metamodels, Ontologies, Semantic Technologies, and Information Systems for the Semantic Web -- Preface to MOST-ONISW 2009 -- Analysis Procedure for Validation of Domain Class Diagrams Based on Ontological Analysis -- Ontology for Imagistic Domains: Combining Textual and Pictorial Primitives -- Using a Foundational Ontology for Reengineering a Software Enterprise Ontology -- Multi-level Conceptual Modeling and OWL -- QoIS 2009 – The Fourth International Workshop on Quality of Information Systems -- Preface to QoIS 2009 -- Assessment of Data Quality Factors -- Completeness in Databases with Maybe-Tuples -- Modeling, Measuring and Monitoring the Quality of Information -- Tools for Information System Quality Assessment -- Evaluating the Functionality of Conceptual Models -- Qbox-Services: Towards a Service-Oriented Quality Platform -- RIGiM 2009 – Third International Workshop on Requirements, Intentions and Goals in Conceptual Modeling -- Preface to RIGiM 2009 -- Modelling -- A Comparison of Goal-Oriented Approaches to Model Software Product Lines Variability -- A Lightweight GRL Profile for i* Modeling -- Elicitation Issues -- From User Goals to Service Discovery and Composition -- ITGIM: An Intention-Driven Approach for Analyzing the IT Governance Requirements -- Adapting the i* Framework for Software Product Lines -- SECOGIS 2009 – Third International Workshop on Semantic and Conceptual Issues in Geographic Information Systems -- Preface to SeCoGIS 2009 -- Foundational Aspects -- A New Point Access Method Based on Wavelet Trees -- A Reference System for Topological Relations between Compound Spatial Objects -- A Model for Geographic Knowledge Extraction on Web Documents -- Semantical Aspects -- A Semantic Approach to Describe Geospatial Resources -- An Ontology-Based Framework for Geographic Data Integration -- A Semantic Approach for the Modeling of Trajectories in Space and Time. |
| Record Nr. | UNISA-996465864903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computer Security -- ESORICS 2015 [[electronic resource] ] : 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part II / / edited by Günther Pernul, Peter Y A Ryan, Edgar Weippl
| Computer Security -- ESORICS 2015 [[electronic resource] ] : 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part II / / edited by Günther Pernul, Peter Y A Ryan, Edgar Weippl |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XVII, 665 p. 124 illus.) |
| Disciplina | 005.8 |
| Collana | Security and Cryptology |
| Soggetto topico |
Computer security
Data encryption (Computer science) Management information systems Computer science Algorithms Computers and civilization Systems and Data Security Cryptology Management of Computing and Information Systems Algorithm Analysis and Problem Complexity Computers and Society |
| ISBN | 3-319-24177-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Foreword -- Organization -- Contents - Part II -- Contents - Part I -- Privacy -- FP-Block: Usable Web Privacy by Controlling Browser Fingerprinting -- 1 Introduction -- 2 Related Work -- 2.1 Fingerprinting -- 2.2 Countermeasures -- 3 Determining the Fingerprint Surface -- 3.1 Limitations of Preventing Fingerprint Tracking -- 3.2 Fingerprint Vectors -- 3.3 Fingerprint Surface -- 4 Design -- 4.1 Balancing Usability vs. Privacy -- 4.2 Generating Web Identities -- 5 Development and Implementation -- 5.1 Development -- 5.2 Implementation -- 6 Experiments and Validation -- 7 Conclusions -- References -- Mind-Reading: Privacy Attacks Exploiting Cross-App KeyEvent Injections -- 1 Introduction -- 2 Background and Adversary Model -- 2.1 IME and Personalized User Dictionary -- 2.2 Adversary Model -- 3 Vulnerability Analysis -- 3.1 Android KeyEvent Processing Flow -- 3.2 Cross-App KeyEvent Injection Vulnerability -- 4 Attack -- 4.1 Enumerating Entries from Dictionary -- 4.2 Attack in Stealthy Mode -- 4.3 Case Study of IMEs for Non-Latin Languages -- 5 Evaluation -- 5.1 Scope of Attack -- 5.2 Experiment on Word Completion Attack Mode -- 5.3 Experiment on Next-Word Prediction Attack Mode -- 6 Defense -- 7 Related Works -- 8 Conclusion -- References -- Enabling Privacy-Assured Similarity Retrieval over Millions of Encrypted Records -- 1 Introduction -- 2 Related Works -- 3 Preliminaries -- 4 Notations and Definitions -- 5 Our Proposed Schemes -- 5.1 Main Scheme -- 5.2 Dynamic Scheme -- 6 Security Analysis -- 7 Implementation and Evaluation -- 8 Conclusion -- A Definition of Locality-Sensitive Hashing -- B Simulation-Based Security Definition -- C Security Proofs -- D Comparison with Prior Work -- E Bandwidth Consumption Switch Appendix D with Appendix E -- References -- Privacy-Preserving Link Prediction in Decentralized Online Social Networks.
1 Introduction -- 2 Related Work -- 3 System Model and Privacy Goals -- 3.1 Network Abstraction -- 3.2 Training Goal -- 3.3 Prediction Goal -- 4 Methodology -- 4.1 ADMM -- 4.2 Two-Tier Training -- 4.3 Complexity Analysis -- 4.4 Protecting Prior Knowledge -- 5 Experimentation and Evaluation -- 5.1 Wikipedia RfA Dataset -- 5.2 Experimental Setup -- 5.3 Evaluation Metrics -- 5.4 Results -- 6 Conclusion -- A Appendix: Link Reconstruction Attack -- A.1 Experimental Setup -- A.2 Results -- References -- Privacy-Preserving Observation in Public Spaces -- 1 Introduction -- 2 Related Work -- 2.1 Privacy-Preserving Billing -- 2.2 Threat Model -- 3 Collusion Attack -- 3.1 Model -- 3.2 Collusion Strategy -- 3.3 Analysis -- 4 Privacy-Preserving Spot Checking -- 4.1 Setup and Registration -- 4.2 Security Properties -- 4.3 Protocol -- 4.4 Optimization -- 4.5 Efficiency Analysis -- 4.6 Rate Limiting -- 4.7 Disposal -- 5 Example Application -- 6 Conclusions -- A Privacy vs. Penalty Analysis -- A.1 Variables -- A.2 Analysis -- References -- Privacy-Preserving Context-Aware Recommender Systems: Analysis and New Solutions -- 1 Introduction -- 1.1 State-of-the-Art -- 1.2 Our Contribution -- 1.3 Organization -- 2 Analysis of JPH Protocols -- 2.1 Preliminary of JPH Protocols -- 2.2 JPH Online Protocol -- 2.3 JPH Offline Protocol -- 3 New Formulation of Recommender System -- 3.1 Computing Predicted Ratings -- 3.2 Threat Model -- 4 New Privacy-Preserving Recommender Protocols -- 4.1 Recommendation Protocol for Single Prediction -- 4.2 Recommendation Protocol for Top-N Items -- 5 Evaluating the Proposed Protocols -- 6 Conclusion -- References -- Cloud Security -- Rich Queries on Encrypted Data: Beyond Exact Matches -- 1 Introduction -- 2 Preliminaries -- 3 Range Queries -- 4 Substring Queries -- 4.1 Basic SSE Substring Search -- 4.2 Wildcards and Phrase Queries. 4.3 Substring Protocol Extensions -- 5 Security Analysis -- A Implementation and Performance -- References -- Extended Proxy-Assisted Approach: Achieving Revocable Fine-Grained Encryption of Cloud Data -- 1 Introduction -- 2 Related Work -- 3 Proposed Revocable Cloud Data Encryption Model -- 3.1 System Overview -- 3.2 Notations -- 3.3 Extended Proxy-Assisted User Revocation Approach -- 3.4 Formulation of Revocable Cloud Data Encryption -- 4 Our Construction -- 4.1 Construction Details -- 4.2 Functional Analysis -- Features -- 4.3 Security Analysis -- 5 Implementation of Our Construction -- 5.1 Proof-of-Concept -- 5.2 Performance Results -- 6 Conclusion -- References -- Batch Verifiable Computation of Polynomials on Outsourced Data -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Overview of the Constructions -- 1.3 Related Work -- 1.4 Organization -- 2 Preliminaries -- 2.1 Batch Verifiable Computation on Outsourced Data -- 2.2 A Lemma -- 3 Constructions -- 3.1 The First Construction -- 3.2 The Second Construction -- 4 Analysis -- 5 Concluding Remarks -- A Proof of Lemma 1 -- References -- CloudBI: Practical Privacy-Preserving Outsourcing of Biometric Identification in the Cloud -- 1 Introduction -- 2 Problem Formulation: Outsourcing Computation of Biometric Identification -- 2.1 System Model and Assumptions -- 2.2 Threat Model -- 3 Privacy-Preserving Biometric Identification: An Examination of the State-of-the-Art -- 3.1 The Biometric Identification Scheme of Huang et al. -- 3.2 The Biometric Identification Scheme of Yuan et al. -- 4 Our Construction: The New and Improved Solutions -- 4.1 CloudBI-I: The Basic Scheme -- 4.2 CloudBI-II: The Enhanced Scheme -- 5 Implementation and Evaluation -- 5.1 Complexity Analysis -- 5.2 Experimental Evaluation -- 6 Concluding Remarks -- A Attack on Yuan et al. by Eliminating Randomness. B Attack on Yuan et al. by Exploiting Euclidian Distance Results -- References -- Protocols and Attribute-based Encryption -- Typing and Compositionality for Security Protocols: A Generalization to the Geometric Fragment -- 1 Introduction -- 2 Messages, Formats and the Intruder Model -- 2.1 Messages -- 2.2 Formats -- 2.3 Intruder Knowledge and Deduction Rules -- 3 Protocol Semantics -- 3.1 Symbolic Constraints -- 3.2 Operational Strands -- 3.3 Goal Predicates in the Geometric Fragment -- 4 Constraint Solving -- 4.1 From Geometric Fragment to Symbolic Constraints -- 4.2 Constraint Reduction -- 5 Typed Model -- 5.1 Message Patterns -- 6 Parallel Composition -- 7 Tool Support -- 8 Conclusions and Related Work -- A Appendix: Proofs of the Technical Results -- References -- Checking Trace Equivalence: How to Get Rid of Nonces? -- 1 Introduction -- 2 Model for Security Protocols -- 2.1 Term Algebra -- 2.2 Process Algebra -- 2.3 Semantics -- 2.4 Trace Equivalence -- 3 Main Contribution: Getting Rid of Nonces -- 3.1 Our Hypotheses -- 3.2 Our Transformation -- 3.3 Main Result -- 3.4 Sketch of Proof -- 4 Scope of Our Result -- 4.1 Simple Processes -- 4.2 Adequate Theories -- 5 Application of Our Result -- 5.1 Is Our Abstraction Precise Enough? -- 5.2 Proof Technique -- 6 Conclusion -- A Appendix -- References -- Attribute Based Broadcast Encryption with Short Ciphertext and Decryption Key -- 1 Introduction -- 2 Preliminaries -- 2.1 Bilinear Map on Prime Order Groups -- 2.2 The Viète's formulas -- 2.3 Access Structure -- 2.4 KP-ABBE Definition -- 2.5 CP-ABBE Definition -- 3 KP-ABBE Scheme -- 4 CP-ABBE Scheme -- 5 Security Analysis -- 6 Conclusion -- References -- Accountable Authority Ciphertext-Policy Attribute-Based Encryption with White-Box Traceability and Public Auditing in the Cloud -- 1 Introduction -- 1.1 Our Contribution -- 1.2 Our Technique. 1.3 Related Work -- 1.4 Organization -- 2 Background -- 2.1 Notation -- 2.2 Access Policy -- 2.3 Linear Secret-Sharing Schemes -- 2.4 Composite Order Bilinear Groups -- 2.5 Complexity Assumptions -- 2.6 Zero-Knowledge Proof of Knowledge of Discrete Log -- 3 Accountable Authority CP-ABE with White-Box Traceability and Public Auditing -- 3.1 Definition -- 3.2 Security -- 4 Our System -- 4.1 Construction -- 4.2 IND-CPA Security -- 4.3 DishonestAuthority Security -- 4.4 DishonestUser Security -- 4.5 Key Sanity Check Proof -- 5 Conclusion and Future Work -- A Proof of Lemma 2 -- B Proof of Theorem 2 -- C Proof Sketch of Theorem 3 -- D Proof of Theorem 4 -- References -- Code Analysis and Side-Channels -- DexHunter: Toward Extracting Hidden Code from Packed Android Applications -- 1 Introduction -- 2 Analysis of Packing Services -- 2.1 Common Techniques Used by Packing Services -- 2.2 Packers Under Investigation -- 3 DexHunter: Goal and Basic Idea -- 3.1 Basic Idea -- 3.2 ART -- 3.3 DVM -- 4 DexHunter: Design and Implementation -- 4.1 Architecture -- 4.2 Locating and Dumping Dex Files -- 4.3 Proactive Class Loading and Initialization -- 4.4 Identifying Packers -- 4.5 Extracting the Values of location_ and fileName -- 5 Evaluation -- 5.1 Overhead Introduced by Packers -- 5.2 DexHunter's Effectiveness -- 5.3 DexHunter's Efficiency -- 6 Discussion -- 7 Related Work -- 8 Conclusion -- References -- Identifying Arbitrary Memory Access Vulnerabilities in Privilege-Separated Software -- 1 Introduction -- 2 Problem Overview -- 2.1 Motivating Example -- 2.2 Problem Definition -- 2.3 Memory Access Patterns to Detect DUIs -- 3 Design -- 3.1 Overview -- 3.2 Suspicious Instruction Shortlisting -- 3.3 Dereference Behavior Analysis -- 4 Implementation -- 4.1 Taint Propagation -- 4.2 Access Formula Generation -- 5 Evaluation -- 5.1 Efficacy -- 5.2 Performance. 5.3 Security Implications. |
| Record Nr. | UNISA-996466470703316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computer Security -- ESORICS 2015 [[electronic resource] ] : 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part I / / edited by Günther Pernul, Peter Y A Ryan, Edgar Weippl
| Computer Security -- ESORICS 2015 [[electronic resource] ] : 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part I / / edited by Günther Pernul, Peter Y A Ryan, Edgar Weippl |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XVIII, 543 p. 114 illus. in color.) |
| Disciplina | 005.8 |
| Collana | Security and Cryptology |
| Soggetto topico |
Computer security
Data encryption (Computer science) Management information systems Computer science Algorithms Computers and civilization Systems and Data Security Cryptology Management of Computing and Information Systems Algorithm Analysis and Problem Complexity Computers and Society |
| ISBN | 3-319-24174-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Foreword -- Organization -- Contents - Part I -- Contents - Part II -- Networks and Web Security -- Towards Security of Internet Naming Infrastructure -- 1 Introduction -- 2 Related Work -- 2.1 Understanding the DNS Infrastructure -- 2.2 Misconfigured Networks -- 2.3 DNS Security -- 3 Studying DNS Name Servers -- 3.1 Recursive Authoritative Name Servers -- 3.2 Why Use Server-Side Caches? -- 3.3 Who Operates and Uses RANS? -- 3.4 Methodology for Detecting RANSes -- 4 Evaluating (in)Security of RANSes -- 4.1 Services Coresidence -- 4.2 Source Port Randomisation -- 4.3 DNSSEC -- 4.4 Implications of Vulnerable RANSes -- 5 Conclusions -- A Overview: DNS and DNSSEC -- References -- Waiting for CSP -- Securing Legacy Web Applications with JSAgents -- 1 Introduction -- 2 Related Work -- 3 JSAgents Architecture -- 3.1 Building Blocks -- 3.2 JSAgents Core Library -- 3.3 JSAgents Modules -- 3.4 JSAgents Policy Files -- 4 Security Evaluation -- 5 Performance Evaluation -- 6 Future Work -- A Comparable Approaches -- A.1 From XSS Filters to CSP 1.0 -- A.2 Content Security Policy -- References -- Analyzing the BrowserID SSO System with Primary Identity Providers Using an Expressive Model of the Web -- 1 Introduction -- 2 The Web Model -- 2.1 Communication Model -- 2.2 Web System -- 2.3 Web Browsers -- 3 General Security Properties -- 4 The BrowserID System -- 4.1 Overview -- 4.2 Implementation Details -- 5 Analysis of BrowserID: Authentication Properties -- 5.1 Modeling of BrowserID with Primary IdPs -- 5.2 Authentication Properties of the BrowserID System -- 5.3 Identity Injection Attack on BrowserID with Primary IdPs -- 5.4 Security of the Fixed System -- 6 Privacy of BrowserID -- 6.1 Privacy Attacks on BrowserID -- 6.2 Fixing the Privacy of BrowserID -- 7 Related Work -- 8 Conclusion -- A Browser Model -- A.1 Browser State: Zp and sp0.
A.2 Web Browser Relation Rp -- B Additional Privacy Attack Variants -- References -- System Security -- A Practical Approach for Adaptive Data Structure Layout Randomization -- 1 Introduction -- 2 Overview -- 2.1 Threat Model -- 2.2 System Overview -- 3 Design and Implementation of SALADS -- 3.1 Extraction Component -- 3.2 Randomization Component -- 3.3 De-randomization Component -- 3.4 Other Practical Issues -- 4 Evaluation -- 4.1 Effectiveness of DSSR Application Programs -- 4.2 Effectiveness of DSSR Kernel and DSSR Hypervisor -- 4.3 Performance Overhead -- 4.4 Memory Overhead -- 5 Discussion -- 5.1 Analysis of Effectiveness -- 5.2 Limitations -- 6 Related Work -- 7 Conclusion -- A Details of Lmbench Results -- References -- Trustworthy Prevention of Code Injection in Linux on Embedded Devices -- 1 Introduction -- 2 Background -- 2.1 The Prosper Hypervisor -- 2.2 The Attack Model -- 2.3 Formal Model of the Hypervisor -- 3 Design -- 4 Formal Model of MProsper -- 5 Verification Strategy -- 6 Evaluation -- 7 Related Work -- 8 Concluding Remarks -- References -- Practical Memory Deduplication Attacks in Sandboxed Javascript -- 1 Introduction -- 2 Background -- 2.1 Shared Memory -- 2.2 Page-Deduplication Attacks -- 3 Description of Our Javascript-Based Attack -- 4 Practical Attacks and Evaluation -- 4.1 Cross-VM Attack on Private Clouds -- 4.2 Attack on Personal Computers and Smartphones -- 5 Countermeasures -- 6 Conclusion -- References -- Cryptography -- Computational Soundness for Interactive Primitives -- 1 Introduction -- 2 Related Work -- 3 Review of the CoSP Framework for Equivalence -- 4 Review of the UC Framework -- 5 Ideal Functionalities in the Symbolic Model -- 6 Ideal Functionalities in the Computational Model -- 7 Real Protocols in CoSP -- 8 Computational Soundness for Interactive Primitives -- 9 Case Study: Untraceable Payments. A Protocol Conditions -- References -- Verifiably Encrypted Signatures: Security Revisited and a New Construction -- 1 Introduction -- 1.1 Our Contribution -- 1.2 Related Work -- 1.3 Outline -- 2 Preliminaries -- 2.1 Digital Signatures -- 2.2 Structure-Preserving Signatures on Equivalence Classes -- 2.3 Verifiably Encrypted Signatures -- 3 The Importance of Resolution Independence -- 3.1 Counterexample -- 3.2 Filling the Gap -- 4 Verifiably Encrypted Signatures from SPS-EQ-R -- 5 Public-Key Encryption from SPS-EQ-R -- 6 Conclusion -- References -- A Omitted Proofs -- Interleaving Cryptanalytic Time-Memory Trade-Offs on Non-uniform Distributions -- 1 Introduction -- 2 Cryptanalytic Time-Memory Trade-Offs -- 2.1 Hellman Scheme -- 2.2 Oechslin Scheme -- 2.3 Related Works -- 3 Interleaving -- 3.1 Description -- 3.2 Analysis -- 4 Order of Visit -- 4.1 Discussion -- 4.2 Analysis -- 5 Input Set Partition and Memory Allocation -- 5.1 Input Set Partition -- 5.2 Memory Allocation -- 6 Results -- 6.1 Statistics -- 6.2 RockYou -- 6.3 10 Million Combos -- 6.4 Discussion -- 7 Conclusion -- A Proof of Theorem -- B Subsets of 10 Million Combos -- References -- Efficient Message Authentication Codes with Combinatorial Group Testing -- 1 Introduction -- 2 Preliminaries -- 3 MAC for Corruption Identification -- 3.1 Combinatorial Group Testing -- 3.2 MAC for Extended Vector Space -- 3.3 Efficient Group Testing MAC -- 3.4 Security Notions -- 3.5 Remarks -- 3.6 Provable Security of GTM -- 4 Experimental Implementation -- 5 Concluding Remarks -- References -- Symmetric-Key Based Proofs of Retrievability Supporting Public Verification -- 1 Introduction -- 1.1 Related Work -- 2 Preliminaries -- 2.1 Proofs of Retrievability -- 2.2 Obfuscation Preliminaries -- 2.3 Puncturable PRFs -- 3 Security Definitions -- 3.1 Security Definitions on Static PoR. 3.2 Security Definitions on Dynamic PoR -- 4 Constructions -- 4.1 Static Publicly Verifiable PoR Scheme -- 4.2 PoR Scheme Supporting Efficient Dynamic Updates -- 4.3 Security Proofs -- 5 Analysis and Comparisons -- 6 Conclusions -- A Discussions and Future Directions Towards i O -- A.1 Outsourced and Joint Generation of Indistinguishability Obfuscation -- A.2 Reusability and Universality of Indistinguishability Obfuscation -- A.3 Obfuscation for Specific Functions -- References -- DTLS-HIMMO: Achieving DTLS Certificate Security with Symmetric Key Overhead -- 1 Introduction -- 2 Preliminaries -- 2.1 Security Standards in the Internet (of Things) -- 2.2 DTLS-PSK -- 2.3 Attack Model and Security Goals -- 3 HIMMO and HIMMO Extensions -- 3.1 HIMMO Operation -- 3.2 Implicit Certification and Verification of Credentials -- 3.3 Enhancing Privacy by Using Multiple TTPs -- 4 Implementation and Performance -- 5 (D)TLS-HIMMO -- 5.1 DTLS-HIMMO Configurations -- 5.2 (D)TLS-HIMMO Handshake -- 5.3 Privacy Protection -- 5.4 TTP Infrastructure -- 5.5 Security Considerations of (D)TLS-HIMMO -- 6 Performance of DTLS-HIMMO and Comparison with Existing (D)TLS Alternatives -- 7 Conclusions -- References -- Short Accountable Ring Signatures Based on DDH -- 1 Introduction -- 2 Defining Accountable Ring Signatures -- 2.1 Ring and Group Signatures from Accountable Ring Signatures -- 3 Preliminaries -- 4 Constructing Accountable Ring Signatures -- 5 Efficient Instantiation -- A Proof of Theorem 1 -- B Security Proofs of Our -Protocols -- B.1 Proof of Lemma 1 -- B.2 Proof of Lemma 2 -- B.3 Proof of Lemma 3 -- B.4 Proof of Lemma 5 -- References -- Updatable Hash Proof System and Its Applications -- 1 Introduction -- 1.1 Our Results -- 1.2 Related Work -- 2 Preliminaries -- 3 Updatable Hash Proof System -- 4 Building CML-PKE from UHPS -- 4.1 A CPA-Secure Scheme. 4.2 CCA-Secure Schemes -- 4.3 PKE Schemes with Leakage During Key Update -- 5 Instantiations of Updatable Hash Proof System -- 5.1 Instantiation from the SXDH Assumption -- 5.2 Parameters -- A Omitted Constructions in Sect.4.2 -- References -- Server-Aided Revocable Identity-Based Encryption -- 1 Introduction -- 2 Preliminaries -- 3 Definition and Security of SR-IBE -- 4 Construction of SR-IBE Scheme -- 4.1 The Node Selection Algorithm: KUNodes -- 4.2 The Construction -- 5 Security Proof -- 6 Conclusion -- A Proof of Theorem 2 -- References -- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Related Work -- 1.3 Roadmap -- 2 Preliminaries -- 2.1 Commitment Schemes -- 2.2 Zero-Knowledge Proofs and -Protocols -- 2.3 Learning with Errors -- 2.4 Rejection Sampling -- 3 Commitments from Ring-LWE -- 4 Zero-Knowledge of Proofs of Knowledge -- 4.1 Preimage Proofs -- 4.2 Proving Linear Relations -- 4.3 Proving Multiplicative Relations -- 5 Conclusion -- A Proofs -- A.1 Proofs of Theorem 4.5 -- A.2 Proofs of Theorem 4.6 -- References -- Making Any Identity-Based Encryption Accountable, Efficiently -- 1 Introduction -- 2 Generic Construction of A-IBE with Constant Size Ciphertext -- 2.1 Detailed Construction -- 2.2 Security Analysis -- 3 Generic Construction of A-IBE Allowing Public Traceability and Identity Reuse -- 3.1 A General Framework Allowing Identity Re-use -- 3.2 Building Blocks for Public Traceability -- 3.3 Concrete Construction and Security Analysis -- 4 Conclusions and Open Problems -- A Preliminaries -- References -- Practical Threshold Password-Authenticated Secret Sharing Protocol -- 1 Introduction -- 2 Definition of Security -- 3 Our TPASS Protocol -- 3.1 Description of Our Protocol -- 3.2 Correctness and Efficiency -- 4 Security Analysis -- 5 Conclusion. References. |
| Record Nr. | UNISA-996466469903316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computer Security -- ESORICS 2015 : 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part II / / edited by Günther Pernul, Peter Y A Ryan, Edgar Weippl
| Computer Security -- ESORICS 2015 : 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part II / / edited by Günther Pernul, Peter Y A Ryan, Edgar Weippl |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XVII, 665 p. 124 illus.) |
| Disciplina | 005.8 |
| Collana | Security and Cryptology |
| Soggetto topico |
Computer security
Data encryption (Computer science) Management information systems Computer science Algorithms Computers and civilization Systems and Data Security Cryptology Management of Computing and Information Systems Algorithm Analysis and Problem Complexity Computers and Society |
| ISBN | 3-319-24177-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Foreword -- Organization -- Contents - Part II -- Contents - Part I -- Privacy -- FP-Block: Usable Web Privacy by Controlling Browser Fingerprinting -- 1 Introduction -- 2 Related Work -- 2.1 Fingerprinting -- 2.2 Countermeasures -- 3 Determining the Fingerprint Surface -- 3.1 Limitations of Preventing Fingerprint Tracking -- 3.2 Fingerprint Vectors -- 3.3 Fingerprint Surface -- 4 Design -- 4.1 Balancing Usability vs. Privacy -- 4.2 Generating Web Identities -- 5 Development and Implementation -- 5.1 Development -- 5.2 Implementation -- 6 Experiments and Validation -- 7 Conclusions -- References -- Mind-Reading: Privacy Attacks Exploiting Cross-App KeyEvent Injections -- 1 Introduction -- 2 Background and Adversary Model -- 2.1 IME and Personalized User Dictionary -- 2.2 Adversary Model -- 3 Vulnerability Analysis -- 3.1 Android KeyEvent Processing Flow -- 3.2 Cross-App KeyEvent Injection Vulnerability -- 4 Attack -- 4.1 Enumerating Entries from Dictionary -- 4.2 Attack in Stealthy Mode -- 4.3 Case Study of IMEs for Non-Latin Languages -- 5 Evaluation -- 5.1 Scope of Attack -- 5.2 Experiment on Word Completion Attack Mode -- 5.3 Experiment on Next-Word Prediction Attack Mode -- 6 Defense -- 7 Related Works -- 8 Conclusion -- References -- Enabling Privacy-Assured Similarity Retrieval over Millions of Encrypted Records -- 1 Introduction -- 2 Related Works -- 3 Preliminaries -- 4 Notations and Definitions -- 5 Our Proposed Schemes -- 5.1 Main Scheme -- 5.2 Dynamic Scheme -- 6 Security Analysis -- 7 Implementation and Evaluation -- 8 Conclusion -- A Definition of Locality-Sensitive Hashing -- B Simulation-Based Security Definition -- C Security Proofs -- D Comparison with Prior Work -- E Bandwidth Consumption Switch Appendix D with Appendix E -- References -- Privacy-Preserving Link Prediction in Decentralized Online Social Networks.
1 Introduction -- 2 Related Work -- 3 System Model and Privacy Goals -- 3.1 Network Abstraction -- 3.2 Training Goal -- 3.3 Prediction Goal -- 4 Methodology -- 4.1 ADMM -- 4.2 Two-Tier Training -- 4.3 Complexity Analysis -- 4.4 Protecting Prior Knowledge -- 5 Experimentation and Evaluation -- 5.1 Wikipedia RfA Dataset -- 5.2 Experimental Setup -- 5.3 Evaluation Metrics -- 5.4 Results -- 6 Conclusion -- A Appendix: Link Reconstruction Attack -- A.1 Experimental Setup -- A.2 Results -- References -- Privacy-Preserving Observation in Public Spaces -- 1 Introduction -- 2 Related Work -- 2.1 Privacy-Preserving Billing -- 2.2 Threat Model -- 3 Collusion Attack -- 3.1 Model -- 3.2 Collusion Strategy -- 3.3 Analysis -- 4 Privacy-Preserving Spot Checking -- 4.1 Setup and Registration -- 4.2 Security Properties -- 4.3 Protocol -- 4.4 Optimization -- 4.5 Efficiency Analysis -- 4.6 Rate Limiting -- 4.7 Disposal -- 5 Example Application -- 6 Conclusions -- A Privacy vs. Penalty Analysis -- A.1 Variables -- A.2 Analysis -- References -- Privacy-Preserving Context-Aware Recommender Systems: Analysis and New Solutions -- 1 Introduction -- 1.1 State-of-the-Art -- 1.2 Our Contribution -- 1.3 Organization -- 2 Analysis of JPH Protocols -- 2.1 Preliminary of JPH Protocols -- 2.2 JPH Online Protocol -- 2.3 JPH Offline Protocol -- 3 New Formulation of Recommender System -- 3.1 Computing Predicted Ratings -- 3.2 Threat Model -- 4 New Privacy-Preserving Recommender Protocols -- 4.1 Recommendation Protocol for Single Prediction -- 4.2 Recommendation Protocol for Top-N Items -- 5 Evaluating the Proposed Protocols -- 6 Conclusion -- References -- Cloud Security -- Rich Queries on Encrypted Data: Beyond Exact Matches -- 1 Introduction -- 2 Preliminaries -- 3 Range Queries -- 4 Substring Queries -- 4.1 Basic SSE Substring Search -- 4.2 Wildcards and Phrase Queries. 4.3 Substring Protocol Extensions -- 5 Security Analysis -- A Implementation and Performance -- References -- Extended Proxy-Assisted Approach: Achieving Revocable Fine-Grained Encryption of Cloud Data -- 1 Introduction -- 2 Related Work -- 3 Proposed Revocable Cloud Data Encryption Model -- 3.1 System Overview -- 3.2 Notations -- 3.3 Extended Proxy-Assisted User Revocation Approach -- 3.4 Formulation of Revocable Cloud Data Encryption -- 4 Our Construction -- 4.1 Construction Details -- 4.2 Functional Analysis -- Features -- 4.3 Security Analysis -- 5 Implementation of Our Construction -- 5.1 Proof-of-Concept -- 5.2 Performance Results -- 6 Conclusion -- References -- Batch Verifiable Computation of Polynomials on Outsourced Data -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Overview of the Constructions -- 1.3 Related Work -- 1.4 Organization -- 2 Preliminaries -- 2.1 Batch Verifiable Computation on Outsourced Data -- 2.2 A Lemma -- 3 Constructions -- 3.1 The First Construction -- 3.2 The Second Construction -- 4 Analysis -- 5 Concluding Remarks -- A Proof of Lemma 1 -- References -- CloudBI: Practical Privacy-Preserving Outsourcing of Biometric Identification in the Cloud -- 1 Introduction -- 2 Problem Formulation: Outsourcing Computation of Biometric Identification -- 2.1 System Model and Assumptions -- 2.2 Threat Model -- 3 Privacy-Preserving Biometric Identification: An Examination of the State-of-the-Art -- 3.1 The Biometric Identification Scheme of Huang et al. -- 3.2 The Biometric Identification Scheme of Yuan et al. -- 4 Our Construction: The New and Improved Solutions -- 4.1 CloudBI-I: The Basic Scheme -- 4.2 CloudBI-II: The Enhanced Scheme -- 5 Implementation and Evaluation -- 5.1 Complexity Analysis -- 5.2 Experimental Evaluation -- 6 Concluding Remarks -- A Attack on Yuan et al. by Eliminating Randomness. B Attack on Yuan et al. by Exploiting Euclidian Distance Results -- References -- Protocols and Attribute-based Encryption -- Typing and Compositionality for Security Protocols: A Generalization to the Geometric Fragment -- 1 Introduction -- 2 Messages, Formats and the Intruder Model -- 2.1 Messages -- 2.2 Formats -- 2.3 Intruder Knowledge and Deduction Rules -- 3 Protocol Semantics -- 3.1 Symbolic Constraints -- 3.2 Operational Strands -- 3.3 Goal Predicates in the Geometric Fragment -- 4 Constraint Solving -- 4.1 From Geometric Fragment to Symbolic Constraints -- 4.2 Constraint Reduction -- 5 Typed Model -- 5.1 Message Patterns -- 6 Parallel Composition -- 7 Tool Support -- 8 Conclusions and Related Work -- A Appendix: Proofs of the Technical Results -- References -- Checking Trace Equivalence: How to Get Rid of Nonces? -- 1 Introduction -- 2 Model for Security Protocols -- 2.1 Term Algebra -- 2.2 Process Algebra -- 2.3 Semantics -- 2.4 Trace Equivalence -- 3 Main Contribution: Getting Rid of Nonces -- 3.1 Our Hypotheses -- 3.2 Our Transformation -- 3.3 Main Result -- 3.4 Sketch of Proof -- 4 Scope of Our Result -- 4.1 Simple Processes -- 4.2 Adequate Theories -- 5 Application of Our Result -- 5.1 Is Our Abstraction Precise Enough? -- 5.2 Proof Technique -- 6 Conclusion -- A Appendix -- References -- Attribute Based Broadcast Encryption with Short Ciphertext and Decryption Key -- 1 Introduction -- 2 Preliminaries -- 2.1 Bilinear Map on Prime Order Groups -- 2.2 The Viète's formulas -- 2.3 Access Structure -- 2.4 KP-ABBE Definition -- 2.5 CP-ABBE Definition -- 3 KP-ABBE Scheme -- 4 CP-ABBE Scheme -- 5 Security Analysis -- 6 Conclusion -- References -- Accountable Authority Ciphertext-Policy Attribute-Based Encryption with White-Box Traceability and Public Auditing in the Cloud -- 1 Introduction -- 1.1 Our Contribution -- 1.2 Our Technique. 1.3 Related Work -- 1.4 Organization -- 2 Background -- 2.1 Notation -- 2.2 Access Policy -- 2.3 Linear Secret-Sharing Schemes -- 2.4 Composite Order Bilinear Groups -- 2.5 Complexity Assumptions -- 2.6 Zero-Knowledge Proof of Knowledge of Discrete Log -- 3 Accountable Authority CP-ABE with White-Box Traceability and Public Auditing -- 3.1 Definition -- 3.2 Security -- 4 Our System -- 4.1 Construction -- 4.2 IND-CPA Security -- 4.3 DishonestAuthority Security -- 4.4 DishonestUser Security -- 4.5 Key Sanity Check Proof -- 5 Conclusion and Future Work -- A Proof of Lemma 2 -- B Proof of Theorem 2 -- C Proof Sketch of Theorem 3 -- D Proof of Theorem 4 -- References -- Code Analysis and Side-Channels -- DexHunter: Toward Extracting Hidden Code from Packed Android Applications -- 1 Introduction -- 2 Analysis of Packing Services -- 2.1 Common Techniques Used by Packing Services -- 2.2 Packers Under Investigation -- 3 DexHunter: Goal and Basic Idea -- 3.1 Basic Idea -- 3.2 ART -- 3.3 DVM -- 4 DexHunter: Design and Implementation -- 4.1 Architecture -- 4.2 Locating and Dumping Dex Files -- 4.3 Proactive Class Loading and Initialization -- 4.4 Identifying Packers -- 4.5 Extracting the Values of location_ and fileName -- 5 Evaluation -- 5.1 Overhead Introduced by Packers -- 5.2 DexHunter's Effectiveness -- 5.3 DexHunter's Efficiency -- 6 Discussion -- 7 Related Work -- 8 Conclusion -- References -- Identifying Arbitrary Memory Access Vulnerabilities in Privilege-Separated Software -- 1 Introduction -- 2 Problem Overview -- 2.1 Motivating Example -- 2.2 Problem Definition -- 2.3 Memory Access Patterns to Detect DUIs -- 3 Design -- 3.1 Overview -- 3.2 Suspicious Instruction Shortlisting -- 3.3 Dereference Behavior Analysis -- 4 Implementation -- 4.1 Taint Propagation -- 4.2 Access Formula Generation -- 5 Evaluation -- 5.1 Efficacy -- 5.2 Performance. 5.3 Security Implications. |
| Record Nr. | UNINA-9910484546603321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computer Security -- ESORICS 2015 : 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part I / / edited by Günther Pernul, Peter Y A Ryan, Edgar Weippl
| Computer Security -- ESORICS 2015 : 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part I / / edited by Günther Pernul, Peter Y A Ryan, Edgar Weippl |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XVIII, 543 p. 114 illus. in color.) |
| Disciplina | 005.8 |
| Collana | Security and Cryptology |
| Soggetto topico |
Computer security
Data encryption (Computer science) Management information systems Computer science Algorithms Computers and civilization Systems and Data Security Cryptology Management of Computing and Information Systems Algorithm Analysis and Problem Complexity Computers and Society |
| ISBN | 3-319-24174-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Foreword -- Organization -- Contents - Part I -- Contents - Part II -- Networks and Web Security -- Towards Security of Internet Naming Infrastructure -- 1 Introduction -- 2 Related Work -- 2.1 Understanding the DNS Infrastructure -- 2.2 Misconfigured Networks -- 2.3 DNS Security -- 3 Studying DNS Name Servers -- 3.1 Recursive Authoritative Name Servers -- 3.2 Why Use Server-Side Caches? -- 3.3 Who Operates and Uses RANS? -- 3.4 Methodology for Detecting RANSes -- 4 Evaluating (in)Security of RANSes -- 4.1 Services Coresidence -- 4.2 Source Port Randomisation -- 4.3 DNSSEC -- 4.4 Implications of Vulnerable RANSes -- 5 Conclusions -- A Overview: DNS and DNSSEC -- References -- Waiting for CSP -- Securing Legacy Web Applications with JSAgents -- 1 Introduction -- 2 Related Work -- 3 JSAgents Architecture -- 3.1 Building Blocks -- 3.2 JSAgents Core Library -- 3.3 JSAgents Modules -- 3.4 JSAgents Policy Files -- 4 Security Evaluation -- 5 Performance Evaluation -- 6 Future Work -- A Comparable Approaches -- A.1 From XSS Filters to CSP 1.0 -- A.2 Content Security Policy -- References -- Analyzing the BrowserID SSO System with Primary Identity Providers Using an Expressive Model of the Web -- 1 Introduction -- 2 The Web Model -- 2.1 Communication Model -- 2.2 Web System -- 2.3 Web Browsers -- 3 General Security Properties -- 4 The BrowserID System -- 4.1 Overview -- 4.2 Implementation Details -- 5 Analysis of BrowserID: Authentication Properties -- 5.1 Modeling of BrowserID with Primary IdPs -- 5.2 Authentication Properties of the BrowserID System -- 5.3 Identity Injection Attack on BrowserID with Primary IdPs -- 5.4 Security of the Fixed System -- 6 Privacy of BrowserID -- 6.1 Privacy Attacks on BrowserID -- 6.2 Fixing the Privacy of BrowserID -- 7 Related Work -- 8 Conclusion -- A Browser Model -- A.1 Browser State: Zp and sp0.
A.2 Web Browser Relation Rp -- B Additional Privacy Attack Variants -- References -- System Security -- A Practical Approach for Adaptive Data Structure Layout Randomization -- 1 Introduction -- 2 Overview -- 2.1 Threat Model -- 2.2 System Overview -- 3 Design and Implementation of SALADS -- 3.1 Extraction Component -- 3.2 Randomization Component -- 3.3 De-randomization Component -- 3.4 Other Practical Issues -- 4 Evaluation -- 4.1 Effectiveness of DSSR Application Programs -- 4.2 Effectiveness of DSSR Kernel and DSSR Hypervisor -- 4.3 Performance Overhead -- 4.4 Memory Overhead -- 5 Discussion -- 5.1 Analysis of Effectiveness -- 5.2 Limitations -- 6 Related Work -- 7 Conclusion -- A Details of Lmbench Results -- References -- Trustworthy Prevention of Code Injection in Linux on Embedded Devices -- 1 Introduction -- 2 Background -- 2.1 The Prosper Hypervisor -- 2.2 The Attack Model -- 2.3 Formal Model of the Hypervisor -- 3 Design -- 4 Formal Model of MProsper -- 5 Verification Strategy -- 6 Evaluation -- 7 Related Work -- 8 Concluding Remarks -- References -- Practical Memory Deduplication Attacks in Sandboxed Javascript -- 1 Introduction -- 2 Background -- 2.1 Shared Memory -- 2.2 Page-Deduplication Attacks -- 3 Description of Our Javascript-Based Attack -- 4 Practical Attacks and Evaluation -- 4.1 Cross-VM Attack on Private Clouds -- 4.2 Attack on Personal Computers and Smartphones -- 5 Countermeasures -- 6 Conclusion -- References -- Cryptography -- Computational Soundness for Interactive Primitives -- 1 Introduction -- 2 Related Work -- 3 Review of the CoSP Framework for Equivalence -- 4 Review of the UC Framework -- 5 Ideal Functionalities in the Symbolic Model -- 6 Ideal Functionalities in the Computational Model -- 7 Real Protocols in CoSP -- 8 Computational Soundness for Interactive Primitives -- 9 Case Study: Untraceable Payments. A Protocol Conditions -- References -- Verifiably Encrypted Signatures: Security Revisited and a New Construction -- 1 Introduction -- 1.1 Our Contribution -- 1.2 Related Work -- 1.3 Outline -- 2 Preliminaries -- 2.1 Digital Signatures -- 2.2 Structure-Preserving Signatures on Equivalence Classes -- 2.3 Verifiably Encrypted Signatures -- 3 The Importance of Resolution Independence -- 3.1 Counterexample -- 3.2 Filling the Gap -- 4 Verifiably Encrypted Signatures from SPS-EQ-R -- 5 Public-Key Encryption from SPS-EQ-R -- 6 Conclusion -- References -- A Omitted Proofs -- Interleaving Cryptanalytic Time-Memory Trade-Offs on Non-uniform Distributions -- 1 Introduction -- 2 Cryptanalytic Time-Memory Trade-Offs -- 2.1 Hellman Scheme -- 2.2 Oechslin Scheme -- 2.3 Related Works -- 3 Interleaving -- 3.1 Description -- 3.2 Analysis -- 4 Order of Visit -- 4.1 Discussion -- 4.2 Analysis -- 5 Input Set Partition and Memory Allocation -- 5.1 Input Set Partition -- 5.2 Memory Allocation -- 6 Results -- 6.1 Statistics -- 6.2 RockYou -- 6.3 10 Million Combos -- 6.4 Discussion -- 7 Conclusion -- A Proof of Theorem -- B Subsets of 10 Million Combos -- References -- Efficient Message Authentication Codes with Combinatorial Group Testing -- 1 Introduction -- 2 Preliminaries -- 3 MAC for Corruption Identification -- 3.1 Combinatorial Group Testing -- 3.2 MAC for Extended Vector Space -- 3.3 Efficient Group Testing MAC -- 3.4 Security Notions -- 3.5 Remarks -- 3.6 Provable Security of GTM -- 4 Experimental Implementation -- 5 Concluding Remarks -- References -- Symmetric-Key Based Proofs of Retrievability Supporting Public Verification -- 1 Introduction -- 1.1 Related Work -- 2 Preliminaries -- 2.1 Proofs of Retrievability -- 2.2 Obfuscation Preliminaries -- 2.3 Puncturable PRFs -- 3 Security Definitions -- 3.1 Security Definitions on Static PoR. 3.2 Security Definitions on Dynamic PoR -- 4 Constructions -- 4.1 Static Publicly Verifiable PoR Scheme -- 4.2 PoR Scheme Supporting Efficient Dynamic Updates -- 4.3 Security Proofs -- 5 Analysis and Comparisons -- 6 Conclusions -- A Discussions and Future Directions Towards i O -- A.1 Outsourced and Joint Generation of Indistinguishability Obfuscation -- A.2 Reusability and Universality of Indistinguishability Obfuscation -- A.3 Obfuscation for Specific Functions -- References -- DTLS-HIMMO: Achieving DTLS Certificate Security with Symmetric Key Overhead -- 1 Introduction -- 2 Preliminaries -- 2.1 Security Standards in the Internet (of Things) -- 2.2 DTLS-PSK -- 2.3 Attack Model and Security Goals -- 3 HIMMO and HIMMO Extensions -- 3.1 HIMMO Operation -- 3.2 Implicit Certification and Verification of Credentials -- 3.3 Enhancing Privacy by Using Multiple TTPs -- 4 Implementation and Performance -- 5 (D)TLS-HIMMO -- 5.1 DTLS-HIMMO Configurations -- 5.2 (D)TLS-HIMMO Handshake -- 5.3 Privacy Protection -- 5.4 TTP Infrastructure -- 5.5 Security Considerations of (D)TLS-HIMMO -- 6 Performance of DTLS-HIMMO and Comparison with Existing (D)TLS Alternatives -- 7 Conclusions -- References -- Short Accountable Ring Signatures Based on DDH -- 1 Introduction -- 2 Defining Accountable Ring Signatures -- 2.1 Ring and Group Signatures from Accountable Ring Signatures -- 3 Preliminaries -- 4 Constructing Accountable Ring Signatures -- 5 Efficient Instantiation -- A Proof of Theorem 1 -- B Security Proofs of Our -Protocols -- B.1 Proof of Lemma 1 -- B.2 Proof of Lemma 2 -- B.3 Proof of Lemma 3 -- B.4 Proof of Lemma 5 -- References -- Updatable Hash Proof System and Its Applications -- 1 Introduction -- 1.1 Our Results -- 1.2 Related Work -- 2 Preliminaries -- 3 Updatable Hash Proof System -- 4 Building CML-PKE from UHPS -- 4.1 A CPA-Secure Scheme. 4.2 CCA-Secure Schemes -- 4.3 PKE Schemes with Leakage During Key Update -- 5 Instantiations of Updatable Hash Proof System -- 5.1 Instantiation from the SXDH Assumption -- 5.2 Parameters -- A Omitted Constructions in Sect.4.2 -- References -- Server-Aided Revocable Identity-Based Encryption -- 1 Introduction -- 2 Preliminaries -- 3 Definition and Security of SR-IBE -- 4 Construction of SR-IBE Scheme -- 4.1 The Node Selection Algorithm: KUNodes -- 4.2 The Construction -- 5 Security Proof -- 6 Conclusion -- A Proof of Theorem 2 -- References -- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Related Work -- 1.3 Roadmap -- 2 Preliminaries -- 2.1 Commitment Schemes -- 2.2 Zero-Knowledge Proofs and -Protocols -- 2.3 Learning with Errors -- 2.4 Rejection Sampling -- 3 Commitments from Ring-LWE -- 4 Zero-Knowledge of Proofs of Knowledge -- 4.1 Preimage Proofs -- 4.2 Proving Linear Relations -- 4.3 Proving Multiplicative Relations -- 5 Conclusion -- A Proofs -- A.1 Proofs of Theorem 4.5 -- A.2 Proofs of Theorem 4.6 -- References -- Making Any Identity-Based Encryption Accountable, Efficiently -- 1 Introduction -- 2 Generic Construction of A-IBE with Constant Size Ciphertext -- 2.1 Detailed Construction -- 2.2 Security Analysis -- 3 Generic Construction of A-IBE Allowing Public Traceability and Identity Reuse -- 3.1 A General Framework Allowing Identity Re-use -- 3.2 Building Blocks for Public Traceability -- 3.3 Concrete Construction and Security Analysis -- 4 Conclusions and Open Problems -- A Preliminaries -- References -- Practical Threshold Password-Authenticated Secret Sharing Protocol -- 1 Introduction -- 2 Definition of Security -- 3 Our TPASS Protocol -- 3.1 Description of Our Protocol -- 3.2 Correctness and Efficiency -- 4 Security Analysis -- 5 Conclusion. References. |
| Record Nr. | UNINA-9910484546403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Data and Applications Security and Privacy XXVIII [[electronic resource] ] : 28th Annual IFIP WG 11.3 Working Conference, DBSec 2014, Vienna, Austria, July 14-16, 2014, Proceedings / / edited by Vijay Atluri, Günther Pernul
| Data and Applications Security and Privacy XXVIII [[electronic resource] ] : 28th Annual IFIP WG 11.3 Working Conference, DBSec 2014, Vienna, Austria, July 14-16, 2014, Proceedings / / edited by Vijay Atluri, Günther Pernul |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XVIII, 391 p. 97 illus.) |
| Disciplina | 005.8 |
| Collana | Information Systems and Applications, incl. Internet/Web, and HCI |
| Soggetto topico |
Computer security
Database management Management information systems Computer science Application software Computer communication systems Systems and Data Security Database Management Management of Computing and Information Systems Information Systems Applications (incl. Internet) Computer Communication Networks |
| ISBN | 3-662-43936-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Integrity Assurance for Outsourced Databases without DBMS Modification -- Specification and Deployment of Integrated Security Policies for Outsourced Data -- Optimizing Integrity Checks for Join Queries in the Cloud -- Privacy-Enhancing Proxy Signatures from Non-interactive Anonymous Credentials -- Privacy-Preserving Multiple Keyword Search on Outsourced Data in the Clouds -- Secure and Privacy-Preserving Querying of Personal Health Records in the Cloud -- Data Leakage Quantification -- Toward Software Diversity in Heterogeneous Networked Systems -- FSquaDRA: Fast Detection of Repackaged Applications -- ‘Who, When, and Where?’ Location Proof Assertion for Mobile Devices -- Design Patterns for Multiple Stakeholders in Social Computing -- Collaboratively Solving the Traveling Salesman Problem with Limited Disclosure -- ELITE: zEro Links Identity managemenT systEm -- Dynamic Workflow Adjustment with Security Constraints -- Consistent Query Plan Generation in Secure Cooperative Data Access -- Hunting the Unknown: White-Box Database Leakage Detection -- Incremental Analysis of Evolving Administrative Role Based Access Control Policies -- Mining Attribute-Based Access Control Policies from Logs -- Attribute-Aware Relationship-Based Access Control for Online Social Networks -- Randomly Partitioned Encryption for Cloud Databases -- Towards Secure Cloud Database with Fine-Grained Access Control -- Practical Private Information Retrieval from a Time-Varying, Multi-attribute, and Multiple-Occurrence Database -- LPM: Layered Policy Management for Software-Defined Networks -- On Minimizing the Size of Encrypted Databases -- Efficient and Enhanced Solutions for Content Sharing in DRM Systems -- A Scalable and Efficient Privacy Preserving Global Itemset Support Approximation Using Bloom Filters. |
| Record Nr. | UNISA-996200140303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Data and Applications Security and Privacy XXVIII : 28th Annual IFIP WG 11.3 Working Conference, DBSec 2014, Vienna, Austria, July 14-16, 2014, Proceedings / / edited by Vijay Atluri, Günther Pernul
| Data and Applications Security and Privacy XXVIII : 28th Annual IFIP WG 11.3 Working Conference, DBSec 2014, Vienna, Austria, July 14-16, 2014, Proceedings / / edited by Vijay Atluri, Günther Pernul |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XVIII, 391 p. 97 illus.) |
| Disciplina | 005.8 |
| Collana | Information Systems and Applications, incl. Internet/Web, and HCI |
| Soggetto topico |
Computer security
Database management Management information systems Computer science Application software Computer networks Systems and Data Security Database Management Management of Computing and Information Systems Information Systems Applications (incl. Internet) Computer Communication Networks |
| ISBN | 3-662-43936-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Integrity Assurance for Outsourced Databases without DBMS Modification -- Specification and Deployment of Integrated Security Policies for Outsourced Data -- Optimizing Integrity Checks for Join Queries in the Cloud -- Privacy-Enhancing Proxy Signatures from Non-interactive Anonymous Credentials -- Privacy-Preserving Multiple Keyword Search on Outsourced Data in the Clouds -- Secure and Privacy-Preserving Querying of Personal Health Records in the Cloud -- Data Leakage Quantification -- Toward Software Diversity in Heterogeneous Networked Systems -- FSquaDRA: Fast Detection of Repackaged Applications -- ‘Who, When, and Where?’ Location Proof Assertion for Mobile Devices -- Design Patterns for Multiple Stakeholders in Social Computing -- Collaboratively Solving the Traveling Salesman Problem with Limited Disclosure -- ELITE: zEro Links Identity managemenT systEm -- Dynamic Workflow Adjustment with Security Constraints -- Consistent Query Plan Generation in Secure Cooperative Data Access -- Hunting the Unknown: White-Box Database Leakage Detection -- Incremental Analysis of Evolving Administrative Role Based Access Control Policies -- Mining Attribute-Based Access Control Policies from Logs -- Attribute-Aware Relationship-Based Access Control for Online Social Networks -- Randomly Partitioned Encryption for Cloud Databases -- Towards Secure Cloud Database with Fine-Grained Access Control -- Practical Private Information Retrieval from a Time-Varying, Multi-attribute, and Multiple-Occurrence Database -- LPM: Layered Policy Management for Software-Defined Networks -- On Minimizing the Size of Encrypted Databases -- Efficient and Enhanced Solutions for Content Sharing in DRM Systems -- A Scalable and Efficient Privacy Preserving Global Itemset Support Approximation Using Bloom Filters. |
| Record Nr. | UNINA-9910484091003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Database and Expert Systems Applications [[electronic resource] ] : 29th International Conference, DEXA 2018, Regensburg, Germany, September 3–6, 2018, Proceedings, Part II / / edited by Sven Hartmann, Hui Ma, Abdelkader Hameurlain, Günther Pernul, Roland R. Wagner
| Database and Expert Systems Applications [[electronic resource] ] : 29th International Conference, DEXA 2018, Regensburg, Germany, September 3–6, 2018, Proceedings, Part II / / edited by Sven Hartmann, Hui Ma, Abdelkader Hameurlain, Günther Pernul, Roland R. Wagner |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XXIII, 521 p. 151 illus.) |
| Disciplina | 005.74 |
| Collana | Information Systems and Applications, incl. Internet/Web, and HCI |
| Soggetto topico |
Data mining
Database management Application software Information storage and retrieval Artificial intelligence Mathematical logic Data Mining and Knowledge Discovery Database Management Information Systems Applications (incl. Internet) Information Storage and Retrieval Artificial Intelligence Mathematical Logic and Formal Languages |
| ISBN | 3-319-98812-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Information Retrieval -- Uncertain Information -- Data Warehouses and Recommender Systems -- Data Streams -- Information Networks and Algorithms -- Database System Architecture and Performance -- Novel Database Solutions -- Graph Querying and Databases -- Learning -- Emerging Applications -- Data Mining -- Privacy -- Text Processing. |
| Record Nr. | UNISA-996466470803316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Database and Expert Systems Applications [[electronic resource] ] : 29th International Conference, DEXA 2018, Regensburg, Germany, September 3–6, 2018, Proceedings, Part I / / edited by Sven Hartmann, Hui Ma, Abdelkader Hameurlain, Günther Pernul, Roland R. Wagner
| Database and Expert Systems Applications [[electronic resource] ] : 29th International Conference, DEXA 2018, Regensburg, Germany, September 3–6, 2018, Proceedings, Part I / / edited by Sven Hartmann, Hui Ma, Abdelkader Hameurlain, Günther Pernul, Roland R. Wagner |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XXXIII, 479 p. 165 illus.) |
| Disciplina | 005.74 |
| Collana | Information Systems and Applications, incl. Internet/Web, and HCI |
| Soggetto topico |
Data mining
Application software Database management Information storage and retrieval Data structures (Computer science) Algorithms Data Mining and Knowledge Discovery Information Systems Applications (incl. Internet) Database Management Information Storage and Retrieval Data Structures Algorithm Analysis and Problem Complexity |
| ISBN | 3-319-98809-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Abstracts -- Big Data Analytics -- Data Integrity and Privacy -- Decision Support Systems -- Data Semantics -- Cloud Data Processing -- Time Series Data -- Social Networks -- Temporal and Spatial Databases -- Graph Data and Road Networks. |
| Record Nr. | UNISA-996466319103316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Database and Expert Systems Applications : 29th International Conference, DEXA 2018, Regensburg, Germany, September 3–6, 2018, Proceedings, Part I / / edited by Sven Hartmann, Hui Ma, Abdelkader Hameurlain, Günther Pernul, Roland R. Wagner
| Database and Expert Systems Applications : 29th International Conference, DEXA 2018, Regensburg, Germany, September 3–6, 2018, Proceedings, Part I / / edited by Sven Hartmann, Hui Ma, Abdelkader Hameurlain, Günther Pernul, Roland R. Wagner |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XXXIII, 479 p. 165 illus.) |
| Disciplina | 005.74 |
| Collana | Information Systems and Applications, incl. Internet/Web, and HCI |
| Soggetto topico |
Data mining
Application software Database management Information storage and retrieval Data structures (Computer science) Algorithms Data Mining and Knowledge Discovery Information Systems Applications (incl. Internet) Database Management Information Storage and Retrieval Data Structures Algorithm Analysis and Problem Complexity |
| ISBN |
9783319988092
3319988093 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Abstracts -- Big Data Analytics -- Data Integrity and Privacy -- Decision Support Systems -- Data Semantics -- Cloud Data Processing -- Time Series Data -- Social Networks -- Temporal and Spatial Databases -- Graph Data and Road Networks. |
| Record Nr. | UNINA-9910349416503321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
