LEADER 00957nam a2200277 i 4500 001 991000779699707536 005 20020507173502.0 008 970227s1967 us ||| | eng 035 $ab10756152-39ule_inst 035 $aLE01302201$9ExL 040 $aDip.to Matematica$beng 082 0 $a510.9 084 $aAMS 01A05 100 1 $aStruik, Dirk Jan$045110 245 12$aA concise history of mathematics /$cby Dirk J. Struik 250 $a3rd rev. ed 260 $aNew York :$bDover,$c1967 300 $ax, 195 p. :$bill., facsims., ports. ;$c22 cm. 500 $aIncludes bibliographies 650 4$aMathematics-history 907 $a.b10756152$b21-09-06$c28-06-02 912 $a991000779699707536 945 $aLE013 01A STR12 (1967)$g1$i2013000078045$lle013$o-$pE0.00$q-$rl$s- $t0$u1$v0$w1$x0$y.i1085048x$z28-06-02 996 $aConcise history of mathematics$9103862 997 $aUNISALENTO 998 $ale013$b01-01-97$cm$da $e-$feng$gus $h2$i1 LEADER 01306nam2 22003253i 450 001 UMC0992414 005 20251003044431.0 020 $aIT$b89-3579 100 $a20180125d1986 ||||0itac50 ba 101 | $aita 102 $ait 181 1$6z01$ai $bxxxe 182 1$6z01$an 183 1$6z01$anc$2RDAcarrier 200 1 $aˆ1: ‰Soldati, corsari, regine nella Senigallia del Settecento, 1707-1739$fa cura di Sergio Anselmi 210 $aSenigallia$cComune di Senigallia$d1986 215 $a107 p.$cill.$d21 cm 300 $aEd. fuori commercio 312 $aTitolo sul dorso: Soldati, corsari, regine.$9CFI0083640 461 1$1001UMC0992412$12001 $aDalle memorie di casa Mastai$v1 517 1 $aSoldati, corsari, regine.$9CFI0083640 620 $aIT$dSenigallia$3FERL003133 702 1$aAnselmi$b, Sergio$3CFIV021783 801 3$aIT$bIT-000000$c20180125 850 $aIT-BN0095 $aIT-NA0079 912 $aUMC0992414 950 2$aBiblioteca Centralizzata di Ateneo$cv. 1$d 01POZZO LIB.F. ASSANTE 144$e 0101 0060013055E VMA (001 v. 1 (Precedente collocazione A 174)$fB $h20220916$i20220916 977 $a 01$a BN 996 $aSoldati, corsari, regine nella Senigallia del Settecento, 1707-1739$92909833 997 $aUNISANNIO LEADER 12583nam 22008295 450 001 9910591033603321 005 20251225203747.0 010 $a9783031147913 010 $a303114791X 024 7 $a10.1007/978-3-031-14791-3 035 $a(MiAaPQ)EBC7080417 035 $a(Au-PeEL)EBL7080417 035 $a(CKB)24779143500041 035 $a(PPN)264952669 035 $a(BIP)85604509 035 $a(BIP)85093108 035 $a(DE-He213)978-3-031-14791-3 035 $a(EXLCZ)9924779143500041 100 $a20220815d2022 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aSecurity and Cryptography for Networks $e13th International Conference, SCN 2022, Amalfi (SA), Italy, September 12?14, 2022, Proceedings /$fedited by Clemente Galdi, Stanislaw Jarecki 205 $a1st ed. 2022. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2022. 215 $a1 online resource (795 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v13409 311 08$aPrint version: Galdi, Clemente Security and Cryptography for Networks Cham : Springer International Publishing AG,c2022 9783031147906 320 $aIncludes bibliographical references and index. 327 $aIntro -- 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 -- 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. 327 $a3 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. 327 $a1.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 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. 327 $a7.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. 327 $a1.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 Analysis -- 5 Performance -- 6 Conclusion -- References. 327 $aTraceable Constant-Size Multi-authority Credentials. 330 $aThis book constitutes the proceedings of the 13th International Conference on Security and Cryptography for Networks, SCN 2022, held in Amalfi, Italy, in September 2022. The 33 full papers presented in this volume were carefully reviewed and selected from 101 submissions. They are organized in topical sections: Ciphers, Cryptanalysis, Defenses; Public Key Encryption; Authentication and Signatures, Multiparty Computation; Zero-Knowledge Proofs and Applications. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v13409 606 $aCryptography 606 $aData encryption (Computer science) 606 $aApplication software 606 $aData protection 606 $aComputer networks$xSecurity measures 606 $aComputer networks 606 $aCryptology 606 $aComputer and Information Systems Applications 606 $aSecurity Services 606 $aMobile and Network Security 606 $aComputer Communication Networks 615 0$aCryptography. 615 0$aData encryption (Computer science) 615 0$aApplication software. 615 0$aData protection. 615 0$aComputer networks$xSecurity measures. 615 0$aComputer networks. 615 14$aCryptology. 615 24$aComputer and Information Systems Applications. 615 24$aSecurity Services. 615 24$aMobile and Network Security. 615 24$aComputer Communication Networks. 676 $a005.82 676 $a005.824 702 $aGaldi$b Clemente 702 $aJarecki$b Stanis?aw 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910591033603321 996 $aSecurity and Cryptography for Networks$92912219 997 $aUNINA