{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":43,"n_cols":5,"rows_kept":43,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[10,2,10,3],[13,2,13,3],[22,2,22,3],[22,4,22,5],[23,2,23,3],[23,4,23,5],[24,2,24,3],[24,4,24,5],[25,2,25,3],[26,2,26,3],[29,2,29,3],[30,2,30,3],[31,2,31,3],[32,2,32,3],[36,2,36,3],[37,2,37,3],[41,2,41,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996490367903316"]
[null,null,"Titolo",null,"Security and cryptography for networks : 13th International Conference, SCN 2022, Amalfi (SA), Italy, September 12-14, 2022, proceedings / / Clemente Galdi, Stanislaw Jarecki (editors)"]
[null,null,"Pubbl/distr/stampa",null,"Cham, Switzerland : , : Springer, , [2022]"]
[{"$nulls":4},"©2022"]
[null,null,"ISBN",null,"3-031-14791-X"]
[null,null,"Descrizione fisica",null,"1 online resource (795 pages)"]
[null,null,"Collana",null,"Lecture notes in computer science ; ; 13409"]
[null,null,"Disciplina",null,"005.82"]
[null,null,"Soggetti",null,"Data encryption (Computer science)"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Intro -- Preface -- Organization -- Invited Talks -- How to Do Cryptography Even When Cryptography Doesn't Exist -- From Galactic PCP Theory to Scaling Blockchains with ZK-STARKs -- Contents -- Ciphers, Cryptanalysis, Defenses -- Decoding McEliece with a Hint - Secret Goppa Key Parts Reveal Everything -- 1 Introduction -- 2 Preliminaries -- 3 Some Parts of a Secret Goppa Key Reveal Everything -- 3.1 Key Recovery from ALL Goppa Points -- 3.2 Goppa Polynomial Recovery from only tm+1 Goppa Points -- 3.3 Reconstruction of the Remaining Goppa Points -- 3.4 Full Key Recovery from tm+1 Goppa Points -- 4 Correcting Faulty Goppa Points -- References -- Cost-Asymmetric Memory Hard Password Hashing -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Related Work -- 2 Background and Notations -- 3 Defender's Model -- 4 Attacker's Model -- 4.1 Assumptions of Economics Analysis -- 4.2 Cracking Process -- 4.3 Attacker's Utility -- 4.4 Stackelberg Game -- 5 Computing the Attacker's Optimal Strategy -- 5.1 Marginal Utility -- 5.2 A Superset of the Optimal Checking Sequence -- 5.3 Extension by Concatenation -- 5.4 Local Search in Two Directions -- 5.5 Optimality Test and Globally Optimal Checking Sequence -- 6 Defender's Optimal Strategy -- 7 Experiments -- 7.1 Experiment Setup -- 7.2 Experiment Analysis and Discussion -- 8 Conclusion -- References -- .26em plus .1em minus .1emMemory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes -- 1 Introduction -- 1.1 Our Results -- 1.2 Prior Work -- 2 Technical Overview -- 2.1 Memory-Hard Languages -- 2.2 Memory-Hard Puzzles "]
[{"$nulls":4},"-- 2.3 Memory-Hard Functions from Memory-Hard Puzzles -- 2.4 Resource-Bounded LDCs from Cryptographic Puzzles -- References -- RAMus- A New Lightweight Block Cipher for RAM Encryption -- 1 Introduction -- 2 Preliminaries."]
[{"$nulls":4},"3 The 2S-Strategy -- 3.1 Notations -- 3.2 The Round Function -- 4 The Description of RAMus -- 5 Design Rationale -- 6 Security Analysis of RAMus -- 6.1 Theoretical Proven Bound -- 6.2 SAT-Based Analysis -- 6.3 The Security of RAMus Against Integral Cryptanalysis and the Division Property Attacks -- 7 Performance -- References -- Higher-Order Masked Saber -- 1 Introduction -- 2 Preliminaries -- 2.1 Notation -- 2.2 Saber -- 2.3 uSaber -- 2.4 Fujisaki-Okamoto Transformation -- 2.5 Higher-Order Masking -- 3 Masking Saber -- 3.1 Arithmetic Operations -- 3.2 Compression -- 3.3 Masked Hashing -- 3.4 Masked Centered Binomial Sampler -- 3.5 Masked Comparison -- 4 Masking uSaber -- 5 Performance Evaluation -- 5.1 Performance Analysis of Comparison Algorithms for Saber -- 5.2 Performance Analysis for Masked Saber Decapsulation -- 5.3 Performance Analysis for Masked uSaber Decapsulation -- 5.4 Comparison with State-of-the-Art -- 6 Conclusions -- References -- Approximate Distance-Comparison-Preserving Symmetric Encryption -- 1 Introduction -- 1.1 Background and Motivation -- 1.2 Our Results -- 1.3 Discussion -- 1.4 Further Related Work -- 2 Preliminaries -- 3 Approximate Distance-Comparison-Preserving Functions and Their Properties -- 3.1 Notions Considered -- 3.2 Accuracy of Nearest Neighbors for -DCP Functions -- 3.3 Impossibility of Ideal Security -- 4 The Scale-and-Perturb (SAP) Scheme -- 4.1 Our Core -DCPE Scheme -- 4.2 Two Preprocessing Algorithms -- 5 Real-or-Replaced Indistinguishability for Neighboring Datasets -- 5.1 -RoR Security Bounds -- 6 Security Against Approximate Frequency-Finding Attacks -- 6.1 Window One-Wayness Security Notion -- 6.2 One-Wayness Bounds -- 6.3 Security Against Freq-Find Adversaries -- 7 Bit Security -- References -- Public Key Encryption -- Key-Policy ABE with Switchable Attributes -- 1 Introduction -- 1.1 Related Work."]
[{"$nulls":4},"1.2 Contributions -- 2 Preliminaries -- 2.1 Dual Pairing Vector Spaces -- 2.2 Change of Basis -- 2.3 Particular Changes -- 3 Key-Policy ABE with Switchable Attributes -- 3.1 Policy Definition -- 3.2 Labeling of Access-Trees -- 3.3 Switchable Leaves and Attributes -- 3.4 Key-Policy Attribute-Based Encapsulation with Switchable Attributes -- 3.5 Security Notions -- 4 Our SA-KP-ABE Scheme -- 4.1 Description of Our KP-ABE with Switchable Attributes -- 4.2 Del-IND-Security of Our SA-KP-ABE for Encaps -- 4.3 Del-IND-Security of Our SA-KP-ABE for Encaps* -- 4.4 Distinct Indistinguishability Properties -- 4.5 Attribute-Indistinguishability -- 5 Application to Tracing -- 6 Conclusion -- References -- Mix-Nets from Re-randomizable and Replayable CCA-Secure Public-Key Encryption -- 1 Introduction -- 1.1 Our Contribution -- 1.2 Related Work -- 2 Preliminaries -- 3 Definitions -- 4 Mix-Net -- 5 A Concrete Mix-Net Protocol from RCCA-PKE -- 5.1 Split PKE -- 5.2 A Protocol for Verify-then-Decrypt for Verifiable Split PKE -- 5.3 Our Concrete Verifiable Split PKE -- 5.4 Putting All Together -- References -- New and Improved Constructions for Partially Equivocable Public Key Encryption -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Technical Overview -- 2 Preliminaries -- 2.1 Reminders on Standard Assumptions -- 2.2 Non-Committing Encryption -- 3 PEPE Constructions -- 3.1 PEPE from LWE -- 3.2 PEPE from DDH -- 3.3 PEPE from Subgroup Decision -- References -- On Access Control Encryption Without Sanitization -- 1 Introduction -- 2 Our Results -- 2.1 Modeling ACE Without Sanitization -- 2.2 Instantiating ACEnoS and VACE -- 2.3 Concurrent Work -- 2.4 Future Directions -- 3 Access "]
[{"$nulls":4},"Control Encryption Without Sanitization -- 4 Linear ACE Without Sanitizer from PKE -- 5 Compact ACE from Hybrid Encryption -- 6 Game-Specific Obfuscation -- 7 ACE with Ciphertext Verifiability."]
[{"$nulls":4},"7.1 Ciphertext Verifiability -- 7.2 VACE from Game Specific Obfuscation -- 7.3 No Secret Write Rule of VACE -- References -- Watermarkable Public Key Encryption with Efficient Extraction Under Standard Assumptions -- 1 Introduction -- 1.1 Our Contribution -- 1.2 Technical Overview of Our Construction -- 1.3 Relations to Prior Work -- 2 Preliminaries -- 3 Watermarkable Public Key Encryption -- 4 Our Watermarkable PKE Scheme -- 5 Security Analysis -- 5.1 Encryption Correctness and IND-CPA Security -- 5.2 Extraction Correctness -- 5.3 Proving Unremovability and Unforgeability Properties -- References -- Authentication and Signatures -- A Provably Secure, Lightweight Protocol for Anonymous Authentication -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Outline of the Paper -- 2 Model and Definitions -- 2.1 Preliminaries -- 2.2 Desynchronization Resilience -- 2.3 Mutual Authentication -- 2.4 Tag Anonymity -- 3 Protocol Description -- 4 Proofs of Security -- 4.1 Mutual Authentication -- 4.2 Desynchronization Resilience -- 4.3 Tag Anonymity -- References -- Anonymous Authenticated Communication -- 1 Introduction -- 1.1 Background and Motivation -- 1.2 Related Work -- 1.3 Contributions -- 1.4 Outline -- 2 Preliminaries -- 2.1 Notation -- 2.2 Constructive Cryptography -- 2.3 Anonymous and Authentic Resources -- 3 Achieving Anonymous Authenticity -- 3.1 Game-Based Security of Bilateral Signatures -- 3.2 Composable Security of Bilateral Signatures -- 4 Achieving De-anonymizable Authenticity -- 4.1 Game-Based Security of Partial Signatures -- 4.2 Composable Security of Partial Signatures -- 5 Achieving Receiver-Side Anonymous Authenticity -- 5.1 Game-Based Security of Ring Signatures -- 5.2 Composable Security of Ring Signatures -- 6 Concluding Remarks and Future Work -- References -- Credential Transparency System -- 1 Introduction."]
[{"$nulls":4},"1.1 Definitional Framework for Diverse Credential Systems -- 2 Credential Transparency System (CTS) -- 2.1 Security Properties -- 3 CTS Construction -- 3.1 Overview of Our Construction -- 3.2 Construction Description -- 3.3 Simulation Algorithms -- 4 Security Proof -- 4.1 Intuition for the Proof of Soundness -- 4.2 Intuition for the Proof of Privacy -- References -- Cumulatively All-Lossy-But-One Trapdoor Functions from Standard Assumptions -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Technical Overview -- 1.3 Related Work -- 2 Background -- 2.1 Cumulatively All-Lossy-But-One Trapdoor Functions -- 2.2 Lattices -- 2.3 Composite Residuosity -- 3 Cumulatively All-Lossy-But-One Trapdoor Functions -- 3.1 Relaxed CALBO-TDFs from LWE -- 3.2 CALBO-TDFs from DCR -- References -- On the Related-Key Attack Security of Authenticated Encryption Schemes -- 1 Introduction -- 1.1 Our Contribution -- 1.2 Related Work -- 2 Preliminaries -- 2.1 Notation -- 2.2 Primitives -- 2.3 Security Notions Against Related-Key Attacks -- 3 RKA Security Notions for Nonce-Based AEAD -- 3.1 Nonce Selection -- 3.2 RKA-Security Notions for AEAD Schemes -- 3.3 RKA-Security Against Nonce Misuse -- 3.4 RKA-Security Notions for Encryption -- 4 RKA Security of the N1, N2, and N3 Constructions -- 4.1 N1 - Instantiation of Encrypt-and-MAC -- 4.2 N2 - Instantiation of Encrypt-then-MAC -- 4.3 N3 - Instantiation of MAC-then-Encrypt -- 5 RKA Nonce-Misuse-Resistant AEAD -- References -- The State of the Union: Union-Only Signatures for Data Aggregation -- 1 Introduction -- 2 Syntax -- 3 Security Definitions -- 3.1 Notation -- 3.2 Unforgeability -- 3.3 History Hiding -- 4 A UOS Scheme -- 4.1 Initial Construction -- 4.2 Secure Variant from Groups of Unknown Order -- 4.3 Secure Variant from Lattices -- 4.4 Security "]
[{"$nulls":4},"Analysis -- 5 Performance -- 6 Conclusion -- References."]
[{"$nulls":4},"Traceable Constant-Size Multi-authority Credentials."]
[null,"2.","Record Nr.",null,"UNINA9910777414603321"]
[null,null,"Autore",null,"Liddick Don"]
[null,null,"Titolo",null,"The global underworld [[electronic resource] ] : transnational crime and the United States / / Donald R. Liddick"]
[null,null,"Pubbl/distr/stampa",null,"Westport, Conn., : Praeger, 2004"]
[null,null,"ISBN",null,"1-282-40829-1"]
[{"$nulls":4},"9786612408298"]
[{"$nulls":4},"0-313-05198-4"]
[null,null,"Descrizione fisica",null,"1 online resource (170 p.)"]
[null,null,"Collana",null,"International and comparative criminology"]
[null,null,"Disciplina",null,"364.1/06/0973"]
[null,null,"Soggetti",null,"Transnational crime"]
[{"$nulls":4},"Organized crime"]
[{"$nulls":4},"Organized crime - United States"]
[{"$nulls":4},"Transnational crime - United States - Prevention"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references (p. [147]-154) and index."]
[null,null,"Nota di contenuto",null,"Contents; Chapter 1 Introduction and Overview; Chapter 2 Principal Transnational Crime Groups Affecting the United States and Canada; Chapter 3 Smuggling, Transnational Theft, and \"\"Eco-Crime\"\"; Chapter 4 Money Laundering and Other Financial Crimes; Chapter 5 Terrorism and Weapons of Mass Destruction; Chapter 6 Responding to Transnational Organized Crime; Chapter 7 Summary and Conclusion; Notes; Selected Bibliography; Index"]
[null,null,null,"Sommario/riassunto","Transnational crime is an increasing national security threat to the United States and to individual citizens around the world. Criminal groups both in the United Staes and abroad operate crime cartels that span national boundaries, but in ways that affect all Americans, and wreak havoc on law enforcement organizations as well as businesses and other entities, such as the stock market. More often than not, transnational crime takes the form of organized crime, and in its many forms is responsible for over-priced goods, unsafe products, environmental hazards, corruption of public officials, the"]