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.
Information security [[electronic resource] ] : opportunities exist for the Federal Housing Finance Agency to improve controls : report to the Acting Director of the Federal Housing Finance Agency
| Information security [[electronic resource] ] : opportunities exist for the Federal Housing Finance Agency to improve controls : report to the Acting Director of the Federal Housing Finance Agency |
| Pubbl/distr/stampa | [Washington, D.C.] : , : U.S. Govt. Accountability Office, , [2010] |
| Descrizione fisica | 1 online resource (i, 26 pages) : illustrations |
| Soggetto topico |
Administrative agencies - Information technology - Security measures - United States
Computer security Data protection Computer systems - Access control |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Altri titoli varianti | Information security |
| Record Nr. | UNINA-9910699940403321 |
| [Washington, D.C.] : , : U.S. Govt. Accountability Office, , [2010] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Information security theory and practice : smart devices, pervasive systems, and ubiquitous networks : third IFIP WG 11.2 International Workshop, WISTP 2009, Brussels, Belgium, September 1-4, 2009 : proceedings / / Olivier Markowitch ... [et al.] (eds.)
| Information security theory and practice : smart devices, pervasive systems, and ubiquitous networks : third IFIP WG 11.2 International Workshop, WISTP 2009, Brussels, Belgium, September 1-4, 2009 : proceedings / / Olivier Markowitch ... [et al.] (eds.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2009 |
| Descrizione fisica | 1 online resource (XII, 167 p.) |
| Disciplina | 005.8 |
| Altri autori (Persone) | MarkowitchOlivier |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 4, Security and cryptology |
| Soggetto topico |
Data protection
Computer systems - Access control Smart cards Mobile computing - Security measures Ubiquitous computing - Security measures |
| ISBN | 3-642-03944-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Mobility -- On the Unobservability of a Trust Relation in Mobile Ad Hoc Networks -- A Mechanism to Avoid Collusion Attacks Based on Code Passing in Mobile Agent Systems -- Privacy-Aware Location Database Service for Granular Queries -- Attacks and Secure Implementations -- Algebraic Attacks on RFID Protocols -- Anti-counterfeiting Using Memory Spots -- On Second-Order Fault Analysis Resistance for CRT-RSA Implementations -- Performance and Security -- Measurement Analysis When Benchmarking Java Card Platforms -- Performance Issues of Selective Disclosure and Blinded Issuing Protocols on Java Card -- Energy-Efficient Implementation of ECDH Key Exchange for Wireless Sensor Networks -- Cryptography -- Key Management Schemes for Peer-to-Peer Multimedia Streaming Overlay Networks -- Ultra-Lightweight Key Predistribution in Wireless Sensor Networks for Monitoring Linear Infrastructure -- PKIX Certificate Status in Hybrid MANETs. |
| Altri titoli varianti |
WISTP 2009
IFIP WG 11.2 International Workshop, WISTP 2009 |
| Record Nr. | UNINA-9910483237203321 |
| Berlin ; ; New York, : Springer, c2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Information security theory and practices : security and privacy of pervasive systems and smart devices : 4th IFIP WG 11.2 International Workshop, WISTP 2010, Passau, Germany, April 12-14, 2010 : proceedings / / Pierangela Samarati ... [et al.], (eds.)
| Information security theory and practices : security and privacy of pervasive systems and smart devices : 4th IFIP WG 11.2 International Workshop, WISTP 2010, Passau, Germany, April 12-14, 2010 : proceedings / / Pierangela Samarati ... [et al.], (eds.) |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | New York, : Springer, 2010 |
| Descrizione fisica | 1 online resource (XIII, 386 p. 93 illus.) |
| Disciplina | 005.8 |
| Altri autori (Persone) | SamaratiPierangela |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 4, Security and cryptology |
| Soggetto topico |
Data protection
Computer systems - Access control Smart cards Mobile computing - Security measures |
| ISBN |
1-280-38621-5
9786613564139 3-642-12368-6 |
| Classificazione |
DAT 179f
DAT 260f DAT 460f DAT 465f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Embedded Security -- Efficient and Effective Buffer Overflow Protection on ARM Processors -- Efficient Entropy Estimation for Mutual Information Analysis Using B-Splines -- A Probabilistic Diffusion Scheme for Anomaly Detection on Smartphones -- A Smart Card Implementation of the McEliece PKC -- Evaluation Metrics of Physical Non-invasive Security -- Protocols -- Trust in Peer-to-Peer Content Distribution Protocols -- Generic Constructions of Biometric Identity Based Encryption Systems -- Design and Analysis of a Generalized Canvas Protocol -- Highly Constrained Embedded Systems -- Efficient Mutual Authentication for Multi-domain RFID Systems Using Distributed Signatures -- Practical Schemes for Privacy and Security Enhanced RFID -- MoteAODV – An AODV Implementation for TinyOS 2.0 -- Security -- Random Number Generation Based on Fingerprints -- Improvements of pan-European IDM Architecture to Enable Identity Delegation Based on X.509 Proxy Certificates and SAML -- Fraud Detection for Voice over IP Services on Next-Generation Networks -- Smart Card Security -- Proxy Smart Card Systems -- Can We Support Applications’ Evolution in Multi-application Smart Cards by Security-by-Contract? -- Website Credential Storage and Two-Factor Web Authentication with a Java SIM -- Algorithms -- Attribute-Based Encryption with Break-Glass -- On the Security of a Two-Factor Authentication Scheme -- The Design of Secure and Efficient P2PSIP Communication Systems -- Hardware Implementations -- Novel FPGA-Based Signature Matching for Deep Packet Inspection -- Towards Electrical, Integrated Implementations of SIMPL Systems -- A Very Compact Hardware Implementation of the KASUMI Block Cipher -- Embedded Systems -- Secure and Usable Out-Of-Band Channels for Ad Hoc Mobile Device Interactions -- Identification and Verification of Security Relevant Functions in Embedded Systems Based on Source Code Annotations and Assertions -- Security Analysis of Mobile Phones Used as OTP Generators -- An Energy-Efficient Symmetric Cryptography Based Authentication Scheme for Wireless Sensor Networks -- Anonymity/Database Security -- The Market Failure of Anonymity Services -- Exploiting Node Mobility for Coordinating Data Usage in Crisis Scenarios -- Predicting and Preventing Insider Threat in Relational Database Systems. |
| Record Nr. | UNINA-9910483105903321 |
| New York, : Springer, 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Information security theory and practices : smart cards, mobile and ubiquitous computing systems : First IFIP TC6/W G 8.8/ WG 11.2 International Workshop, WISTP 2007, Heraklion, Crete, Greece, May 9-11, 2007, proceedings / / Damien Sauveron [three others] (editors)
| Information security theory and practices : smart cards, mobile and ubiquitous computing systems : First IFIP TC6/W G 8.8/ WG 11.2 International Workshop, WISTP 2007, Heraklion, Crete, Greece, May 9-11, 2007, proceedings / / Damien Sauveron [three others] (editors) |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg ; ; New York : , : Springer-Verlag, , [2007] |
| Descrizione fisica | 1 online resource (260 p.) |
| Disciplina | 005.8 |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Data protection
Computer systems - Access control Smart cards Mobile computing - Security measures Ubiquitous computing - Security measures |
| ISBN | 3-540-72354-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Mobility -- A Smart Card Based Distributed Identity Management Infrastructure for Mobile Ad Hoc Networks -- A New Resilient Key Management Protocol for Wireless Sensor Networks -- Hardware and Cryptography I -- Efficient Use of Random Delays in Embedded Software -- Enhanced Doubling Attacks on Signed-All-Bits Set Recoding -- Privacy -- Securing the Distribution and Storage of Secrets with Trusted Platform Modules -- Distributed Certified Information Access for Mobile Devices -- Cryptography Scheme -- Linkability of Some Blind Signature Schemes -- Optimistic Non-repudiation Protocol Analysis -- Secure Remote User Authentication Scheme Using Bilinear Pairings -- Cryptanalysis of Some Proxy Signature Schemes Without Certificates -- Smart Card -- Performance Evaluation of Java Card Bytecodes -- Reverse Engineering Java Card Applets Using Power Analysis -- An Embedded System for Practical Security Analysis of Contactless Smartcards -- A Comparative Analysis of Common Threats, Vulnerabilities, Attacks and Countermeasures Within Smart Card and Wireless Sensor Network Node Technologies -- Small Devices -- Mobile Phones as Secure Gateways for Message-Based Ubiquitous Communication -- An Information Flow Verifier for Small Embedded Systems -- Survey and Benchmark of Stream Ciphers for Wireless Sensor Networks -- Hardware and Cryptography II -- Fault Attacks for CRT Based RSA: New Attacks, New Results, and New Countermeasures -- CRT RSA Algorithm Protected Against Fault Attacks -- Combinatorial Logic Circuitry as Means to Protect Low Cost Devices Against Side Channel Attacks. |
| Record Nr. | UNINA-9910483739103321 |
| Berlin ; ; Heidelberg ; ; New York : , : Springer-Verlag, , [2007] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Information security theory and practices : smart cards, mobile and ubiquitous computing systems : First IFIP TC6/W G 8.8/ WG 11.2 International Workshop, WISTP 2007, Heraklion, Crete, Greece, May 9-11, 2007, proceedings / / Damien Sauveron [three others] (editors)
| Information security theory and practices : smart cards, mobile and ubiquitous computing systems : First IFIP TC6/W G 8.8/ WG 11.2 International Workshop, WISTP 2007, Heraklion, Crete, Greece, May 9-11, 2007, proceedings / / Damien Sauveron [three others] (editors) |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg ; ; New York : , : Springer-Verlag, , [2007] |
| Descrizione fisica | 1 online resource (260 p.) |
| Disciplina | 005.8 |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Data protection
Computer systems - Access control Smart cards Mobile computing - Security measures Ubiquitous computing - Security measures |
| ISBN | 3-540-72354-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Mobility -- A Smart Card Based Distributed Identity Management Infrastructure for Mobile Ad Hoc Networks -- A New Resilient Key Management Protocol for Wireless Sensor Networks -- Hardware and Cryptography I -- Efficient Use of Random Delays in Embedded Software -- Enhanced Doubling Attacks on Signed-All-Bits Set Recoding -- Privacy -- Securing the Distribution and Storage of Secrets with Trusted Platform Modules -- Distributed Certified Information Access for Mobile Devices -- Cryptography Scheme -- Linkability of Some Blind Signature Schemes -- Optimistic Non-repudiation Protocol Analysis -- Secure Remote User Authentication Scheme Using Bilinear Pairings -- Cryptanalysis of Some Proxy Signature Schemes Without Certificates -- Smart Card -- Performance Evaluation of Java Card Bytecodes -- Reverse Engineering Java Card Applets Using Power Analysis -- An Embedded System for Practical Security Analysis of Contactless Smartcards -- A Comparative Analysis of Common Threats, Vulnerabilities, Attacks and Countermeasures Within Smart Card and Wireless Sensor Network Node Technologies -- Small Devices -- Mobile Phones as Secure Gateways for Message-Based Ubiquitous Communication -- An Information Flow Verifier for Small Embedded Systems -- Survey and Benchmark of Stream Ciphers for Wireless Sensor Networks -- Hardware and Cryptography II -- Fault Attacks for CRT Based RSA: New Attacks, New Results, and New Countermeasures -- CRT RSA Algorithm Protected Against Fault Attacks -- Combinatorial Logic Circuitry as Means to Protect Low Cost Devices Against Side Channel Attacks. |
| Record Nr. | UNISA-996465991403316 |
| Berlin ; ; Heidelberg ; ; New York : , : Springer-Verlag, , [2007] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Information security theory and practices, smart devices, convergence and next generation networks : second IFIP WG 11.2 International Workshop, WISTP 2008, Seville, Spain, May 13-16, 2008 : proceedings / / Jose A. Onieva [and three others] (eds.)
| Information security theory and practices, smart devices, convergence and next generation networks : second IFIP WG 11.2 International Workshop, WISTP 2008, Seville, Spain, May 13-16, 2008 : proceedings / / Jose A. Onieva [and three others] (eds.) |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [2008] |
| Descrizione fisica | 1 online resource (XII, 151 p.) |
| Disciplina | 005.8 |
| Collana | Security and Cryptology |
| Soggetto topico |
Smart cards
Computer systems - Access control Data protection |
| ISBN | 3-540-79966-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Smart Devices -- Untraceability of RFID Protocols -- A Graphical PIN Authentication Mechanism with Applications to Smart Cards and Low-Cost Devices -- Software Cannot Protect Software: An Argument for Dedicated Hardware in Security and a Categorization of the Trustworthiness of Information -- Network Security -- Probabilistic Identification for Hard to Classify Protocol -- A Self-certified and Sybil-Free Framework for Secure Digital Identity Domain Buildup -- Availability for DHT-Based Overlay Networks with Unidirectional Routing -- Convergence -- Network Smart Card Performing U(SIM) Functionalities in AAA Protocol Architectures -- Using TPMs to Secure Vehicular Ad-Hoc Networks (VANETs) -- Cryptography -- Algebra for Capability Based Attack Correlation -- On the BRIP Algorithms Security for RSA. |
| Record Nr. | UNINA-9910484333603321 |
| Berlin, Germany ; ; New York, New York : , : Springer, , [2008] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Information security theory and practices, smart devices, convergence and next generation networks : second IFIP WG 11.2 International Workshop, WISTP 2008, Seville, Spain, May 13-16, 2008 : proceedings / / Jose A. Onieva [and three others] (eds.)
| Information security theory and practices, smart devices, convergence and next generation networks : second IFIP WG 11.2 International Workshop, WISTP 2008, Seville, Spain, May 13-16, 2008 : proceedings / / Jose A. Onieva [and three others] (eds.) |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [2008] |
| Descrizione fisica | 1 online resource (XII, 151 p.) |
| Disciplina | 005.8 |
| Collana | Security and Cryptology |
| Soggetto topico |
Smart cards
Computer systems - Access control Data protection |
| ISBN | 3-540-79966-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Smart Devices -- Untraceability of RFID Protocols -- A Graphical PIN Authentication Mechanism with Applications to Smart Cards and Low-Cost Devices -- Software Cannot Protect Software: An Argument for Dedicated Hardware in Security and a Categorization of the Trustworthiness of Information -- Network Security -- Probabilistic Identification for Hard to Classify Protocol -- A Self-certified and Sybil-Free Framework for Secure Digital Identity Domain Buildup -- Availability for DHT-Based Overlay Networks with Unidirectional Routing -- Convergence -- Network Smart Card Performing U(SIM) Functionalities in AAA Protocol Architectures -- Using TPMs to Secure Vehicular Ad-Hoc Networks (VANETs) -- Cryptography -- Algebra for Capability Based Attack Correlation -- On the BRIP Algorithms Security for RSA. |
| Record Nr. | UNISA-996465320003316 |
| Berlin, Germany ; ; New York, New York : , : Springer, , [2008] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Progress in cryptology : VIETCRYPT 2006 : First International Conference on Cryptology in Vietnam, Hanoi, Vietnam, September 25-28, 2006 : revised selected papers / / Phong Q. Nguyen (ed.)
| Progress in cryptology : VIETCRYPT 2006 : First International Conference on Cryptology in Vietnam, Hanoi, Vietnam, September 25-28, 2006 : revised selected papers / / Phong Q. Nguyen (ed.) |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2006 |
| Descrizione fisica | 1 online resource (XI, 388 p.) |
| Disciplina | 005.8 |
| Altri autori (Persone) | NguyenPhong, Q (Phong Quang) |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 4, Security and cryptology |
| Soggetto topico |
Computer security - Vietnam
Computer systems - Access control Cryptography - Vietnam |
| ISBN | 3-540-68800-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Signatures and Lightweight Cryptography -- Probabilistic Multivariate Cryptography -- Short 2-Move Undeniable Signatures -- Searching for Compact Algorithms: cgen -- Invited Talk -- On Pairing-Based Cryptosystems -- Pairing-Based Cryptography -- A New Signature Scheme Without Random Oracles from Bilinear Pairings -- Efficient Dynamic k-Times Anonymous Authentication -- Side Channel Analysis of Practical Pairing Implementations: Which Path Is More Secure? -- Algorithmic Number Theory -- Factorization of Square-Free Integers with High Bits Known -- Scalar Multiplication on Koblitz Curves Using Double Bases -- Compressed Jacobian Coordinates for OEF -- Ring Signatures and Group Signatures -- On the Definition of Anonymity for Ring Signatures -- Escrowed Linkability of Ring Signatures and Its Applications -- Dynamic Fully Anonymous Short Group Signatures -- Hash Functions -- Formalizing Human Ignorance -- Discrete Logarithm Variants of VSH -- How to Construct Sufficient Conditions for Hash Functions -- Cryptanalysis -- Improved Fast Correlation Attack on the Shrinking and Self-shrinking Generators -- On the Internal Structure of Alpha-MAC -- A Weak Key Class of XTEA for a Related-Key Rectangle Attack -- Key Agreement and Threshold Cryptography -- Deniable Group Key Agreement -- An Ideal and Robust Threshold RSA -- Towards Provably Secure Group Key Agreement Building on Group Theory -- Public-Key Encryption -- Universally Composable Identity-Based Encryption -- Traitor Tracing for Stateful Pirate Decoders with Constant Ciphertext Rate -- Reducing the Spread of Damage of Key Exposures in Key-Insulated Encryption. |
| Altri titoli varianti |
VIETCRYPT 2006
First International Conference on Cryptology in Vietnam International Conference on Cryptology in Vietnam |
| Record Nr. | UNINA-9910484937903321 |
| Berlin ; ; New York, : Springer, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Provable and practical security : 15th international conference, ProvSec 2021, Guangzhou, China, November 5-8, 2021, proceedings / / Qiong Huang, Yu Yu, editors
| Provable and practical security : 15th international conference, ProvSec 2021, Guangzhou, China, November 5-8, 2021, proceedings / / Qiong Huang, Yu Yu, editors |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
| Descrizione fisica | 1 online resource (397 pages) |
| Disciplina | 005.8 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer security
Computer systems - Access control Cryptography |
| ISBN | 3-030-90402-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Searchable Encryption -- Public Key Based Searchable Encryption with Fine-Grained Sender Permission Control -- 1 Introduction -- 1.1 Contribution -- 1.2 Organization -- 2 Related Work -- 3 Preliminaries -- 3.1 Notations -- 3.2 Bilinear Maps -- 3.3 Hardness Assumption -- 3.4 Linear Secret-Sharing Schemes -- 3.5 Public Key Tree (PKTree) -- 4 Definition of SCPEKS -- 4.1 System Model -- 4.2 Definition of Algorithm -- 4.3 Security Model -- 5 Construction of SCPEKS -- 6 Security Proof and Experimental Evaluation -- 6.1 Security Proof -- 6.2 Performance Analysis -- 7 Conclusion -- References -- Improved Security Model for Public-Key Authenticated Encryption with Keyword Search -- 1 Introduction -- 2 Preliminaries -- 2.1 Bilinear Map -- 2.2 Complexity Assumptions -- 2.3 The Syntax of PAEKS -- 3 Improved CI-Security Model of PAEKS -- 3.1 Fully (M)CI-Security Model -- 3.2 TI-Security Model -- 4 Security Analysis of Previous PAEKS Schemes -- 5 New PAEKS Scheme -- 6 Efficiency Evaluation -- 7 Conclusion -- References -- Public Key Encryption with Fuzzy Matching -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Work -- 1.3 Paper Organization -- 2 Preliminaries -- 2.1 Decisional Diffie-Hellman (DDH) Assumption -- 2.2 Symmetric External Diffie-Hellman (SXDH) Assumption -- 2.3 Split Function -- 2.4 Edit Distance -- 2.5 Similarity Function -- 3 Public Key Encryption with Fuzzy Matching -- 3.1 Definition -- 3.2 Security Threats -- 4 Our PKEFM Scheme -- 5 Improved Construction Supporting Decryption and Wildcards -- 5.1 Decryption Algorithm -- 5.2 Edit Distance with Encrypted Wildcard -- 5.3 An Improved Construction Supporting Wildcards -- 5.4 Security Discussion -- 6 Performance Evaluation -- 7 Applications -- 8 Conclusion -- A Security Models -- B Security Analysis -- B.1 Ciphertext Indistinguishability.
B.2 Unlinkability -- References -- Partitioned Searchable Encryption -- 1 Introduction -- 1.1 Our Results -- 2 Preliminaries -- 2.1 Searchable Encryption -- 2.2 Bloom Filters -- 3 Partitioned Symmetric Searchable Encryption -- 3.1 Dealing with Malicious Users -- 4 PSSE Instantiations from FE and Trapdoor Permutation Using BF -- 4.1 A PSSE Scheme from FE -- 4.2 PSSE from Trapdoor Permutation: PSSE from oo -- 4.3 Dealing with Malicious Users -- 5 Conclusion -- References -- Key Exchange and Zero Knowledge Proof -- Key Exposure Resistant Group Key Agreement Protocol -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Organization -- 2 Related Works -- 3 Preliminaries -- 3.1 Homomorphic Encryption -- 3.2 Secret Sharing Scheme -- 3.3 The Group Key Agreement Protocol -- 3.4 Notations -- 4 The Proposed Protocol -- 4.1 The Basic Protocol -- 4.2 The Enhanced Protocol -- 5 Security and Performance Analyses -- 5.1 Security Analysis -- 5.2 Performance Analysis -- 6 Conclusion -- References -- NIKE from Affine Determinant Programs -- 1 Introduction -- 1.1 Prior Work on NIKE -- 1.2 Our Result and Techniques -- 2 Background -- 2.1 Randomized Encodings -- 2.2 Multi-party Non-interactive Key-Exchange -- 2.3 Affine Determinant Programs -- 3 Warm-Up: ADP from Randomized Encodings -- 3.1 Randomized Encodings via Branching Programs -- 3.2 Augmenting NC1 Branching Programs for Keyed Functions -- 3.3 ADPs for Keyed Functions from RE -- 4 Multi-party NIKE via ADP -- 4.1 Our NIKE Scheme -- 4.2 Security from IND-Secure ADP -- 5 Sufficiency Conditions for IND-Secure ADP -- 5.1 Admissible Classes of Functions for Matrix-Based ADPs -- 5.2 Our Claim -- References -- OrBit: OR-Proof Identity-Based Identification with Tight Security for (as Low As) 1-Bit Loss -- 1 Identity-Based Identification -- 2 Intuitive View of IBI IMP-CA Security Reduction -- 3 Preliminaries. 3.1 Security Model -- 3.2 Security Assumptions -- 3.3 Homomorphic Trapdoor Sampleable Relations, Honest Verifier Zero Knowledge and 1-2 Oblivious Transfer Protocols -- 4 OB1: IMP-CA IBI Schemes from OR-Proof and HTSR -- 4.1 Application of the Framework -- 4.2 Improving the Security of BLS-IBI -- 4.3 Comparison with Existing IBI Frameworks for IMP-CA Security -- 5 OB2: Tight IMP-CA IBI Scheme from OR-Proof and 1-2 OT -- 5.1 Comparison with Existing Schnorr-Based IBI Schemes -- 6 Conclusion -- References -- Card-Based Zero-Knowledge Proof Protocols for Graph Problems and Their Computational Model -- 1 Introduction -- 1.1 Existing Physical ZKP Protocols -- 1.2 Contribution -- 2 Preliminaries -- 2.1 A Deck of Cards -- 2.2 Pile-Scramble Shuffle -- 2.3 Known Physical Protocol for 3-Coloring Problem ch8Goldreich91 -- 2.4 Graph Isomorphism Problem -- 3 Card-Based ZKP for 3-Coloring Problem -- 4 Card-Based ZKP for Graph Isomorphism Problem -- 4.1 Idea -- 4.2 Description -- 5 Basic Formalization of Card-Based ZKP Protocols -- 5.1 Witness Subsequence -- 5.2 Input to Protocol -- 5.3 Abstract Protocol for ZKP -- 5.4 Properties of ZKP -- 6 Proof of ZKP Properties for Our Protocols -- 6.1 3-Coloring Problem -- 6.2 Graph Isomorphism Problem -- 7 Conclusion -- References -- Post Quantum Cryptography -- Recovery Attack on Bob's Reused Randomness in CRYSTALS-KYBER and SABER -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Related Works -- 1.3 Roadmap -- 2 Preliminary -- 2.1 Mathematical Notations -- 2.2 CRYSTALS-KYBER ch9BDKLLSSSS18 -- 2.3 SABER ch9DKRV18 -- 2.4 Wang et al.'s Proposition -- 3 Our Proposed Attack -- 3.1 General Attack Model -- 3.2 Key Reuse Attack on CRYSTALS-KYBER -- 3.3 Key Reuse Attack on SABER -- 4 Experiments -- 5 Conclusion and Discussion -- A Plots of Experimental Results -- References -- A Lattice Reduction Algorithm Based on Sublattice BKZ. 1 Introduction -- 1.1 Background -- 1.2 Related Work -- 1.3 Our Contribution -- 1.4 Outline -- 2 Preliminaries -- 2.1 Lattice -- 2.2 Lattice Reduction Algorithms -- 3 Sublattice Reduction -- 3.1 Determinant of Sublattice -- 3.2 Basis Reduction on Sublattice -- 4 m-SubBKZ Reduction -- 4.1 Basic Algorithm -- 4.2 A Practical SubBKZ Variant -- 5 Implementation and Experiment -- 5.1 Implementation Details -- 5.2 Experimental Results -- 6 Conclusion -- References -- On the (M)iNTRU Assumption in the Integer Case -- 1 Introduction -- 1.1 Contribution 1: Breaking the Integer iNTRU Assumption -- 1.2 Contribution 2: Generalizing the One-Dimensional Attack to the MiNTRU Assumption -- 1.3 Disclaimer 1 -- 1.4 Disclaimer 2 -- 1.5 Paper Organization -- 2 Preliminaries -- 2.1 Notations -- 2.2 Lattice Preliminaries -- 3 The iNTRU Assumption -- 3.1 The iNTRU Assumption -- 3.2 Further Remarks -- 3.3 Applications -- 3.4 Our Contribution -- 4 Attacking the iNTRU Assumption - First Approach -- 4.1 Our First Lattice and Its Properties -- 4.2 Case of a Random Tuple -- 4.3 Case of a Synthetic Tuple -- 4.4 Conclusion -- 5 Attacking the iNTRU Assumption - Second Approach -- 5.1 Our Second Lattice and Its Properties -- 5.2 Case of a Random Tuple -- 5.3 Case of a Synthetic Tuple -- 5.4 Conclusion -- 6 Generalizing Our Attacks -- 6.1 iNTRU - The General Case -- 6.2 MiNTRU -- 7 Conclusion -- A Proof of Lemma 1 -- References -- Functional Encryption -- Verifiable Functional Encryption Using Intel SGX -- 1 Introduction -- 2 Preliminaries -- 3 Impossibility Result of VFE -- 4 Definitions of VFE-HW -- 5 Proposed Scheme -- 6 Security Analysis -- 6.1 Weak Verifiability -- 6.2 Simulation Security -- 7 Implementation -- 8 Conclusion -- A The Nieto et al. VPKE Scheme -- References -- Fully Secure Unbounded Zero Inner Product Encryption with Short Ciphertexts and Keys -- 1 Introduction. 2 Preliminaries -- 2.1 Basic Notions -- 3 Our UZIPE -- 3.1 Security -- 4 Conclusion -- References -- Inner-Product Functional Encryption from Random Linear Codes: Trial and Challenges -- 1 Introduction -- 2 Preliminaries -- 2.1 Notation and Conventions -- 2.2 Linear Codes -- 2.3 Hard Problems in Coding Theory -- 3 Functional Encryption -- 4 The Basic Idea of Constructing Inner-Product Encryption Scheme -- 4.1 Basic-IPFEc Scheme -- 4.2 Security Analysis -- 5 The Full Scheme -- 5.1 The Presentation of the Full Scheme -- 5.2 Correctness -- 5.3 Security -- 6 Conclusion -- References -- Digital Signature -- A CCA-Full-Anonymous Group Signature with Verifiable Controllable Linkability in the Standard Model -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Related Work -- 1.3 Comparison -- 2 Preliminaries -- 2.1 Mathematical Preliminaries -- 2.2 Sign-Encrypt-Proof Paradigm and Efficient Non-interactive Proofs for Bilinear Groups -- 3 Group Signatures with Verifiable Controllable Linkability -- 4 Structure Preserving Public Key Encryption with Equality Test -- 4.1 Definition -- 4.2 Security Models for SP-PKEET -- 4.3 Construction -- 5 A CCA-Full-Anonymous Group Signature with Verifiable Controllable Linkability -- 5.1 Adding the VCL Property -- 5.2 Making Use of SP-PKEET -- 5.3 Our Concrete Instantiation -- 5.4 Security Analysis -- 6 Conclusion -- References -- Cryptanalysis of LRainbow: The Lifted Rainbow Signature Scheme -- 1 Introduction -- 1.1 Our Contribution -- 2 Preliminaries -- 2.1 Multivariate Signature Scheme -- 2.2 Hardness Assumption -- 2.3 Rainbow Signature Scheme ch16ding2005rainbow -- 2.4 LRainbow: Lifting the Field for Rainbow ch16lr -- 3 Proposed Attack on LRainbow -- 3.1 General Idea of the Attack: A High Level Overview -- 3.2 Existence of Small Subfields L2 -- 3.3 Method of Finding w and Forging the Signature -- 4 Complexity of the Attack. 4.1 Preliminaries: Approach by Thomae and Wolf ch16Thomae2012SolvingUS. |
| Record Nr. | UNINA-9910508454703321 |
| Cham, Switzerland : , : Springer, , [2021] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Provable and practical security : 15th international conference, ProvSec 2021, Guangzhou, China, November 5-8, 2021, proceedings / / Qiong Huang, Yu Yu, editors
| Provable and practical security : 15th international conference, ProvSec 2021, Guangzhou, China, November 5-8, 2021, proceedings / / Qiong Huang, Yu Yu, editors |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
| Descrizione fisica | 1 online resource (397 pages) |
| Disciplina | 005.8 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer security
Computer systems - Access control Cryptography |
| ISBN | 3-030-90402-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Searchable Encryption -- Public Key Based Searchable Encryption with Fine-Grained Sender Permission Control -- 1 Introduction -- 1.1 Contribution -- 1.2 Organization -- 2 Related Work -- 3 Preliminaries -- 3.1 Notations -- 3.2 Bilinear Maps -- 3.3 Hardness Assumption -- 3.4 Linear Secret-Sharing Schemes -- 3.5 Public Key Tree (PKTree) -- 4 Definition of SCPEKS -- 4.1 System Model -- 4.2 Definition of Algorithm -- 4.3 Security Model -- 5 Construction of SCPEKS -- 6 Security Proof and Experimental Evaluation -- 6.1 Security Proof -- 6.2 Performance Analysis -- 7 Conclusion -- References -- Improved Security Model for Public-Key Authenticated Encryption with Keyword Search -- 1 Introduction -- 2 Preliminaries -- 2.1 Bilinear Map -- 2.2 Complexity Assumptions -- 2.3 The Syntax of PAEKS -- 3 Improved CI-Security Model of PAEKS -- 3.1 Fully (M)CI-Security Model -- 3.2 TI-Security Model -- 4 Security Analysis of Previous PAEKS Schemes -- 5 New PAEKS Scheme -- 6 Efficiency Evaluation -- 7 Conclusion -- References -- Public Key Encryption with Fuzzy Matching -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Work -- 1.3 Paper Organization -- 2 Preliminaries -- 2.1 Decisional Diffie-Hellman (DDH) Assumption -- 2.2 Symmetric External Diffie-Hellman (SXDH) Assumption -- 2.3 Split Function -- 2.4 Edit Distance -- 2.5 Similarity Function -- 3 Public Key Encryption with Fuzzy Matching -- 3.1 Definition -- 3.2 Security Threats -- 4 Our PKEFM Scheme -- 5 Improved Construction Supporting Decryption and Wildcards -- 5.1 Decryption Algorithm -- 5.2 Edit Distance with Encrypted Wildcard -- 5.3 An Improved Construction Supporting Wildcards -- 5.4 Security Discussion -- 6 Performance Evaluation -- 7 Applications -- 8 Conclusion -- A Security Models -- B Security Analysis -- B.1 Ciphertext Indistinguishability.
B.2 Unlinkability -- References -- Partitioned Searchable Encryption -- 1 Introduction -- 1.1 Our Results -- 2 Preliminaries -- 2.1 Searchable Encryption -- 2.2 Bloom Filters -- 3 Partitioned Symmetric Searchable Encryption -- 3.1 Dealing with Malicious Users -- 4 PSSE Instantiations from FE and Trapdoor Permutation Using BF -- 4.1 A PSSE Scheme from FE -- 4.2 PSSE from Trapdoor Permutation: PSSE from oo -- 4.3 Dealing with Malicious Users -- 5 Conclusion -- References -- Key Exchange and Zero Knowledge Proof -- Key Exposure Resistant Group Key Agreement Protocol -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Organization -- 2 Related Works -- 3 Preliminaries -- 3.1 Homomorphic Encryption -- 3.2 Secret Sharing Scheme -- 3.3 The Group Key Agreement Protocol -- 3.4 Notations -- 4 The Proposed Protocol -- 4.1 The Basic Protocol -- 4.2 The Enhanced Protocol -- 5 Security and Performance Analyses -- 5.1 Security Analysis -- 5.2 Performance Analysis -- 6 Conclusion -- References -- NIKE from Affine Determinant Programs -- 1 Introduction -- 1.1 Prior Work on NIKE -- 1.2 Our Result and Techniques -- 2 Background -- 2.1 Randomized Encodings -- 2.2 Multi-party Non-interactive Key-Exchange -- 2.3 Affine Determinant Programs -- 3 Warm-Up: ADP from Randomized Encodings -- 3.1 Randomized Encodings via Branching Programs -- 3.2 Augmenting NC1 Branching Programs for Keyed Functions -- 3.3 ADPs for Keyed Functions from RE -- 4 Multi-party NIKE via ADP -- 4.1 Our NIKE Scheme -- 4.2 Security from IND-Secure ADP -- 5 Sufficiency Conditions for IND-Secure ADP -- 5.1 Admissible Classes of Functions for Matrix-Based ADPs -- 5.2 Our Claim -- References -- OrBit: OR-Proof Identity-Based Identification with Tight Security for (as Low As) 1-Bit Loss -- 1 Identity-Based Identification -- 2 Intuitive View of IBI IMP-CA Security Reduction -- 3 Preliminaries. 3.1 Security Model -- 3.2 Security Assumptions -- 3.3 Homomorphic Trapdoor Sampleable Relations, Honest Verifier Zero Knowledge and 1-2 Oblivious Transfer Protocols -- 4 OB1: IMP-CA IBI Schemes from OR-Proof and HTSR -- 4.1 Application of the Framework -- 4.2 Improving the Security of BLS-IBI -- 4.3 Comparison with Existing IBI Frameworks for IMP-CA Security -- 5 OB2: Tight IMP-CA IBI Scheme from OR-Proof and 1-2 OT -- 5.1 Comparison with Existing Schnorr-Based IBI Schemes -- 6 Conclusion -- References -- Card-Based Zero-Knowledge Proof Protocols for Graph Problems and Their Computational Model -- 1 Introduction -- 1.1 Existing Physical ZKP Protocols -- 1.2 Contribution -- 2 Preliminaries -- 2.1 A Deck of Cards -- 2.2 Pile-Scramble Shuffle -- 2.3 Known Physical Protocol for 3-Coloring Problem ch8Goldreich91 -- 2.4 Graph Isomorphism Problem -- 3 Card-Based ZKP for 3-Coloring Problem -- 4 Card-Based ZKP for Graph Isomorphism Problem -- 4.1 Idea -- 4.2 Description -- 5 Basic Formalization of Card-Based ZKP Protocols -- 5.1 Witness Subsequence -- 5.2 Input to Protocol -- 5.3 Abstract Protocol for ZKP -- 5.4 Properties of ZKP -- 6 Proof of ZKP Properties for Our Protocols -- 6.1 3-Coloring Problem -- 6.2 Graph Isomorphism Problem -- 7 Conclusion -- References -- Post Quantum Cryptography -- Recovery Attack on Bob's Reused Randomness in CRYSTALS-KYBER and SABER -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Related Works -- 1.3 Roadmap -- 2 Preliminary -- 2.1 Mathematical Notations -- 2.2 CRYSTALS-KYBER ch9BDKLLSSSS18 -- 2.3 SABER ch9DKRV18 -- 2.4 Wang et al.'s Proposition -- 3 Our Proposed Attack -- 3.1 General Attack Model -- 3.2 Key Reuse Attack on CRYSTALS-KYBER -- 3.3 Key Reuse Attack on SABER -- 4 Experiments -- 5 Conclusion and Discussion -- A Plots of Experimental Results -- References -- A Lattice Reduction Algorithm Based on Sublattice BKZ. 1 Introduction -- 1.1 Background -- 1.2 Related Work -- 1.3 Our Contribution -- 1.4 Outline -- 2 Preliminaries -- 2.1 Lattice -- 2.2 Lattice Reduction Algorithms -- 3 Sublattice Reduction -- 3.1 Determinant of Sublattice -- 3.2 Basis Reduction on Sublattice -- 4 m-SubBKZ Reduction -- 4.1 Basic Algorithm -- 4.2 A Practical SubBKZ Variant -- 5 Implementation and Experiment -- 5.1 Implementation Details -- 5.2 Experimental Results -- 6 Conclusion -- References -- On the (M)iNTRU Assumption in the Integer Case -- 1 Introduction -- 1.1 Contribution 1: Breaking the Integer iNTRU Assumption -- 1.2 Contribution 2: Generalizing the One-Dimensional Attack to the MiNTRU Assumption -- 1.3 Disclaimer 1 -- 1.4 Disclaimer 2 -- 1.5 Paper Organization -- 2 Preliminaries -- 2.1 Notations -- 2.2 Lattice Preliminaries -- 3 The iNTRU Assumption -- 3.1 The iNTRU Assumption -- 3.2 Further Remarks -- 3.3 Applications -- 3.4 Our Contribution -- 4 Attacking the iNTRU Assumption - First Approach -- 4.1 Our First Lattice and Its Properties -- 4.2 Case of a Random Tuple -- 4.3 Case of a Synthetic Tuple -- 4.4 Conclusion -- 5 Attacking the iNTRU Assumption - Second Approach -- 5.1 Our Second Lattice and Its Properties -- 5.2 Case of a Random Tuple -- 5.3 Case of a Synthetic Tuple -- 5.4 Conclusion -- 6 Generalizing Our Attacks -- 6.1 iNTRU - The General Case -- 6.2 MiNTRU -- 7 Conclusion -- A Proof of Lemma 1 -- References -- Functional Encryption -- Verifiable Functional Encryption Using Intel SGX -- 1 Introduction -- 2 Preliminaries -- 3 Impossibility Result of VFE -- 4 Definitions of VFE-HW -- 5 Proposed Scheme -- 6 Security Analysis -- 6.1 Weak Verifiability -- 6.2 Simulation Security -- 7 Implementation -- 8 Conclusion -- A The Nieto et al. VPKE Scheme -- References -- Fully Secure Unbounded Zero Inner Product Encryption with Short Ciphertexts and Keys -- 1 Introduction. 2 Preliminaries -- 2.1 Basic Notions -- 3 Our UZIPE -- 3.1 Security -- 4 Conclusion -- References -- Inner-Product Functional Encryption from Random Linear Codes: Trial and Challenges -- 1 Introduction -- 2 Preliminaries -- 2.1 Notation and Conventions -- 2.2 Linear Codes -- 2.3 Hard Problems in Coding Theory -- 3 Functional Encryption -- 4 The Basic Idea of Constructing Inner-Product Encryption Scheme -- 4.1 Basic-IPFEc Scheme -- 4.2 Security Analysis -- 5 The Full Scheme -- 5.1 The Presentation of the Full Scheme -- 5.2 Correctness -- 5.3 Security -- 6 Conclusion -- References -- Digital Signature -- A CCA-Full-Anonymous Group Signature with Verifiable Controllable Linkability in the Standard Model -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Related Work -- 1.3 Comparison -- 2 Preliminaries -- 2.1 Mathematical Preliminaries -- 2.2 Sign-Encrypt-Proof Paradigm and Efficient Non-interactive Proofs for Bilinear Groups -- 3 Group Signatures with Verifiable Controllable Linkability -- 4 Structure Preserving Public Key Encryption with Equality Test -- 4.1 Definition -- 4.2 Security Models for SP-PKEET -- 4.3 Construction -- 5 A CCA-Full-Anonymous Group Signature with Verifiable Controllable Linkability -- 5.1 Adding the VCL Property -- 5.2 Making Use of SP-PKEET -- 5.3 Our Concrete Instantiation -- 5.4 Security Analysis -- 6 Conclusion -- References -- Cryptanalysis of LRainbow: The Lifted Rainbow Signature Scheme -- 1 Introduction -- 1.1 Our Contribution -- 2 Preliminaries -- 2.1 Multivariate Signature Scheme -- 2.2 Hardness Assumption -- 2.3 Rainbow Signature Scheme ch16ding2005rainbow -- 2.4 LRainbow: Lifting the Field for Rainbow ch16lr -- 3 Proposed Attack on LRainbow -- 3.1 General Idea of the Attack: A High Level Overview -- 3.2 Existence of Small Subfields L2 -- 3.3 Method of Finding w and Forging the Signature -- 4 Complexity of the Attack. 4.1 Preliminaries: Approach by Thomae and Wolf ch16Thomae2012SolvingUS. |
| Record Nr. | UNISA-996464407003316 |
| Cham, Switzerland : , : Springer, , [2021] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
