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 information and computer security : Second International Workshop on Security, IWSEC 2007, Nara, Japan, October 29-31, 2007, proceedings / / Atsuko Miyaji, Hiroaki Kikuchi, Kai Rannenberg (editors)
| Advances in information and computer security : Second International Workshop on Security, IWSEC 2007, Nara, Japan, October 29-31, 2007, proceedings / / Atsuko Miyaji, Hiroaki Kikuchi, Kai Rannenberg (editors) |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer, , [2007] |
| Descrizione fisica | 1 online resource (XIV, 462 p.) |
| Disciplina | 005.8 |
| Collana | Lecture notes in computer science |
| Soggetto topico | Computer security |
| ISBN | 3-540-75651-5 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Software and Multimedia Security -- A Note on the (Im)possibility of Using Obfuscators to Transform Private-Key Encryption into Public-Key Encryption -- Design Issues of an Isolated Sandbox Used to Analyze Malwares -- Collusion-Resistant Fingerprinting Scheme Based on the CDMA-Technique -- Public-Key Cryptography (1) -- Reduction Optimal Trinomials for Efficient Software Implementation of the ? T Pairing -- Experiments on the Linear Algebra Step in the Number Field Sieve -- Batch Pairing Delegation -- Botnet Traffic Detection Techniques by C&C Session Classification Using SVM -- A Global Authentication Scheme for Mobile Ad-Hoc Networks -- An Efficient Pre-authentication Scheme for IEEE 802.11-Based Vehicular Networks -- Intrusion Detection and Identification System Using Data Mining and Forensic Techniques -- Run-Time Randomization to Mitigate Tampering -- Privacy-Preserving Eigentaste-Based Collaborative Filtering -- Secure and Private Incentive-Based Advertisement Dissemination in Mobile Ad Hoc Networks -- Verifiable Internet Voting Solving Secure Platform Problem -- Enforcement of Integrated Security Policy in Trusted Operating Systems -- Salvia: A Privacy-Aware Operating System for Prevention of Data Leakage -- InfoCage: A Development and Evaluation of Confidential File Lifetime Monitoring Technology by Analyzing Events from File Systems and GUIs -- Public-Key Cryptography (2) -- Accredited Symmetrically Private Information Retrieval -- Generic Certificateless Encryption in the Standard Model -- On Security Models and Compilers for Group Key Exchange Protocols -- Processing Multi-parameter Attacktrees with Estimated Parameter Values -- Practical Security Analysis of E-Voting Systems -- Fine-Grained Sticky Provenance Architecture for Office Documents -- Secure Anonymous Communications with Practical Anonymity Revocation Scheme -- GAS: Overloading a File Sharing Network as an Anonymizing System -- A Composite Privacy Protection Model -- Nominative Signature from Ring Signature -- Anonymous Authentication Protocols with Credit-Based Chargeability and Fair Privacy for Mobile Communications -- How to Find Many Collisions of 3-Pass HAVAL -- A Secure Threshold Anonymous Password-Authenticated Key Exchange Protocol. |
| Record Nr. | UNINA-9910484098703321 |
| Berlin ; ; Heidelberg : , : Springer, , [2007] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Advances in information and computer security : Second International Workshop on Security, IWSEC 2007, Nara, Japan, October 29-31, 2007, proceedings / / Atsuko Miyaji, Hiroaki Kikuchi, Kai Rannenberg (editors)
| Advances in information and computer security : Second International Workshop on Security, IWSEC 2007, Nara, Japan, October 29-31, 2007, proceedings / / Atsuko Miyaji, Hiroaki Kikuchi, Kai Rannenberg (editors) |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer, , [2007] |
| Descrizione fisica | 1 online resource (XIV, 462 p.) |
| Disciplina | 005.8 |
| Collana | Lecture notes in computer science |
| Soggetto topico | Computer security |
| ISBN | 3-540-75651-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Software and Multimedia Security -- A Note on the (Im)possibility of Using Obfuscators to Transform Private-Key Encryption into Public-Key Encryption -- Design Issues of an Isolated Sandbox Used to Analyze Malwares -- Collusion-Resistant Fingerprinting Scheme Based on the CDMA-Technique -- Public-Key Cryptography (1) -- Reduction Optimal Trinomials for Efficient Software Implementation of the ? T Pairing -- Experiments on the Linear Algebra Step in the Number Field Sieve -- Batch Pairing Delegation -- Botnet Traffic Detection Techniques by C&C Session Classification Using SVM -- A Global Authentication Scheme for Mobile Ad-Hoc Networks -- An Efficient Pre-authentication Scheme for IEEE 802.11-Based Vehicular Networks -- Intrusion Detection and Identification System Using Data Mining and Forensic Techniques -- Run-Time Randomization to Mitigate Tampering -- Privacy-Preserving Eigentaste-Based Collaborative Filtering -- Secure and Private Incentive-Based Advertisement Dissemination in Mobile Ad Hoc Networks -- Verifiable Internet Voting Solving Secure Platform Problem -- Enforcement of Integrated Security Policy in Trusted Operating Systems -- Salvia: A Privacy-Aware Operating System for Prevention of Data Leakage -- InfoCage: A Development and Evaluation of Confidential File Lifetime Monitoring Technology by Analyzing Events from File Systems and GUIs -- Public-Key Cryptography (2) -- Accredited Symmetrically Private Information Retrieval -- Generic Certificateless Encryption in the Standard Model -- On Security Models and Compilers for Group Key Exchange Protocols -- Processing Multi-parameter Attacktrees with Estimated Parameter Values -- Practical Security Analysis of E-Voting Systems -- Fine-Grained Sticky Provenance Architecture for Office Documents -- Secure Anonymous Communications with Practical Anonymity Revocation Scheme -- GAS: Overloading a File Sharing Network as an Anonymizing System -- A Composite Privacy Protection Model -- Nominative Signature from Ring Signature -- Anonymous Authentication Protocols with Credit-Based Chargeability and Fair Privacy for Mobile Communications -- How to Find Many Collisions of 3-Pass HAVAL -- A Secure Threshold Anonymous Password-Authenticated Key Exchange Protocol. |
| Record Nr. | UNISA-996465741603316 |
| Berlin ; ; Heidelberg : , : Springer, , [2007] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Applied Cryptography and Network Security [[electronic resource] ] : 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings / / edited by Dieter Gollmann, Atsuko Miyaji, Hiroaki Kikuchi
| Applied Cryptography and Network Security [[electronic resource] ] : 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings / / edited by Dieter Gollmann, Atsuko Miyaji, Hiroaki Kikuchi |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XVI, 710 p. 167 illus.) |
| Disciplina | 005.82 |
| Collana | Security and Cryptology |
| Soggetto topico |
Computer security
Data encryption (Computer science) Data protection Computer communication systems Software engineering Application software Systems and Data Security Cryptology Security Computer Communication Networks Software Engineering Information Systems Applications (incl. Internet) |
| ISBN | 3-319-61204-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Sampling From Arbitrary Centered Discrete Gaussians For Lattice-Based Cryptography -- Simple Security Definitions for and Constructions of 0-RTT Key Exchange -- TOPPSS: Cost-minimal Password-Protected Secret Sharing based on Threshold OPRF -- Secure and Efficient Pairing at 256-bit Security Level -- Data Protection and Mobile Security No Free Charge Theorem: a Covert Channel via USB Charging Cable on Mobile Devices -- Are You Lying: Validating the Time-Location of Outdoor Images -- Lights, Camera, Action! Exploring Effects of Visual Distractions on Completion of Security Tasks -- A Pilot Study of Multiple Password Interference between Text and Map-based Passwords -- Hierarchical Key Assignment with Dynamic Read-Write Privilege Enforcement and Extended KI-Security -- A Novel GPU-Based Implementation of the Cube Attack – Preliminary Results Against Trivium -- Related-Key Impossible-Differential Attack on Reduced-Round SKINNY -- Faster Secure Multi-Party Computation of AES and DES Using Lookup Tables -- An experimental study of the BDD approach for the search LWE problem -- Efficiently Obfuscating Re-Encryption Program under DDH Assumption -- Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease -- A Practical Chosen Message Power Analysis Approach against Ciphers with the Key Whitening Layers -- Side-Channel Attacks meet Secure Network Protocols -- Lattice-based DAPS and Generalizations: Self-Enforcement in Signature Schemes -- Forward-Secure Searchable Encryption on Labeled Bipartite Graphs -- Bounds in Various Generalized Settings of the Discrete Logarithm Problem -- An Enhanced Binary Characteristic Set Algorithm And Its Applications to Algebraic Cryptanalysis -- Accountable Storage -- Maliciously Secure Multi-Client ORAM -- Legacy-Compliant Data Authentication for Industrial Control System Traffic -- Multi-Client Oblivious RAM Secure Against Malicious Servers -- Breaking and Fixing Mobile App Authentication with OAuth2.0-based Protocols -- Adaptive Proofs have Straightline Extractors (in the Random Oracle Model) -- How to Achieve Bounded Key Dependent Message Security -- Signature Schemes with Randomized Verification -- SCRAPE: Scalable Randomness Attested by Public Entities -- cMix : Mixing with Minimal Real-Time Asymmetric Cryptographic Operation -- Almost Optimal Oblivious Transfer from QA-NIZK -- OnionPIR: Effective Protection of Sensitive Metadata in Online Communication Networks. |
| Record Nr. | UNISA-996466465803316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Applied Cryptography and Network Security : 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings / / edited by Dieter Gollmann, Atsuko Miyaji, Hiroaki Kikuchi
| Applied Cryptography and Network Security : 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings / / edited by Dieter Gollmann, Atsuko Miyaji, Hiroaki Kikuchi |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XVI, 710 p. 167 illus.) |
| Disciplina | 005.82 |
| Collana | Security and Cryptology |
| Soggetto topico |
Computer security
Data encryption (Computer science) Data protection Computer networks Software engineering Application software Systems and Data Security Cryptology Security Computer Communication Networks Software Engineering Information Systems Applications (incl. Internet) |
| ISBN | 3-319-61204-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Sampling From Arbitrary Centered Discrete Gaussians For Lattice-Based Cryptography -- Simple Security Definitions for and Constructions of 0-RTT Key Exchange -- TOPPSS: Cost-minimal Password-Protected Secret Sharing based on Threshold OPRF -- Secure and Efficient Pairing at 256-bit Security Level -- Data Protection and Mobile Security No Free Charge Theorem: a Covert Channel via USB Charging Cable on Mobile Devices -- Are You Lying: Validating the Time-Location of Outdoor Images -- Lights, Camera, Action! Exploring Effects of Visual Distractions on Completion of Security Tasks -- A Pilot Study of Multiple Password Interference between Text and Map-based Passwords -- Hierarchical Key Assignment with Dynamic Read-Write Privilege Enforcement and Extended KI-Security -- A Novel GPU-Based Implementation of the Cube Attack – Preliminary Results Against Trivium -- Related-Key Impossible-Differential Attack on Reduced-Round SKINNY -- Faster Secure Multi-Party Computation of AES and DES Using Lookup Tables -- An experimental study of the BDD approach for the search LWE problem -- Efficiently Obfuscating Re-Encryption Program under DDH Assumption -- Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease -- A Practical Chosen Message Power Analysis Approach against Ciphers with the Key Whitening Layers -- Side-Channel Attacks meet Secure Network Protocols -- Lattice-based DAPS and Generalizations: Self-Enforcement in Signature Schemes -- Forward-Secure Searchable Encryption on Labeled Bipartite Graphs -- Bounds in Various Generalized Settings of the Discrete Logarithm Problem -- An Enhanced Binary Characteristic Set Algorithm And Its Applications to Algebraic Cryptanalysis -- Accountable Storage -- Maliciously Secure Multi-Client ORAM -- Legacy-Compliant Data Authentication for Industrial Control System Traffic -- Multi-Client Oblivious RAM Secure Against Malicious Servers -- Breaking and Fixing Mobile App Authentication with OAuth2.0-based Protocols -- Adaptive Proofs have Straightline Extractors (in the Random Oracle Model) -- How to Achieve Bounded Key Dependent Message Security -- Signature Schemes with Randomized Verification -- SCRAPE: Scalable Randomness Attested by Public Entities -- cMix : Mixing with Minimal Real-Time Asymmetric Cryptographic Operation -- Almost Optimal Oblivious Transfer from QA-NIZK -- OnionPIR: Effective Protection of Sensitive Metadata in Online Communication Networks. |
| Record Nr. | UNINA-9910483812503321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Cryptology and network security : 8th international conference, CANS 2009, Kanazawa, Japan, December 12-14, 2009. proceedings / / Juan A. Garay, Atsuko Miyaji, Akira Otsuka, (eds.)
| Cryptology and network security : 8th international conference, CANS 2009, Kanazawa, Japan, December 12-14, 2009. proceedings / / Juan A. Garay, Atsuko Miyaji, Akira Otsuka, (eds.) |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, 2009 |
| Descrizione fisica | 1 online resource (XIV, 538 p.) |
| Disciplina | 004n/a |
| Altri autori (Persone) |
GarayJuan A
MiyajiAtsuko OtsukaAkira |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Computer security
Data encryption (Computer science) |
| ISBN | 3-642-10433-9 |
| Classificazione |
DAT 461f
DAT 465f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Cryptographic Protocol and Schemes I -- Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima -- Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security -- On Cryptographic Schemes Based on Discrete Logarithms and Factoring -- Invited Talk 1 -- Asymptotically Optimal and Private Statistical Estimation -- Cryptanalysis I -- Linear (Hull) and Algebraic Cryptanalysis of the Block Cipher PRESENT -- Saturation Attack on the Block Cipher HIGHT -- Extensions of the Cube Attack Based on Low Degree Annihilators -- An Analysis of the Compact XSL Attack on BES and Embedded SMS4 -- Wireless and Sensor Network Security I -- RFID Distance Bounding Protocol with Mixed Challenges to Prevent Relay Attacks -- Anonymizer-Enabled Security and Privacy for RFID -- Blink ’Em All: Scalable, User-Friendly and Secure Initialization of Wireless Sensor Nodes -- Network Security -- DepenDNS: Dependable Mechanism against DNS Cache Poisoning -- Privacy and Anonymity -- Privacy-Preserving Relationship Path Discovery in Social Networks -- Verifying Anonymous Credential Systems in Applied Pi Calculus -- Transferable Constant-Size Fair E-Cash -- Functional and Searchable Encryption -- A Secure Channel Free Public Key Encryption with Keyword Search Scheme without Random Oracle -- Private-Key Hidden Vector Encryption with Key Confidentiality -- Invited Talk 2 -- Building Secure Networked Systems with Code Attestation -- Authentication -- HPAKE : Password Authentication Secure against Cross-Site User Impersonation -- An Efficient and Provably Secure Cross-Realm Client-to-Client Password-Authenticated Key Agreement Protocol with Smart Cards -- Ensuring Authentication of Digital Information Using Cryptographic Accumulators -- Block Cipher Design -- MIBS: A New Lightweight Block Cipher -- Cryptanalysis II -- Distinguishing and Second-Preimage Attacks on CBC-Like MACs -- Improving the Rainbow Attack by Reusing Colours -- Side Channel Cube Attack on PRESENT -- Algebraic Attack on the MQQ Public Key Cryptosystem -- Algebraic and Number-Theoretic Schemes -- Construction of Rotation Symmetric Boolean Functions with Maximum Algebraic Immunity -- Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves -- On the Complexity of Computing Discrete Logarithms over Algebraic Tori -- Wireless and Sensor Network Security II -- On the Usability of Secure Association of Wireless Devices Based on Distance Bounding -- Short Hash-Based Signatures for Wireless Sensor Networks -- Invited Talk 3 -- Computing on Encrypted Data -- Cryptographic Protocol and Schemes II -- Fully Robust Tree-Diffie-Hellman Group Key Exchange -- Group Signatures with Verifier-Local Revocation and Backward Unlinkability in the Standard Model -- Relinkable Ring Signature. |
| Record Nr. | UNINA-9910482963603321 |
| Berlin ; ; New York, : Springer, 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Network and System Security [[electronic resource] ] : 17th International Conference, NSS 2023, Canterbury, UK, August 14–16, 2023, Proceedings / / edited by Shujun Li, Mark Manulis, Atsuko Miyaji
| Network and System Security [[electronic resource] ] : 17th International Conference, NSS 2023, Canterbury, UK, August 14–16, 2023, Proceedings / / edited by Shujun Li, Mark Manulis, Atsuko Miyaji |
| Autore | Li Shujun |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (404 pages) |
| Disciplina | 005.8 |
| Altri autori (Persone) |
ManulisMark
MiyajiAtsuko |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer networks - Security measures
Data protection Mobile and Network Security Security Services |
| ISBN | 3-031-39828-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Attacks and Malware -- Blockchain -- Cryptography and Privacy -- Machine Learning -- Security through Hardware -- Security in the Wild. . |
| Record Nr. | UNISA-996546853303316 |
Li Shujun
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Network and System Security : 17th International Conference, NSS 2023, Canterbury, UK, August 14–16, 2023, Proceedings / / edited by Shujun Li, Mark Manulis, Atsuko Miyaji
| Network and System Security : 17th International Conference, NSS 2023, Canterbury, UK, August 14–16, 2023, Proceedings / / edited by Shujun Li, Mark Manulis, Atsuko Miyaji |
| Autore | Li Shujun |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (404 pages) |
| Disciplina | 005.8 |
| Altri autori (Persone) |
ManulisMark
MiyajiAtsuko |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer networks - Security measures
Data protection Mobile and Network Security Security Services |
| ISBN | 3-031-39828-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Attacks and Malware -- Blockchain -- Cryptography and Privacy -- Machine Learning -- Security through Hardware -- Security in the Wild. . |
| Record Nr. | UNINA-9910741148403321 |
|
Li Shujun
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Pairing-Based Cryptography - Pairing 2010 [[electronic resource] ] : 4th International Conference, Yamanaka Hot Spring, Japan, December 13-15, 2010, Proceedings / / edited by Marc Joye, Atsuko Miyaji, Akira Otsuka
| Pairing-Based Cryptography - Pairing 2010 [[electronic resource] ] : 4th International Conference, Yamanaka Hot Spring, Japan, December 13-15, 2010, Proceedings / / edited by Marc Joye, Atsuko Miyaji, Akira Otsuka |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XIII, 467 p. 37 illus.) |
| Disciplina | 005.8/2 |
| Collana | Security and Cryptology |
| Soggetto topico |
Data encryption (Computer science)
Computer science—Mathematics Coding theory Information theory Computer communication systems Algorithms Computer security Cryptology Discrete Mathematics in Computer Science Coding and Information Theory Computer Communication Networks Algorithm Analysis and Problem Complexity Systems and Data Security |
| ISBN |
1-280-39056-5
9786613568489 3-642-17455-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Efficient Software Implementation -- An Analysis of Affine Coordinates for Pairing Computation -- High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves -- Invited Talk 1 -- Some Security Topics with Possible Applications for Pairing-Based Cryptography -- Digital Signatures -- A New Construction of Designated Confirmer Signature and Its Application to Optimistic Fair Exchange -- Anonymizable Signature and Its Construction from Pairings -- Identification of Multiple Invalid Pairing-Based Signatures in Constrained Batches -- Cryptographic Protocols -- Oblivious Transfer with Access Control : Realizing Disjunction without Duplication -- Increased Resilience in Threshold Cryptography: Sharing a Secret with Devices That Cannot Store Shares -- Shorter Verifier-Local Revocation Group Signature with Backward Unlinkability -- Key Agreement -- Strongly Secure Two-Pass Attribute-Based Authenticated Key Exchange -- Constructing Certificateless Encryption and ID-Based Encryption from ID-Based Key Agreement -- Ephemeral Key Leakage Resilient and Efficient ID-AKEs That Can Share Identities, Private and Master Keys -- Invited Talk 2 -- Pairing-Based Non-interactive Zero-Knowledge Proofs -- Applications: Code Generation, Time-Released Encryption, Cloud Computing -- Designing a Code Generator for Pairing Based Cryptographic Functions -- Efficient Generic Constructions of Timed-Release Encryption with Pre-open Capability -- Optimal Authenticated Data Structures with Multilinear Forms -- Point Encoding and Pairing-Friendly Curves -- Deterministic Encoding and Hashing to Odd Hyperelliptic Curves -- Encoding Points on Hyperelliptic Curves over Finite Fields in Deterministic Polynomial Time -- A New Method for Constructing Pairing-Friendly Abelian Surfaces -- Generating More Kawazoe-Takahashi Genus 2 Pairing-Friendly Hyperelliptic Curves -- ID-Based Encryption Schemes -- New Identity-Based Proxy Re-encryption Schemes to Prevent Collusion Attacks -- Fully Secure Anonymous HIBE and Secret-Key Anonymous IBE with Short Ciphertexts -- Chosen-Ciphertext Secure Identity-Based Encryption from Computational Bilinear Diffie-Hellman -- Invited Talk 3 -- A Survey of Local and Global Pairings on Elliptic Curves and Abelian Varieties -- Efficient Hardware, FPGAs, and Algorithms -- Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular Curves -- A Variant of Miller’s Formula and Algorithm -- Pairing Computation on Elliptic Curves with Efficiently Computable Endomorphism and Small Embedding Degree -- High Speed Flexible Pairing Cryptoprocessor on FPGA Platform. |
| Record Nr. | UNISA-996465703703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Provable Security [[electronic resource] ] : 9th International Conference, ProvSec 2015, Kanazawa, Japan, November 24-26, 2015, Proceedings / / edited by Man-Ho Au, Atsuko Miyaji
| Provable Security [[electronic resource] ] : 9th International Conference, ProvSec 2015, Kanazawa, Japan, November 24-26, 2015, Proceedings / / edited by Man-Ho Au, Atsuko Miyaji |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XIX, 504 p. 65 illus. in color.) |
| Disciplina | 005.8 |
| Collana | Security and Cryptology |
| Soggetto topico |
Data encryption (Computer science)
Computer security Computers and civilization Application software Management information systems Computer science Cryptology Systems and Data Security Computers and Society Computer Appl. in Administrative Data Processing Management of Computing and Information Systems |
| ISBN | 3-319-26059-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Provsec 2015 The 9th International Conference on Provable Security -- Invited Talks -- Advances in Authenticated Encryption -- New Advances in Secure RAM Computation -- On Privacy for RFID -- Contents -- Invited Paper -- On Privacy for RFID -- 1 Introduction -- 2 The V07 Model and the OV12 Extension -- 3 The HPVP11 Model -- 4 Strong Privacy in Distance Bounding -- 5 Conclusion -- References -- Fundamental -- From Stateful Hardware to Resettable Hardware Using Symmetric Assumptions -- 1 Introduction -- 1.1 Our Contribution -- 1.2 Efficiency -- 1.3 Further Related Work -- 2 Preliminaries -- 2.1 The UC-Framework -- 2.2 Signature Schemes -- 2.3 Commitment Schemes -- 2.4 Resettably-Sound Zero-Knowledge Arguments of Knowledge -- 2.5 Sig-Com Schemes -- 3 Ideal Functionalities -- 4 Compiler -- 4.1 Protocol Using Resettably-Sound Zero-Knowledge -- 4.2 Protocol Using UC-Secure Seed-OTs -- 5 Optimizations -- 6 Implications -- References -- Constrained Verifiable Random Functions from Indistinguishability Obfuscation -- 1 Introduction -- 2 Preliminaries -- 2.1 Indistinguishability Obfuscation -- 2.2 Puncturable PRFs -- 2.3 Commitment Schemes 19 -- 3 Constrained Verifiable Random Functions -- 4 Generic Construction of Constrained VRFs -- 5 Conclusion -- References -- An Improved Attack for Recovering Noisy RSA Secret Keys and Its Countermeasure -- 1 Introduction -- 1.1 Background -- 1.2 Our Contributions -- 2 Preliminaries -- 2.1 Notation -- 2.2 HS Algorithm -- Recovering RSA Secret Keys by Using Binary Trees-- -- 2.3 HMM Algorithm and KSI Algorithm -- 2.4 Reviews for Probability Theory and Information Theory -- 3 Improving the KSI Bound by Chernoff--Hoeffding Bound -- 3.1 The KSI Algorithm -- 3.2 Improved Bounds for Erasure and Error Case -- 4 Practical Countermeasure Against Secret-Key Extraction Attack -- 4.1 Attack Model.
4.2 Simple (but Ineffective) Countermeasures -- 4.3 Our Countermeasure -- 4.4 Analyses Against Two Types of Adversaries -- 4.5 Information-Theoretic View of our Countermeasure -- 5 Provable Bound for Asymmetric Errors -- A Hamming Distance Between Two Sequences with Erasures -- B Relation Between the Hoeffding Bound and the Chernoff--Hoeffding Bound -- C Another Parameter Choices -- C.1 How to Choose Analytically -- C.2 More Extension -- References -- Protocol -- Augmented Secure Channels and the Goal of the TLS 1.3 Record Layer -- 1 Introduction -- 2 Preliminaries -- 3 Revisiting the Functionality and Modeling of Communication Channels -- 3.1 Existing Formalizations -- 3.2 What Service Should a Secure Channel Provide? -- 4 Constructing an Augmented Secure Channel via Authenticated Encryption -- 4.1 Assumed Resources -- 4.2 Protocol -- 4.3 The Construction Notion -- 4.4 Proof of the Construction -- 5 The Goal of the TLS 1.3 Record Layer -- 5.1 Formalizing the Goal of TLS Record Payload Protection -- 5.2 Achieving the Goal -- 5.3 Using the Protocol in TLS 1.3 -- References -- Sound Proof of Proximity of Knowledge -- 1 Introduction -- 2 Model and Definitions -- 2.1 Computational, Communication, and Adversarial Models -- 2.2 PoPoK: Proofs of Proximity of Knowledge -- 3 ProProx: A PoPoK Scheme -- 3.1 Building Blocks -- 3.2 The ProProx Protocol -- 3.3 Analysis -- 3.4 Simplification in the Noiseless Communications Case -- 3.5 Concrete Parameters -- 4 Conclusion -- References -- Multi-party Computation with Small Shuffle Complexity Using Regular Polygon Cards -- 1 Introduction -- 1.1 Background -- 1.2 Our Contribution -- 1.3 Related Works -- 2 Our New Cards and Model of Protocols -- 2.1 Regular Polygon Cards -- 2.2 Operations -- 2.3 Model -- 3 Efficient Protocols Using Regular Polygon Cards -- 3.1 Addition, Subtraction, and Copy Protocols. 3.2 Protocol for Multiplication by a Constant -- 4 Efficient Protocols Using Oblivious Conversion -- 5 Efficient Voting Protocol for Multiple Candidates -- References -- Authenticated Encryption and Key Exchange -- Forward-Secure Authenticated Symmetric Key Exchange Protocol: New Security Model and Secure Construction -- 1 Introduction -- 1.1 Our Contributions -- 2 Preliminaries -- 2.1 Notations -- 2.2 Some Standard Definitions -- 2.3 Complexity Assumption -- 3 Our Security Model -- 3.1 Session -- 3.2 Adversary -- 3.3 Few Important Definitions -- 4 Symmetric Key Exchange Protocol Resilient to Fully Active (FA) Adversaries -- 4.1 Intuition Behind our Construction -- 4.2 Protocol : A Three-Pass Protocol Secure Against FA Adversaries -- 4.3 Need for Disallowing LTK_Reveal Query in the Test Session for the Current Epoch -- 4.4 Security Proof of -- 5 Conclusion and Future Work -- References -- Full PRF-Secure Message Authentication Code Based on Tweakable Block Cipher -- 1 Introduction -- 2 Notations and Security Definitions -- 3 Simple Construction: 3-Key MAC from Tweakable Block Cipher -- 3.1 Specification of PMAC_TBC3k -- 3.2 PRF-Security -- 3.3 Proof of Theorem 1 -- 3.4 Remark -- 4 Full PRF-Secure, Single-Key MAC from Tweakable Block Cipher -- 4.1 Specification of PMAC_TBC1k -- 4.2 PRF-Security -- 4.3 Proof of Theorem 2 -- A Analysis of the XOR of Two Random Permutations P"0365Ptw1 and P"0365Ptw2 -- References -- Efficient Key Authentication Service for Secure End-to-End Communications -- 1 Introduction -- 1.1 Related Work -- 1.2 Model -- 1.3 Overview -- 2 Key Authentication Service -- 2.1 Preliminaries -- 2.2 Key Authentication Service Scheme -- 2.3 Security Definitions of the Key Authentication Service -- 3 Construction -- 3.1 Description of the Operations -- 4 Analysis -- 4.1 KAS Security Proof -- 4.2 Asymptotic Comparison to Previous Work. 4.3 Performance Analysis -- References -- PPAE: Practical Parazoa Authenticated Encryption Family -- 1 Introduction -- 2 Preliminaries -- 2.1 Notations -- 2.2 Authenticated Encryption - AE -- 2.3 Security Notion for AE -- 3 Parazoa Family -- 3.1 Compression Function f -- 3.2 Extraction Function g -- 3.3 Finalization Function fin -- 3.4 Padding Function pad -- 3.5 Indifferentiability of Parazoa Functions -- 4 Practical Parazoa Hash - PPH -- 4.1 Compression Function fp -- 4.2 Extraction Function gp -- 4.3 Indifferentiability Bound of PPH -- 5 Practical Parazoa Authenticated Encryption Family (PPAE) -- 5.1 Description -- 6 PPAE Security -- 6.1 PPAE: Privacy -- 6.2 PPAE: Authenticity -- 7 Examples -- 7.1 Keyak -- 8 Conclusion -- References -- Encryption and Identification -- Lightweight Anonymous Authentication for Ad Hoc Group: A Ring Signature Approach -- 1 Introduction -- 1.1 Our Contributions -- 2 Definitions -- 2.1 Complexity Assumption -- 2.2 Security Model -- 3 The Proposed Scheme -- 3.1 Construction -- 3.2 Security Analysis -- 4 Efficiency Analysis -- 4.1 Comparison of Existing Ring Signatures -- 4.2 Running Time -- 5 Conclusion -- References -- Reset-Secure Identity-Based Identification Schemes Without Pairings -- 1 Introduction -- 1.1 Motivations -- 1.2 Related Work -- 1.3 Contributions -- 2 Preliminaries -- 2.1 Discrete Logarithm Assumption -- 2.2 One-More Discrete Logarithm Assumption -- 2.3 (Reset-Secure) Identity-Based Identification Schemes -- 2.4 The Pedersen Trapdoor Commitment Scheme -- 2.5 Pseudorandom Functions -- 2.6 Collision-Resistant Hash Function -- 3 Construction of the Schnorr-RS-IBI Scheme -- 4 Security Analysis for Schnorr-RS-IBI -- 5 Construction of the Twin-Schnorr-RS-IBI Scheme -- 6 Security Analysis for Twin-Schnorr-RS-IBI -- 7 Efficiency Analysis -- 8 Extension to Concurrent-Reset-2 Security -- A Choices of H2 (and H3). A.1 Collision-Resistant Hash H2 (and H3) -- A.2 Pseudorandom Functions (PRFs) -- References -- Attribute-Based Encryption for Finite Automata from LWE -- 1 Introduction -- 1.1 Our Results -- 1.2 Related Work -- 2 Preliminaries -- 2.1 An Overview of Deterministic Finite Automata -- 2.2 Definitions of ABE System for DFAs -- 3 Lattices -- 3.1 Integer Lattices -- 3.2 Trapdoors of Lattices and Discrete Gaussians -- 3.3 The LWE Hardness Assumption -- 4 Attribute-Based Encryption for DFAs -- 4.1 Construction -- 4.2 Proof of Security -- 5 Efficiency and Further Discussion -- 5.1 Efficiency -- 5.2 Discussion -- 6 Conclusion -- A Parameters and Correctness of Construction -- References -- Functional Signcryption: Notion, Construction, and Applications -- 1 Introduction -- 2 Preliminaries -- 2.1 Indistinguishability Obfuscation -- 2.2 Statistically Simulation-Sound Non-interactive Zero-Knowledge Proof of Knowledge -- 3 The Notion of Functional Signcryption -- 4 Our FSC Scheme -- 4.1 Construction -- 4.2 Security Analysis -- 5 Attribute-Based Signcryption (ABSC) for General Circuits from FSC -- 5.1 The Notion of ABSC for General Circuits -- 5.2 Our Key-Policy ABSC Scheme -- 6 Other Cryptographic Primitives from FSC -- 7 Conclusion -- References -- Privacy and Cloud -- BetterTimes -- 1 Introduction -- 1.1 Exploits for Proximity Protocols -- 2 Background -- 3 Arithmetic Formulas Through Assured Multiplication -- 3.1 Privacy-Assured Outsourced Multiplication -- 3.2 Privacy-Assured Arithmetic Formulas -- 4 Security Guarantees -- 5 Evaluation -- 6 Related Work -- 7 Conclusions -- A A Concrete Instantiation to Secure Hallgren et al. -- B Visualization of Privacy-Preserving Arithmetic Formula -- References -- Provably Secure Identity Based Provable Data Possession -- 1 Introduction -- 2 Models and Assumptions -- 2.1 System Model for ID-PDP -- 2.2 Security Model. 3 A Generic Construction of ID-PDP. |
| Record Nr. | UNISA-996466448303316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Provable Security : 9th International Conference, ProvSec 2015, Kanazawa, Japan, November 24-26, 2015, Proceedings / / edited by Man-Ho Au, Atsuko Miyaji
| Provable Security : 9th International Conference, ProvSec 2015, Kanazawa, Japan, November 24-26, 2015, Proceedings / / edited by Man-Ho Au, Atsuko Miyaji |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XIX, 504 p. 65 illus. in color.) |
| Disciplina | 005.8 |
| Collana | Security and Cryptology |
| Soggetto topico |
Data encryption (Computer science)
Computer security Computers and civilization Application software Management information systems Computer science Cryptology Systems and Data Security Computers and Society Computer Appl. in Administrative Data Processing Management of Computing and Information Systems |
| ISBN | 3-319-26059-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Provsec 2015 The 9th International Conference on Provable Security -- Invited Talks -- Advances in Authenticated Encryption -- New Advances in Secure RAM Computation -- On Privacy for RFID -- Contents -- Invited Paper -- On Privacy for RFID -- 1 Introduction -- 2 The V07 Model and the OV12 Extension -- 3 The HPVP11 Model -- 4 Strong Privacy in Distance Bounding -- 5 Conclusion -- References -- Fundamental -- From Stateful Hardware to Resettable Hardware Using Symmetric Assumptions -- 1 Introduction -- 1.1 Our Contribution -- 1.2 Efficiency -- 1.3 Further Related Work -- 2 Preliminaries -- 2.1 The UC-Framework -- 2.2 Signature Schemes -- 2.3 Commitment Schemes -- 2.4 Resettably-Sound Zero-Knowledge Arguments of Knowledge -- 2.5 Sig-Com Schemes -- 3 Ideal Functionalities -- 4 Compiler -- 4.1 Protocol Using Resettably-Sound Zero-Knowledge -- 4.2 Protocol Using UC-Secure Seed-OTs -- 5 Optimizations -- 6 Implications -- References -- Constrained Verifiable Random Functions from Indistinguishability Obfuscation -- 1 Introduction -- 2 Preliminaries -- 2.1 Indistinguishability Obfuscation -- 2.2 Puncturable PRFs -- 2.3 Commitment Schemes 19 -- 3 Constrained Verifiable Random Functions -- 4 Generic Construction of Constrained VRFs -- 5 Conclusion -- References -- An Improved Attack for Recovering Noisy RSA Secret Keys and Its Countermeasure -- 1 Introduction -- 1.1 Background -- 1.2 Our Contributions -- 2 Preliminaries -- 2.1 Notation -- 2.2 HS Algorithm -- Recovering RSA Secret Keys by Using Binary Trees-- -- 2.3 HMM Algorithm and KSI Algorithm -- 2.4 Reviews for Probability Theory and Information Theory -- 3 Improving the KSI Bound by Chernoff--Hoeffding Bound -- 3.1 The KSI Algorithm -- 3.2 Improved Bounds for Erasure and Error Case -- 4 Practical Countermeasure Against Secret-Key Extraction Attack -- 4.1 Attack Model.
4.2 Simple (but Ineffective) Countermeasures -- 4.3 Our Countermeasure -- 4.4 Analyses Against Two Types of Adversaries -- 4.5 Information-Theoretic View of our Countermeasure -- 5 Provable Bound for Asymmetric Errors -- A Hamming Distance Between Two Sequences with Erasures -- B Relation Between the Hoeffding Bound and the Chernoff--Hoeffding Bound -- C Another Parameter Choices -- C.1 How to Choose Analytically -- C.2 More Extension -- References -- Protocol -- Augmented Secure Channels and the Goal of the TLS 1.3 Record Layer -- 1 Introduction -- 2 Preliminaries -- 3 Revisiting the Functionality and Modeling of Communication Channels -- 3.1 Existing Formalizations -- 3.2 What Service Should a Secure Channel Provide? -- 4 Constructing an Augmented Secure Channel via Authenticated Encryption -- 4.1 Assumed Resources -- 4.2 Protocol -- 4.3 The Construction Notion -- 4.4 Proof of the Construction -- 5 The Goal of the TLS 1.3 Record Layer -- 5.1 Formalizing the Goal of TLS Record Payload Protection -- 5.2 Achieving the Goal -- 5.3 Using the Protocol in TLS 1.3 -- References -- Sound Proof of Proximity of Knowledge -- 1 Introduction -- 2 Model and Definitions -- 2.1 Computational, Communication, and Adversarial Models -- 2.2 PoPoK: Proofs of Proximity of Knowledge -- 3 ProProx: A PoPoK Scheme -- 3.1 Building Blocks -- 3.2 The ProProx Protocol -- 3.3 Analysis -- 3.4 Simplification in the Noiseless Communications Case -- 3.5 Concrete Parameters -- 4 Conclusion -- References -- Multi-party Computation with Small Shuffle Complexity Using Regular Polygon Cards -- 1 Introduction -- 1.1 Background -- 1.2 Our Contribution -- 1.3 Related Works -- 2 Our New Cards and Model of Protocols -- 2.1 Regular Polygon Cards -- 2.2 Operations -- 2.3 Model -- 3 Efficient Protocols Using Regular Polygon Cards -- 3.1 Addition, Subtraction, and Copy Protocols. 3.2 Protocol for Multiplication by a Constant -- 4 Efficient Protocols Using Oblivious Conversion -- 5 Efficient Voting Protocol for Multiple Candidates -- References -- Authenticated Encryption and Key Exchange -- Forward-Secure Authenticated Symmetric Key Exchange Protocol: New Security Model and Secure Construction -- 1 Introduction -- 1.1 Our Contributions -- 2 Preliminaries -- 2.1 Notations -- 2.2 Some Standard Definitions -- 2.3 Complexity Assumption -- 3 Our Security Model -- 3.1 Session -- 3.2 Adversary -- 3.3 Few Important Definitions -- 4 Symmetric Key Exchange Protocol Resilient to Fully Active (FA) Adversaries -- 4.1 Intuition Behind our Construction -- 4.2 Protocol : A Three-Pass Protocol Secure Against FA Adversaries -- 4.3 Need for Disallowing LTK_Reveal Query in the Test Session for the Current Epoch -- 4.4 Security Proof of -- 5 Conclusion and Future Work -- References -- Full PRF-Secure Message Authentication Code Based on Tweakable Block Cipher -- 1 Introduction -- 2 Notations and Security Definitions -- 3 Simple Construction: 3-Key MAC from Tweakable Block Cipher -- 3.1 Specification of PMAC_TBC3k -- 3.2 PRF-Security -- 3.3 Proof of Theorem 1 -- 3.4 Remark -- 4 Full PRF-Secure, Single-Key MAC from Tweakable Block Cipher -- 4.1 Specification of PMAC_TBC1k -- 4.2 PRF-Security -- 4.3 Proof of Theorem 2 -- A Analysis of the XOR of Two Random Permutations P"0365Ptw1 and P"0365Ptw2 -- References -- Efficient Key Authentication Service for Secure End-to-End Communications -- 1 Introduction -- 1.1 Related Work -- 1.2 Model -- 1.3 Overview -- 2 Key Authentication Service -- 2.1 Preliminaries -- 2.2 Key Authentication Service Scheme -- 2.3 Security Definitions of the Key Authentication Service -- 3 Construction -- 3.1 Description of the Operations -- 4 Analysis -- 4.1 KAS Security Proof -- 4.2 Asymptotic Comparison to Previous Work. 4.3 Performance Analysis -- References -- PPAE: Practical Parazoa Authenticated Encryption Family -- 1 Introduction -- 2 Preliminaries -- 2.1 Notations -- 2.2 Authenticated Encryption - AE -- 2.3 Security Notion for AE -- 3 Parazoa Family -- 3.1 Compression Function f -- 3.2 Extraction Function g -- 3.3 Finalization Function fin -- 3.4 Padding Function pad -- 3.5 Indifferentiability of Parazoa Functions -- 4 Practical Parazoa Hash - PPH -- 4.1 Compression Function fp -- 4.2 Extraction Function gp -- 4.3 Indifferentiability Bound of PPH -- 5 Practical Parazoa Authenticated Encryption Family (PPAE) -- 5.1 Description -- 6 PPAE Security -- 6.1 PPAE: Privacy -- 6.2 PPAE: Authenticity -- 7 Examples -- 7.1 Keyak -- 8 Conclusion -- References -- Encryption and Identification -- Lightweight Anonymous Authentication for Ad Hoc Group: A Ring Signature Approach -- 1 Introduction -- 1.1 Our Contributions -- 2 Definitions -- 2.1 Complexity Assumption -- 2.2 Security Model -- 3 The Proposed Scheme -- 3.1 Construction -- 3.2 Security Analysis -- 4 Efficiency Analysis -- 4.1 Comparison of Existing Ring Signatures -- 4.2 Running Time -- 5 Conclusion -- References -- Reset-Secure Identity-Based Identification Schemes Without Pairings -- 1 Introduction -- 1.1 Motivations -- 1.2 Related Work -- 1.3 Contributions -- 2 Preliminaries -- 2.1 Discrete Logarithm Assumption -- 2.2 One-More Discrete Logarithm Assumption -- 2.3 (Reset-Secure) Identity-Based Identification Schemes -- 2.4 The Pedersen Trapdoor Commitment Scheme -- 2.5 Pseudorandom Functions -- 2.6 Collision-Resistant Hash Function -- 3 Construction of the Schnorr-RS-IBI Scheme -- 4 Security Analysis for Schnorr-RS-IBI -- 5 Construction of the Twin-Schnorr-RS-IBI Scheme -- 6 Security Analysis for Twin-Schnorr-RS-IBI -- 7 Efficiency Analysis -- 8 Extension to Concurrent-Reset-2 Security -- A Choices of H2 (and H3). A.1 Collision-Resistant Hash H2 (and H3) -- A.2 Pseudorandom Functions (PRFs) -- References -- Attribute-Based Encryption for Finite Automata from LWE -- 1 Introduction -- 1.1 Our Results -- 1.2 Related Work -- 2 Preliminaries -- 2.1 An Overview of Deterministic Finite Automata -- 2.2 Definitions of ABE System for DFAs -- 3 Lattices -- 3.1 Integer Lattices -- 3.2 Trapdoors of Lattices and Discrete Gaussians -- 3.3 The LWE Hardness Assumption -- 4 Attribute-Based Encryption for DFAs -- 4.1 Construction -- 4.2 Proof of Security -- 5 Efficiency and Further Discussion -- 5.1 Efficiency -- 5.2 Discussion -- 6 Conclusion -- A Parameters and Correctness of Construction -- References -- Functional Signcryption: Notion, Construction, and Applications -- 1 Introduction -- 2 Preliminaries -- 2.1 Indistinguishability Obfuscation -- 2.2 Statistically Simulation-Sound Non-interactive Zero-Knowledge Proof of Knowledge -- 3 The Notion of Functional Signcryption -- 4 Our FSC Scheme -- 4.1 Construction -- 4.2 Security Analysis -- 5 Attribute-Based Signcryption (ABSC) for General Circuits from FSC -- 5.1 The Notion of ABSC for General Circuits -- 5.2 Our Key-Policy ABSC Scheme -- 6 Other Cryptographic Primitives from FSC -- 7 Conclusion -- References -- Privacy and Cloud -- BetterTimes -- 1 Introduction -- 1.1 Exploits for Proximity Protocols -- 2 Background -- 3 Arithmetic Formulas Through Assured Multiplication -- 3.1 Privacy-Assured Outsourced Multiplication -- 3.2 Privacy-Assured Arithmetic Formulas -- 4 Security Guarantees -- 5 Evaluation -- 6 Related Work -- 7 Conclusions -- A A Concrete Instantiation to Secure Hallgren et al. -- B Visualization of Privacy-Preserving Arithmetic Formula -- References -- Provably Secure Identity Based Provable Data Possession -- 1 Introduction -- 2 Models and Assumptions -- 2.1 System Model for ID-PDP -- 2.2 Security Model. 3 A Generic Construction of ID-PDP. |
| Record Nr. | UNINA-9910483559603321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
