{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":6,"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":102,"n_cols":5,"rows_kept":102,"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],[2,4,2,5],[3,2,3,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],[12,2,12,3],[13,2,13,3],[15,2,15,3],[15,4,15,5],[16,2,16,3],[16,4,16,5],[17,2,17,3],[17,4,17,5],[18,2,18,3],[19,2,19,3],[20,2,20,3],[21,2,21,3],[27,2,27,3],[27,4,27,5],[28,2,28,3],[28,4,28,5],[29,2,29,3],[31,2,31,3],[32,2,32,3],[33,2,33,3],[34,2,34,3],[35,2,35,3],[37,2,37,3],[38,2,38,3],[41,2,41,3],[50,2,50,3],[50,4,50,5],[51,2,51,3],[51,4,51,5],[52,2,52,3],[52,4,52,5],[53,2,53,3],[54,2,54,3],[55,2,55,3],[56,2,56,3],[59,2,59,3],[60,2,60,3],[63,2,63,3],[63,4,63,5],[64,2,64,3],[64,4,64,5],[65,2,65,3],[65,4,65,5],[66,2,66,3],[67,2,67,3],[68,2,68,3],[69,2,69,3],[70,2,70,3],[71,2,71,3],[73,2,73,3],[74,2,74,3],[75,2,75,3],[76,2,76,3],[78,2,78,3],[78,4,78,5],[79,2,79,3],[79,4,79,5],[80,2,80,3],[83,2,83,3],[84,2,84,3],[85,2,85,3],[86,2,86,3],[98,2,98,3],[99,2,99,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA990000527510203316"]
[null,null,"Autore",null,"DE GREGORIO, Vincenzo"]
[null,null,"Titolo",null,"La Biblioteca Casanatense di Roma / Vincenzo De Gregorio"]
[null,null,"Pubbl/distr/stampa",null,"Napoli [etc.], : Edizioni scientifiche italiane, 1993"]
[null,null,"ISBN",null,"88-7104-781-8"]
[null,null,"Descrizione fisica",null,"354 p. ; 24 cm"]
[null,null,"Collana",null,"Pubblicazioni dell'Università degli studi di Salerno , Sezione di studi filologici, letterari e artistici ; 23"]
[null,null,"Disciplina",null,"027.545632"]
[null,null,"Soggetti",null,"Biblioteca Casanatense - Storia"]
[null,null,"Collocazione",null,"XXX.A. Coll. 230/ 23"]
[{"$nulls":4},"I.2.B. 35(Varie Coll. 684/23)"]
[{"$nulls":4},"I.2.B. 35a(Varie Coll. 684/23 bis)"]
[null,null,"Lingua di pubblicazione",null,"Italiano"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,"2.","Record Nr.",null,"UNISA996388909503316"]
[null,null,"Autore",null,"Tymme Thomas <d. 1620.>"]
[null,null,"Titolo",null,"The poore mans Pater noster [[electronic resource] ] : with a preparatiue to praier: wherto are annexed diuers godly psalmes and meditations: collected out of the sacred scriptures, by Thomas Timme minister"]
[null,null,"Pubbl/distr/stampa",null,"[London], : Newly imprinted the second time by Peter Short, dwelling on Bredstreet hill, at the signe of the Starre, 1598"]
[null,null,"Descrizione fisica",null,"[258] p"]
[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","With a final colophon leaf."]
[{"$nulls":4},"Signatures: A-Q [chi]Â¹."]
[{"$nulls":4},"Reproduction of the original in the British Library."]
[null,null,null,"Sommario/riassunto","eebo-0018"]
[null,"3.","Record Nr.",null,"UNISA996503468703316"]
[null,null,"Titolo",null,"Theory of cryptography : 20th international conference, TCC 2022, Chicago, IL, USA, November 7-10, 2022, proceedings, Part II / / edited by Eike Kiltz and Vinod Vaikuntanathan"]
[null,null,"Pubbl/distr/stampa",null,"Cham, Switzerland : , : Springer, , [2023]"]
[{"$nulls":4},"©2023"]
[null,null,"ISBN",null,"3-031-22365-9"]
[null,null,"Descrizione fisica",null,"1 online resource (813 pages)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science ; ; v.13748"]
[null,null,"Disciplina",null,"652.8"]
[null,null,"Soggetti",null,"Cryptography"]
[{"$nulls":4},"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 -- Contents - Part II -- Encryption -- Forward-Secure Encryption with Fast Forwarding -- 1 Introduction -- 1.1 Basic Solutions and a New Dimension -- 1.2 Our Contributions -- 1.3 Related Work -- 2 Preliminaries -- 3 Fast-Forwarding in the Bulletin Board Model -- 3.1 Bulletin Board -- 3.2 Fast-Forwardable Stream Ciphers -- 3.3 Fast-Forwardable Updatable Public-Key Encryption -- 4 Constructing a Fast-Forwardable PRNG -- 4.1 The Basic Construction -- 4.2 Supporting an Unbounded Number of Epochs -- 5 Fast-Forwardable Updatable Public-Key Encryption -- 5.1 Update-Homomorphic UPKE -- 5.2 Update Graphs -- 5.3 A Generic Construction -- 6 Conclusions and Open Problems -- References -- Rate-1 Incompressible Encryption from Standard Assumptions -- 1 Introduction -- 1.1 Our Results -- 1.2 Comparison with Previous Work -- 2 Technical Overview -- 2.1 The Scheme of GWZ -- 2.2 The Big Picture -- 2.3 Rate-1 Incompressible Symmetric-Key Encryption -- 2.4 From Symmetric-Key to Public-Key Incompressible Encryption via Hash Proof Systems -- 2.5 Extension to CCA Security -- 3 Preliminaries -- 3.1 Decisional Diffie-Hellman Assumption -- 3.2 Public-Key Encryption -- 3.3 HILL-Entropic Encodings -- 4 Incompressible Symmetric-Key Encryption -- 4.1 Definition -- 4.2 Construction -- 5 Programmable Hash Proof Systems -- 5.1 Definitions -- 5.2 Programmable Hash Proof System from DDH -- 5.3 2-Smooth Hash Proof System from DDH -- 6 Incompressible PKE from Incompressible SKE and HPS -- 6.1 CCA "]
[{"$nulls":4},"Incompressible Encryption -- 6.2 Construction -- References -- Achievable CCA2 Relaxation for Homomorphic Encryption -- 1 Introduction -- 2 Preliminaries -- 3 A Sufficient and Achievable Relaxation of CCA2 -- 3.1 funcCPA-Security: A Sufficient Relaxation of CCA2 -- 3.2 Sanitized HE Schemes are funcCPA-Secure -- 3.3 funcCPA Security of leveled HE Schemes."]
[{"$nulls":4},"3.4 Barriers on Proving funcCPA for Existing HE Schemes -- 4 CPA Insufficiency Against Malicious Adversaries -- 5 CPA Implies Privacy Against Semi-honest Adversaries -- 6 Conclusions -- A  Proof of Lemma 2 -- References -- Multi-party Computation I -- Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security -- 1 Introduction -- 1.1 Our Contribution -- 2 Technical Overview -- 2.1 Main Theorem -- 2.2 Strong Honest-Majority MPC with Everlasting Security from OWF -- References -- Sublinear Secure Computation from New Assumptions -- 1 Introduction -- 1.1 Our Results -- 2 Technical Overview -- 2.1 Sublinear 2PC for Layered Circuits from Decomposable Batch OT -- 2.2 Polylogarithmic PIR from CDH -- 3 Sublinear Computation for loglog-Depth Circuits -- 3.1 Decomposable Two-Round Batch Oblivious Transfer -- 3.2 Instantiation Under QR +LPN, Adapted from ch5EC:BBDP22 -- 3.3 Bounded Query Repetitions -- 3.4 Two-Round Batch SPIR with Correlated Queries -- 3.5 Sublinear Computation of loglog-Depth Circuits from corrSPIR -- 3.6 Extension to Layered Circuits -- 4 Polylogarithmic PIR from CDH -- 4.1 Laconic Private Set Intersection -- 4.2 From Laconic PSI to Half-PIR -- 4.3 From Polylogarithmic Half-PIR to Polylogarithmic PIR -- References -- How to Obfuscate MPC Inputs -- 1 Introduction -- 1.1 Overview of Our Results -- 1.2 Related Work -- 2 Preliminaries -- 2.1 Idealized Models -- 2.2 Obfuscation -- 3 Defining io2PC -- 3.1 Simulation Rate -- 3.2 Server Compromise and Offline Evaluation -- 3.3 Preventing Precomputation -- 4 io2PC for Random-Oracle-Model Obfuscation -- 4.1 Oblivious PRF -- 4.2 io2PC Protocol -- 5 io2PC for Generic-Group Obfuscations -- 5.1 Generic Groups -- 5.2 Personalized Generic Group -- 5.3 Protocol for Personalized Generic Groups -- 5.4 io2PC Protocol for Generic-Group Obfuscation -- 6 Compatible Obfuscations."]
[{"$nulls":4},"6.1 Point Functions -- 6.2 Hyperplane Membership -- References -- Statistical Security in Two-Party Computation Revisited -- 1 Introduction -- 1.1 Our Contributions -- 2 Technical Overview -- 2.1 One-Sided Statistical Two-Party Computation Protocol -- 2.2 Constructing Our Ingredients from eOT -- 3 Preliminaries -- 3.1 Notations -- 3.2 Oblivious Transfer Protocols -- 3.3 Additional Preliminaries -- 4 Three Round Oblivious Transfer Protocols -- 4.1 Statistically Receiver Private Indistinguishability-Based OT -- 4.2 Three Round Statistically Sender Private OT -- 5 One-Sided Statistically Secure 2PC Against Explainable Parties -- 5.1 Protocol exp -- 5.2 Two Round Statistically Hiding Commitment -- 6 One-Sided Statistically Secure 2PC Against Malicious Corruptions -- 6.1 Conditional Disclosure of Secrets in the Preprocessing Model -- 6.2 Protocol mal -- 7 Instantiations of eOT -- References -- Protocols: Key Agreement and Commitments -- On the Worst-Case Inefficiency of CGKA -- 1 Introduction -- 1.1 Our Results -- 1.2 Compact Key Exchange -- 1.3 Standard Security of Continuous Group Key Agreement -- 1.4 Equivalence of CKE and CGKA Worst-Case Communication Complexity -- 1.5 Black-Box Compact Key Exchange Lower Bound -- 1.6 No Single Optimal CGKA Protocol Exists -- 1.7 Lessons Learned for Practice -- 2 Definitions -- 2.1 Continuous Group Key Agreement -- 2.2 Compact Key Exchange -- 3 From CGKA to CKE Tightly -- 3.1 Embedding CGKA Ciphertexts in CKE Ciphertexts -- 4 CKE Lower Bound from PKE -- 4.1 Proof Outline -- 4.2 Attack for (CRSGeng, Initg, Comme, Derived) -- 5 "]
[{"$nulls":4},"No Single Optimal CGKA Protocol Exists -- 5.1 Bad Sequences of Operations -- 5.2 Suboptimality of All CGKA Protocols -- References -- Adaptive Multiparty NIKE -- 1 Introduction -- 1.1 Prior Work and Motivation -- 1.2 Technical Challenges -- 1.3 Result Summary -- 1.4 Technical Overview."]
[{"$nulls":4},"1.5 Organization -- 2 Preliminaries -- 2.1 Multiparty NIKE -- 2.2 Constrained PRFs -- 3 Enhancing Multi-party NIKE -- 3.1 Achieving Adversarial Correctness -- 3.2 Removing the CRS -- 3.3 Adding Shared Key Queries -- 3.4 Putting It All Together -- 4 The Equivalence of Multiparty NIKE and 1-SF-PRF -- 4.1 From 1-SF-PRF to Special Constrained PRF -- 4.2 From Special Constrained PRF to Multiparty NIKE with Setup -- 5 Construction of 1-SF-PRFs -- 5.1 Construction -- 5.2 Security Proof -- References -- On the Impossibility of Algebraic Vector Commitments in Pairing-Free Groups -- 1 Introduction -- 1.1 Our Results -- 1.2 Our Techniques -- 1.3 Interpretation of Our Impossibility and Further Implications -- 1.4 Related Work -- 1.5 Organization of the Paper -- 2 Preliminaries -- 2.1 Vector Commitments -- 2.2 Digital Signatures -- 3 Algebraic Vector Commitments -- 3.1 Generic Transformation from VCs to Signatures -- 3.2 -Unforgeability -- 4 Algebraic Signatures -- 4.1 Attack to Schemes with Strictly Linear Verification -- 4.2 Attack to Schemes with Generic Verification -- 5 Conclusions -- 5.1 Impossibility of Algebraic Vector Commitments -- 5.2 Impossibility of Algebraic Signatures -- References -- Four-Round Black-Box Non-malleable Schemes from One-Way Permutations -- 1 Introduction -- 1.1 Our Contributions -- 2 Overview of Techniques -- 2.1 Our NMZKC Protocol and New Commitment Schemes -- 2.2 4-Round Non-malleable Commitment nmc -- 3 Preliminaries -- 3.1 Commitment Schemes -- 3.2 Non-malleable Commitments -- 3.3 -Commitments -- 3.4 Adaptive-Input SHVZK -- 3.5 One-of-Two Binding Commitments -- 3.6 MPC Definitions -- 3.7 Verifiable Secret Sharing (VSS) -- 4 Non-malleable HVZK with Respect to Commitment -- 5 Our Delayed-Input MPC-in-the-Head Protocol AI -- 6 The Building Blocks of the 4-Round Black-Box Non-malleable Commitment Scheme."]
[{"$nulls":4},"6.1 Commitment from Verifiable Secret Sharing -- 6.2 Commit-and-Prove -- 6.3 The 4-Round Non-malleable Commitment Scheme of ch11FOCS:GRRV14 -- 7 Our 4-Round Black-Box Non-malleable Commitment Scheme -- 7.1 Formal Description of nmc = ((Snmc , Rnmc ), Decnmc ) -- 8 Comparison with Previous Non-black-box Approaches to Four-Round Non-malleable Commitments -- References -- Theory I: Sampling and Friends -- A Tight Computational Indistinguishability Bound for Product Distributions -- 1 Introduction -- 1.1 Related Work -- 1.2 Organization -- 2 Definitions -- 2.1 Notation -- 3 The Non-uniform Bounds and Tightness -- 3.1 The N-Fold Case -- 3.2 Tightness -- 4 The Uniform Variant -- 5 Applications -- 6 Open Questions -- References -- Secure Sampling with Sublinear Communication -- 1 Introduction -- 1.1 Our Work -- 1.2 Technical Overview -- 1.3 Related Work -- 2 Two-Party L1 Sampling -- 2.1 A Toy Protocol Towards Securely Realizing FL1 -- 2.2 Secure L1 Sampling Protocol -- 3 Two Party L2 Sampling -- 3.1 A Non-private L2 Sampling Protocol with (1) Communication -- 3.2 Secure L2 Sampling from FHE -- 3.3 A Non-private Lp Sampling Protocol with (1) Communication -- 4 Two-Party Product Sampling -- 4.1 Impossibility of Sublinear Product Sampling -- 4.2 Product Sampling While Leaking at Most the Inner Product -- 5 Product Sampling in Constant Rounds -- 5.1 Secure Approximation of the Inner Product -- 5.2 Constant-Round Protocol for Product Sampling -- References -- Secure Non-interactive Simulation from Arbitrary Joint Distributions -- 1 Introduction -- 2 "]
[{"$nulls":4},"Overview of Our Contributions -- 2.1 Overview of Our Results -- 2.2 Overview of Our Technical Contributions -- 3 Preliminaries -- 3.1 Notation -- 3.2 Maximal Correlation -- 3.3 Fourier Analysis Basics -- 3.4 Markov Operator -- 3.5 Efron-Stein Decomposition -- 3.6 Imported Theorems."]
[{"$nulls":4},"4 Characterization of SNIS from Arbitrary Sources."]
[null,"4.","Record Nr.",null,"UNINA9910375906003321"]
[null,null,"Autore",null,"Ayala Jose L"]
[null,null,"Titolo",null,"GLSVLSI '13 : proceedings of the ACM International Conference of the Great Lakes Symposium on VLSI : May 2-3, 2013, Paris, France"]
[null,null,"Pubbl/distr/stampa",null,"[Place of publication not identified], : ACM, 2013"]
[null,null,"Descrizione fisica",null,"1 online resource (354 pages)"]
[null,null,"Collana",null,"ACM Conferences"]
[null,null,"Soggetti",null,"Electrical & Computer Engineering"]
[{"$nulls":4},"Engineering & Applied Sciences"]
[{"$nulls":4},"Electrical Engineering"]
[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","Bibliographic Level Mode of Issuance: Monograph"]
[null,"5.","Record Nr.",null,"UNISANNIORMS0126556"]
[null,null,"Autore",null,"Warnatz, J."]
[null,null,"Titolo",null,"Combustion : physical and chemical fundamentals, modeling and simulation, experiments, pollutant formation / J. Warnatz, U. Maas, R. W. Dibble"]
[null,null,"Pubbl/distr/stampa",null,"Berlin [etc.], : Springer, c2001"]
[null,null,"Titolo uniforme",null,"Technische Verbrennung"]
[null,null,"ISBN",null,"3540677518"]
[null,null,"Edizione",null,"[3. ed]"]
[null,null,"Descrizione fisica",null,"X, 299 p. ; 24 cm."]
[null,null,"Disciplina",null,"541"]
[{"$nulls":4},"541.361"]
[null,null,"Soggetti",null,"Combustione"]
[null,null,"Collocazione",null,"SALA DING 541                     WAR.co01SALA DING 541                     WAR.co"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,"6.","Record Nr.",null,"UNINA9910144201303321"]
[null,null,"Titolo",null,"International journal of qualitative studies on health and well-being"]
[null,null,"Pubbl/distr/stampa",null,"London ; ; New York, : Taylor & Francis, [2006]-"]
[{"$nulls":4},"Stockholm, : Informa Healthcare"]
[{"$nulls":4},"[Abingdon, Oxfordshire, UK], : Taylor & Francis"]
[null,null,"ISSN",null,"1748-2631"]
[null,null,"Descrizione fisica",null,"1 online resource"]
[null,null,"Disciplina",null,"004.42"]
[null,null,"Soggetti",null,"Qualitative research"]
[{"$nulls":4},"Health - Research - Methodology"]
[{"$nulls":4},"Qualitative Research"]
[{"$nulls":4},"Health"]
[{"$nulls":4},"Recherche qualitative"]
[{"$nulls":4},"Santé - Recherche - Méthodologie"]
[{"$nulls":4},"Santé"]
[{"$nulls":4},"health"]
[{"$nulls":4},"Periodical"]
[{"$nulls":4},"periodicals."]
[{"$nulls":4},"Periodicals."]
[{"$nulls":4},"Périodiques."]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Periodico"]
[null,null,null,"Note generali","Refereed/Peer-reviewed"]