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.
Applied cryptography in computer and communications : Second EAI International Conference, AC3 2022, virtual event, May 14-15, 2022, proceedings / / edited by Jingqiang Lin, Qiang Tang
| Applied cryptography in computer and communications : Second EAI International Conference, AC3 2022, virtual event, May 14-15, 2022, proceedings / / edited by Jingqiang Lin, Qiang Tang |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2022] |
| Descrizione fisica | 1 online resource (229 pages) |
| Disciplina | 929.605 |
| Collana | Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering |
| Soggetto topico | Computer security |
| ISBN | 3-031-17081-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Quantum-Safe Cryptographic Solution -- DU-QS22: A Dataset for Analyzing QC-MDPC-Based Quantum-Safe Cryptosystems -- 1 Introduction -- 2 QC-MDPC-Based Cryptosystem -- 3 Importance of Decoder -- 4 Overview of Our Implementation -- 4.1 Key-Generation Module -- 4.2 Encryption Module -- 4.3 Decryption Modules -- 5 DU-QS22 Dataset -- 6 Conclusion -- References -- Quantum-Safe Signing of Notification Messages in Intelligent Transport Systems -- 1 Introduction -- 2 Previous Work -- 3 Test Program -- 3.1 Implementing the Digital Signature Algorithms -- 3.2 Performance Tests -- 4 Results -- 5 Discussion -- 6 Future Research -- 7 Summary -- References -- Applied Cryptography for IoT -- WB-GWS: An IoT-Oriented Lightweight Gateway System Based on White-Box Cryptography -- 1 Introduction -- 2 Preliminaries -- 3 The Construction of WB-GWS -- 3.1 The Framework of WB-GWS -- 3.2 The Protocols of WB-GWS -- 4 Gateway Addition -- 5 Gateway Removal -- 6 Security Analysis -- 7 Experiment -- 7.1 The Experiment Base on Temperature and Humidity Sensor System -- 7.2 The Performance Comparison -- 8 Conclusions -- References -- Symmetric Key Based Scheme for Verification Token Generation in Internet of Things Communication Environment -- 1 Introduction -- 2 Related Work -- 3 System Model -- 3.1 System Setup Phase -- 3.2 Registration Phase -- 3.3 Authentication and Session Key Negotiation Phase -- 4 Comparative Analysis and Evaluation -- 4.1 Security Evaluation -- 4.2 Performance Evaluation -- 5 Conclusion and Future Work -- References -- Resource Consumption Evaluation of C++ Cryptographic Libraries on Resource-Constrained Devices -- 1 Introduction -- 2 Related Work -- 3 Methodology -- 4 Evaluation -- 4.1 Selected Algorithms -- 4.2 Experimental Setup -- 4.3 Discussion of Results -- 4.4 Limitations.
5 Conclusions and Future Work -- References -- Authentication Protocol -- A Secure Lightweight RFID Mutual Authentication Protocol Without Explicit Challenge-Response Pairs -- 1 Introduction -- 1.1 Structure of the Paper -- 2 Preliminaries -- 3 The Proposed Protocol -- 3.1 Notations -- 3.2 Assumptions of Our Proposed Protocol -- 3.3 Authentication Process -- 4 BAN Logic Analysis and Simulation Using the Scyther -- 4.1 BAN Logical Analysis -- 4.2 Simulation Using the Scyther -- 5 Security Analysis -- 6 Performance Evaluation -- 7 Conclusion -- A Analysis of the Gope et al.'s Scheme -- A.1 Performance and Security Analysis of Gope's Scheme -- B Physical Unclonable Functions -- C Feldman's (t,n)-threshold Verifiable Secret Sharing Scheme -- D Basic Notations and Logical Postulates of BAN Logical -- D.1 Basic Notations -- D.2 Logical Postulates -- E Security Simulation Using Scyther -- References -- bisAUTH: A Blockchain-Inspired Secure Authentication Protocol for IoT Nodes -- 1 Introduction -- 2 Related Works -- 3 bisAUTH: A New Blockchain-Inspired Secure Authentication Protocol for IoT Nodes -- 3.1 Main Components of the bisAUTH Protocol -- 3.2 Main Phases of the bisAUTH Protocol -- 3.3 bisAUTH Protocol Assessment -- 4 Conclusion -- References -- Real-World Applied Cryptography -- X-FTPC: A Fine-Grained Trust Propagation Control Scheme for Cross-Certification Utilizing Certificate Transparency -- 1 Introduction -- 2 Background and Challenges -- 2.1 Cross-Certification -- 2.2 Trust Propagation Challenge -- 2.3 Certificate Transparency -- 3 X-FTPC: Fine-Grained Trust Propagation Control for Cross-Certification -- 3.1 Overview -- 3.2 Fine-Grained Control Based on Mandatory-Log in X-FTPC -- 3.3 Different Scenarios in X-FTPC -- 3.4 Potential Threats in X-FTPC -- 4 Discussion in Feasibility of X-FTPC -- 5 Related Work -- 6 Conclusion -- References. The Block-Based Mobile PDE Systems are Not Secure - Experimental Attacks -- 1 Introduction -- 2 Background -- 2.1 Flash Memory -- 2.2 Flash Translation Layer -- 2.3 Plausibly Deniable Encryption -- 3 Model and Assumptions -- 4 Experimentally Attacking the Block-Layer PDE Systems -- 4.1 Experimental Setup -- 4.2 Experimental Attacks -- 5 Discussion -- 6 Related Work -- 6.1 The Hidden Volume-Based PDE Systems -- 6.2 The Steganographic File Systems -- 7 Conclusion -- References -- Black-Box Testing of Cryptographic Algorithms Based on Data Characteristics -- 1 Introduction -- 2 Preliminaries -- 3 Design and Implementation -- 3.1 Overview -- 3.2 Characteristic Data Extraction and Data Set Construction -- 3.3 Characteristic Data Matching Strategy -- 3.4 Cryptographic Algorithm Determination -- 4 Evaluation -- 4.1 Experiments Setup -- 4.2 Effectiveness -- 4.3 Performance -- 4.4 Limitations -- 5 Summary -- A Cryptographic Algorithm Supports -- B Test File Information -- References -- Network Attack and Defense -- IoT Devices Classification Base on Network Behavior Analysis -- 1 Introduction -- 2 Related Work -- 3 Network Behavior Analysis Based IoT Devices Classification -- 3.1 Motivation an Analysis -- 3.2 Overview -- 3.3 Session Feature Extraction -- 3.4 Session Feature Preprocess -- 3.5 LSTM Based Sequence Feature Extraction -- 3.6 Multilayer Perceptron Classifier -- 4 Evaluation -- 4.1 IoT Testbed Construction and Traffic Collection -- 4.2 Experimental Settings -- 4.3 Experimental Result and Analysis -- 4.4 Summary -- 5 Conclusion -- References -- Semi-supervised False Data Injection Attacks Detection in Smart Grid -- 1 Introduction -- 2 False Data Injection Attacks -- 3 Method -- 3.1 Overview -- 3.2 Samples Dataset Construction -- 3.3 Baseline Classifier Construction -- 3.4 Label Propagation and Semi-Supervised Classifier -- 4 Results -- 4.1 Dataset. 4.2 Experimental Results -- 5 Discussion -- 5.1 Amount of Unlabeled Samples -- 5.2 Robustness of Parameters -- 5.3 Computational Complexity -- 5.4 Amount of Labeled Samples -- 6 Conclusion -- References -- Security Application -- A Novel Logistics Scheme Based on Zero-Trust Model -- 1 Introduction -- 2 Background -- 3 Scheme -- 3.1 Overall Process -- 3.2 Module -- 4 Experiment -- 4.1 Experimental Environment -- 4.2 System Test -- 4.3 Blockchain Test -- 4.4 Security Test -- 5 Analysis -- 5.1 Performance -- 5.2 Security -- 6 Conclusion -- References -- ALFLAT: Chinese NER Using ALBERT, Flat-Lattice Transformer, Word Segmentation and Entity Dictionary -- 1 Introduction -- 2 Background -- 3 Model -- 3.1 Converting Lattice into Flat Structure -- 3.2 Relative Position Encoding of Spans -- 3.3 Chinese Word Segmentation -- 3.4 Modify the Emission Matrix Scores -- 3.5 Conditional Random Fields -- 4 Experiments -- 4.1 Experimental Setup -- 4.2 Overall Performance -- 4.3 How ALFLAT Use ALBERT Instead of BERT -- 4.4 How ALFLAT Brings Improvement -- 5 Conclusion -- References -- Author Index. |
| Record Nr. | UNISA-996495564103316 |
| Cham, Switzerland : , : Springer, , [2022] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Applied Cryptography in Computer and Communications : Second EAI International Conference, AC3 2022, Virtual Event, May 14-15, 2022, Proceedings / / edited by Jingqiang Lin, Qiang Tang
| Applied Cryptography in Computer and Communications : Second EAI International Conference, AC3 2022, Virtual Event, May 14-15, 2022, Proceedings / / edited by Jingqiang Lin, Qiang Tang |
| Edizione | [1st ed. 2022.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2022 |
| Descrizione fisica | 1 online resource (229 pages) |
| Disciplina |
929.605
005.8 |
| Collana | Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering |
| Soggetto topico |
Application software
Computer and Information Systems Applications |
| ISBN |
9783031170812
3031170814 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Quantum-Safe Cryptographic Solution -- DU-QS22: A Dataset for Analyzing QC-MDPC-based Quantum-Safe Cryptosystems -- Quantum-Safe Signing of Notification Messages in Intelligent Transport Systems -- Applied Cryptography for IoT -- WB-GWS: An IoT-Oriented Lightweight Gateway System Based on White-Box Cryptography -- Symmetric Key Based Scheme for Verification Token Generation in Internet of Things Communication Environment -- Resource Consumption Evaluation of C++ Cryptographic Libraries on Resource-Constrained Devices -- Authentication Protocol -- A Secure Lightweight RFID Mutual Authentication Protocol without Explicit Challenge-Response Pairs -- bisAUTH : A blockchain-inspired secure authentication protocol for IoT nodes -- Real-World Applied Cryptography -- X-FTPC: A Fine-grained Trust Propagation Control Scheme for Cross-Certification Utilizing Certificate Transparency -- The Block-based Mobile PDE Systems Are Not Secure - Experimental Attacks -- Black-box Testing ofCryptographic Algorithms Based on Data Characteristics -- Network Attack and Defense -- IoT Devices Classification base on Network Behavior Analysis -- Semi-supervised False Data Injection Attacks Detection in Smart Grid -- Security Application -- A Novel Logistics Scheme Based on Zero-trust Model -- ALFLAT: Chinese NER Using ALBERT,Flat-Lattice Transformer,Word Segmentation and Entity Dictionary. |
| Record Nr. | UNINA-9910616393803321 |
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Public-Key Cryptography – PKC 2024 : 27th IACR International Conference on Practice and Theory of Public-Key Cryptography, Sydney, NSW, Australia, April 15–17, 2024, Proceedings, Part I / / edited by Qiang Tang, Vanessa Teague
| Public-Key Cryptography – PKC 2024 : 27th IACR International Conference on Practice and Theory of Public-Key Cryptography, Sydney, NSW, Australia, April 15–17, 2024, Proceedings, Part I / / edited by Qiang Tang, Vanessa Teague |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (XIV, 442 p. 100 illus., 18 illus. in color.) |
| Disciplina | 005.824 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Cryptography
Data encryption (Computer science) Cryptology |
| ISBN | 3-031-57718-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996594165903316 |
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Public-Key Cryptography – PKC 2024 : 27th IACR International Conference on Practice and Theory of Public-Key Cryptography, Sydney, NSW, Australia, April 15–17, 2024, Proceedings, Part II / / edited by Qiang Tang, Vanessa Teague
| Public-Key Cryptography – PKC 2024 : 27th IACR International Conference on Practice and Theory of Public-Key Cryptography, Sydney, NSW, Australia, April 15–17, 2024, Proceedings, Part II / / edited by Qiang Tang, Vanessa Teague |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (468 pages) |
| Disciplina | 005.82 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Cryptography
Data encryption (Computer science) Cryptology |
| ISBN | 3-031-57722-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Contents - Part II -- Commitments -- Updatable, Aggregatable, Succinct Mercurial Vector Commitment from Lattice -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Technique Overview -- 1.3 Related Work -- 2 Preliminaries -- 2.1 Notation -- 2.2 Lattice Preliminaries -- 2.3 BASIS Assumption -- 2.4 Mercurial Vector Commitment -- 3 Succinct Mercurial Vector Commitments Based on BASIS -- 3.1 Updatable Mercurial Vector Commitments -- 3.2 Aggregatable Mercurial Vector Commitment -- 4 Application: Lattice-Based ZK-EDB -- References -- Vector Commitments with Proofs of Smallness: Short Range Proofs and More -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Technical Overview -- 1.3 Related Work -- 1.4 Organization -- 2 Background and Definitions -- 2.1 Hardness Assumptions -- 2.2 Non-interactive Arguments -- 2.3 Algebraic Group Model -- 3 Short Proofs that a Committed Vector Is Binary -- 4 A Range Proof with Very Short Proofs -- 4.1 Description -- 4.2 Security in the AGM and ROM -- 4.3 Batched Range Proofs and Proving the Smallness of Vectors -- 4.4 Comparisons -- References -- Simulation-Extractable KZG Polynomial Commitments and Applications to HyperPlonk -- 1 Introduction -- 1.1 Contributions -- 1.2 Technical Overview -- 1.3 Related Work -- 2 Background and Definitions -- 2.1 Definitions for Polynomials -- 2.2 Hardness Assumptions -- 2.3 Succinct Non-interactive Arguments -- 2.4 Algebraic Group Model -- 2.5 Polynomial Commitments -- 3 Commitments to Multivariate Polynomials -- 3.1 The Multivariate PCS of Zhang et al. -- 3.2 Enforcing a Special Shape for Committed Polynomials -- 4 A Simulation-Extractable Variant of Zhang et al.'s Polynomial Commitment -- 4.1 Description -- 4.2 Extensions -- 5 A Simulation-Extractable Variant of HyperPlonk -- 5.1 Description -- 5.2 Security -- References -- Oblivious Accumulators.
1 Introduction -- 1.1 Our Contributions -- 2 Preliminaries -- 2.1 Notation -- 2.2 Compressing Primitives -- 3 KVC Based on Acc and VC -- 3.1 Construction I with Weak Key Binding -- 3.2 Construction II with Strong Key Binding -- 3.3 Relation to Existing Constructions -- 4 Oblivious Accumulators -- 4.1 Definition -- 4.2 Obliviousness Properties -- 5 OblvAcc Based on KVC -- 5.1 Construction -- 5.2 Soundness -- 5.3 Element Hiding -- 5.4 Add-Del Indistinguishability -- 5.5 Extension for Unique Accumulation of Elements -- 6 Lower Bounds -- 6.1 Oblivious Accumulators -- 6.2 Oblivious Accumulators Without Add-Del Indistinguishability -- References -- Witness Encryption for Succinct Functional Commitments and Applications -- 1 Introduction -- 1.1 Our Work: WE for Succinct Functional Commitments -- 1.2 Our Contributions -- 1.3 Technical Overview -- 1.4 Related Work -- 2 Preliminaries -- 2.1 Functional Commitment Schemes -- 3 WEFC: Witness Encryption for Functional Commitment -- 4 Our WEFC Construction -- 4.1 Smooth Projective Hash Functions -- 4.2 Our Construction -- 5 Our WEFC Instantiations -- 5.1 Our FC for Monotone Span Programs -- 5.2 Other Instantiations -- 6 From WEFC to Reusable Non-interactive MPC -- 6.1 Preliminaries on mrNISC -- 6.2 Our mrNISC Construction -- 7 Other Application Scenarios -- 7.1 Targeted Broadcast -- 7.2 Simple Contingent Payment for Services -- References -- Multiparty Computation -- Network-Agnostic Multi-party Computation Revisited (Extended Abstract) -- 1 Introduction -- 1.1 Technical Overview -- 2 Preliminaries and Definitions -- 2.1 Primitives and Definitions -- 2.2 Existing Building Blocks -- 3 Network-Agnostic Byzantine Broadcast -- 3.1 Asynchronous Broadcast with Weaker Synchronous Guarantees -- 3.2 Synchronous Byzantine Agreement -- 3.3 BOBW BC -- 4 Network-Agnostic VSS -- 5 Agreement on a Common Subset (ACS). 6 The Preprocessing Phase Protocol -- 6.1 Network-Agnostic Beaver's Multiplication Protocol -- 6.2 Network-Agnostic Triple-Transformation Protocol -- 6.3 Network-Agnostic Protocol for Generating a Random Value -- 6.4 Network-Agnostic Polynomial-Verification Protocol -- 6.5 Network-Agnostic Triple-Sharing Protocol -- 6.6 Network-Agnostic Triple-Extraction Protocol -- 6.7 The Network-Agnostic Preprocessing Phase Protocol -- 7 The Network-Agnostic Circuit-Evaluation Protocol -- 8 Conclusion and Open Problems -- References -- On Information-Theoretic Secure Multiparty Computation with Local Repairability -- 1 Introduction -- 1.1 Our Contribution -- 1.2 Related Work -- 1.3 Organization -- 2 Preliminaries -- 2.1 Secret Sharing Schemes -- 2.2 Linear Codes -- 2.3 Security Model -- 3 Our Linear Secret-Sharing Scheme with Good Locality -- 3.1 Reconstruction, Multiplicativity and Strong Multiplicativity -- 3.2 Privacy Analysis -- 4 Passively Secure Repairing Protocol for Multiplicative Variants of -- 5 Actively Secure Repairing Protocol for Strongly-Multiplicative Variants of -- A Comparison with a Two-Level Shamir's Secret Sharing Scheme -- References -- Zero Knowledge Proofs -- Zero Knowledge Protocols and Signatures from the Restricted Syndrome Decoding Problem -- 1 Introduction -- 1.1 Our Contribution -- 1.2 Paper Organization -- 2 Notation and Preliminaries -- 2.1 Cryptographic Tools -- 2.2 Linear Codes -- 3 The Restricted Syndrome Decoding Problem -- 3.1 Solving R-SDP -- 4 Building ZK Protocols from the R-SDP: A Preliminary Analysis -- 4.1 Zero Knowledge Masking of Restricted Vectors -- 4.2 The Case Study of CVE with R-SDP -- 5 R-SDP(G): Using Subgroups of the Restricted Group -- 5.1 Properties of the Restricted Group -- 5.2 Cyclic Subgroups of the Restricted Group -- 5.3 Solving R-SDP with Restricted Subgroup -- 5.4 Criteria to Design R-SDP(G). 5.5 R-SDP(G) in Practice: Easy to Implement and Tight Parameters -- 6 ZK Protocols from the R-SDP: Modern Protocols -- 6.1 R-GPS: The GPS Scheme with R-SDP -- 6.2 R-BG: The BG-PKP Scheme with R-SDP -- 7 Comparison with NIST Candidates -- 8 Conclusion -- References -- Ring/Module Learning with Errors Under Linear Leakage - Hardness and Applications -- 1 Introduction -- 1.1 Our Results -- 1.2 Technical Overview -- 2 Preliminaries -- 2.1 Cyclotomic Rings -- 2.2 Discrete Gaussian Distribution -- 2.3 MLWE -- 3 Hardness: MLWE with Linear Leakage -- 4 Application: More Efficient Opening Proof for One-Time BDLOP Commitment -- 4.1 Classical Opening Proof of BDLOPCommitment and Rejection Sampling Algorithms -- 4.2 More Efficient One-Time Opening Proof Through Using Generalized Subset Rejection Sampling Algorithms -- 4.3 Comparison of Efficiency -- References -- Succinct Verification of Compressed Sigma Protocols in the Updatable SRS Setting -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Related Work -- 1.3 Technical Overview -- 2 Preliminaries -- 2.1 Interactive Arguments -- 2.2 Assumptions -- 3 CSP for Committed Linear Forms -- 3.1 Opening a Committed Linear Form -- 3.2 Improved Protocol for Opening a Committed Linear Form -- 4 Updatable SRS zkSNARK for Circuit Satisfiability -- 4.1 Committing to a Linear Form for Multiplication Gates -- 4.2 Hadamard Product Argument -- 4.3 Permutation Argument -- 4.4 Putting Things Together - zkSNARK for Circuit SAT -- 5 CSP for Committed Homomorphism -- 5.1 Commitment Scheme -- 5.2 Succinct Verifier -Protocol for Opening Committed Homomorphism -- References -- Lookup Arguments: Improvements, Extensions and Applications to Zero-Knowledge Decision Trees -- 1 Introduction -- 1.1 Technical Overview -- 1.2 Related Work -- 2 Preliminaries -- 2.1 Commit-and-Prove SNARKs -- 2.2 Extractable Commitment Schemes. 2.3 Polynomial, Vector and Matrix Commitment Schemes -- 3 Zero-Knowledge Matrix Lookup Arguments -- 4 Our New Zero-Knowledge Lookup Arguments -- 4.1 cq+ Lookup Argument -- 4.2 Our Fully Zero-Knowledge Lookup Argument -- 5 Our Matrix Lookup Argument -- 5.1 The Straw Man Solution -- 5.2 Our Scheme -- 5.3 Concrete Efficiency -- 6 Zero-Knowledge Decision Tree Statistics -- 6.1 Security Model -- 6.2 The Extended Encoding of Decision Trees -- 6.3 Extractable Commitment to Decision Trees -- 6.4 CP-SNARK for Statistics on Decision Trees -- 6.5 Efficiency and Concrete Instantiations -- References -- Short Code-Based One-out-of-Many Proofs and Applications -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Technical Overview -- 1.3 Roadmap -- 2 Preliminaries -- 2.1 Hard Problems -- 2.2 Merkle Trees -- 2.3 Seedtrees -- 3 Short One-out-of-Many Proofs from Coding Theory -- 3.1 The SD-Based One-out-of-Many Proof -- 3.2 The GSD-Based One-out-of-Many Proof -- 3.3 Our Set-Membership Proof -- 4 Our Code-Based Logarithmic-Size Ring Signature Scheme -- 5 Code-Based Group Signatures -- 5.1 The Underlying Protocol of Our Group Signature -- 5.2 Our Code-Base Logarithmic-Size Group Signature Scheme -- 6 Concrete Instantiation -- References -- Efficient KZG-Based Univariate Sum-Check and Lookup Argument -- 1 Introduction -- 1.1 Contributions -- 1.2 Technical Overview -- 1.3 Related Works -- 2 Preliminaries -- 2.1 Bilinear Pairing -- 2.2 The KZG Polynomial Commitment -- 2.3 Polynomials and Lagrange Basis -- 2.4 Algebraic Group Model -- 2.5 Argument of Knowledge -- 3 Losum: Optimal Sum-Check for KZG -- 3.1 Overview -- 3.2 Protocol Description -- 3.3 Security and Efficiency Analysis -- 4 Locq: Improved Lookup Argument -- 4.1 Overview -- 4.2 Protocol Description -- 4.3 Security and Efficiency Analysis -- 5 Conclusion -- References. On Sigma-Protocols and (Packed) Black-Box Secret Sharing Schemes. |
| Record Nr. | UNINA-9910847578303321 |
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Public-Key Cryptography – PKC 2024 : 27th IACR International Conference on Practice and Theory of Public-Key Cryptography, Sydney, NSW, Australia, April 15–17, 2024, Proceedings, Part I / / edited by Qiang Tang, Vanessa Teague
| Public-Key Cryptography – PKC 2024 : 27th IACR International Conference on Practice and Theory of Public-Key Cryptography, Sydney, NSW, Australia, April 15–17, 2024, Proceedings, Part I / / edited by Qiang Tang, Vanessa Teague |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (XIV, 442 p. 100 illus., 18 illus. in color.) |
| Disciplina | 005.82 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Cryptography
Data encryption (Computer science) Cryptology |
| ISBN | 3-031-57718-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910847598103321 |
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||