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.
Advances in Cryptology – EUROCRYPT 2004 [[electronic resource] ] : International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, May 2-6, 2004. Proceedings / / edited by Christian Cachin, Jan Camenisch
| Advances in Cryptology – EUROCRYPT 2004 [[electronic resource] ] : International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, May 2-6, 2004. Proceedings / / edited by Christian Cachin, Jan Camenisch |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XII, 630 p.) |
| Disciplina | 005.82 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data encryption (Computer science)
Computer communication systems Operating systems (Computers) Algorithms Computer science—Mathematics Management information systems Computer science Cryptology Computer Communication Networks Operating Systems Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Management of Computing and Information Systems |
| ISBN |
1-280-30737-4
9786610307371 3-540-24676-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Private Computation -- Efficient Private Matching and Set Intersection -- Positive Results and Techniques for Obfuscation -- Secure Computation of the k th -Ranked Element -- Signatures I -- Short Signatures Without Random Oracles -- Sequential Aggregate Signatures from Trapdoor Permutations -- Unconditional Security -- On the Key-Uncertainty of Quantum Ciphers and the Computational Security of One-Way Quantum Transmission -- The Exact Price for Unconditionally Secure Asymmetric Cryptography -- On Generating the Initial Key in the Bounded-Storage Model -- Distributed Cryptography -- Practical Large-Scale Distributed Key Generation -- Optimal Communication Complexity of Generic Multicast Key Distribution -- Foundations I -- An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem -- Black-Box Composition Does Not Imply Adaptive Security -- Identity-Based Encryption -- Chosen-Ciphertext Security from Identity-Based Encryption -- Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles -- Elliptic Curves -- Construction of Secure Random Curves of Genus 2 over Prime Fields -- Projective Coordinates Leak -- Signatures II -- Security Proofs for Identity-Based Identification and Signature Schemes -- Concurrent Signatures -- The Hierarchy of Key Evolving Signatures and a Characterization of Proxy Signatures -- Public-Key Cryptography -- Public-Key Steganography -- Immunizing Encryption Schemes from Decryption Errors -- Secure Hashed Diffie-Hellman over Non-DDH Groups -- Foundations II -- On Simulation-Sound Trapdoor Commitments -- Hash Function Balance and Its Impact on Birthday Attacks -- Multiparty Computation -- Multi-party Computation with Hybrid Security -- On the Hardness of Information-Theoretic Multiparty Computation -- Dining Cryptographers Revisited -- Cryptanalysis -- Algebraic Attacks and Decomposition of Boolean Functions -- Finding Small Roots of Bivariate Integer Polynomial Equations Revisited -- New Applications -- Public Key Encryption with Keyword Search -- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data -- Algorithms and Implementation -- Merkle Tree Traversal in Log Space and Time -- Can We Trust Cryptographic Software? Cryptographic Flaws in GNU Privacy Guard v1.2.3 -- Anonymity -- Traceable Signatures -- Handcuffing Big Brother: an Abuse-Resilient Transaction Escrow Scheme -- Anonymous Identification in Ad Hoc Groups. |
| Record Nr. | UNISA-996465405503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Advances in Cryptology – EUROCRYPT 2004 : International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, May 2-6, 2004. Proceedings / / edited by Christian Cachin, Jan Camenisch
| Advances in Cryptology – EUROCRYPT 2004 : International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, May 2-6, 2004. Proceedings / / edited by Christian Cachin, Jan Camenisch |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XII, 630 p.) |
| Disciplina | 005.82 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Cryptography
Data encryption (Computer science) Computer networks Operating systems (Computers) Algorithms Computer science - Mathematics Discrete mathematics Electronic data processing - Management Cryptology Computer Communication Networks Operating Systems Discrete Mathematics in Computer Science IT Operations |
| ISBN |
1-280-30737-4
9786610307371 3-540-24676-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Private Computation -- Efficient Private Matching and Set Intersection -- Positive Results and Techniques for Obfuscation -- Secure Computation of the k th -Ranked Element -- Signatures I -- Short Signatures Without Random Oracles -- Sequential Aggregate Signatures from Trapdoor Permutations -- Unconditional Security -- On the Key-Uncertainty of Quantum Ciphers and the Computational Security of One-Way Quantum Transmission -- The Exact Price for Unconditionally Secure Asymmetric Cryptography -- On Generating the Initial Key in the Bounded-Storage Model -- Distributed Cryptography -- Practical Large-Scale Distributed Key Generation -- Optimal Communication Complexity of Generic Multicast Key Distribution -- Foundations I -- An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem -- Black-Box Composition Does Not Imply Adaptive Security -- Identity-Based Encryption -- Chosen-Ciphertext Security from Identity-Based Encryption -- Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles -- Elliptic Curves -- Construction of Secure Random Curves of Genus 2 over Prime Fields -- Projective Coordinates Leak -- Signatures II -- Security Proofs for Identity-Based Identification and Signature Schemes -- Concurrent Signatures -- The Hierarchy of Key Evolving Signatures and a Characterization of Proxy Signatures -- Public-Key Cryptography -- Public-Key Steganography -- Immunizing Encryption Schemes from Decryption Errors -- Secure Hashed Diffie-Hellman over Non-DDH Groups -- Foundations II -- On Simulation-Sound Trapdoor Commitments -- Hash Function Balance and Its Impact on Birthday Attacks -- Multiparty Computation -- Multi-party Computation with Hybrid Security -- On the Hardness of Information-Theoretic Multiparty Computation -- Dining Cryptographers Revisited -- Cryptanalysis -- Algebraic Attacks and Decomposition of Boolean Functions -- Finding Small Roots of Bivariate Integer Polynomial Equations Revisited -- New Applications -- Public Key Encryption with Keyword Search -- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data -- Algorithms and Implementation -- Merkle Tree Traversal in Log Space and Time -- Can We Trust Cryptographic Software? Cryptographic Flaws in GNU Privacy Guard v1.2.3 -- Anonymity -- Traceable Signatures -- Handcuffing Big Brother: an Abuse-Resilient Transaction Escrow Scheme -- Anonymous Identification in Ad Hoc Groups. |
| Record Nr. | UNINA-9910144186503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Financial Cryptography and Data Security : 27th International Conference, FC 2023, Bol, Brač, Croatia, May 1-5, 2023, Revised Selected Papers, Part II
| Financial Cryptography and Data Security : 27th International Conference, FC 2023, Bol, Brač, Croatia, May 1-5, 2023, Revised Selected Papers, Part II |
| Autore | Baldimtsi Foteini |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Cham : , : Springer, , 2024 |
| Descrizione fisica | 1 online resource (371 pages) |
| Disciplina | 005.824 |
| Altri autori (Persone) | CachinChristian |
| Collana | Lecture Notes in Computer Science Series |
| ISBN | 3-031-47751-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Contents - Part II -- Contents - Part I -- Proof of X -- SNACKs for Proof-of-Space Blockchains -- 1 Introduction -- 2 Preliminaries -- 3 SNACKs for Proof-of-Space Blockchains -- 3.1 Proof-of-Space Blockchains -- 3.2 SNACKs for PoSpace Blockchains: An Overview -- 3.3 SNACK for PoSpace Blockchains: The Main Construction -- References -- Proof of Necessary Work: Succinct State Verification with Fairness Guarantees -- 1 Introduction -- 2 Proof of Necessary Work -- 2.1 Amortization Resistance and Efficiency -- 3 Implications for Nakamoto Consensus -- 4 Design and Instantiation -- 5 Related Work -- A Security Proofs -- References -- Proof of Availability and Retrieval in a Modular Blockchain Architecture -- 1 Introduction -- 2 Model -- 3 Modular SMR Architecture -- 3.1 The Proof of Availability and Retrieval Problem Definition -- 3.2 Atomic Broadcast -- 3.3 Execution -- 3.4 Bringing Them All Together -- 4 Proof of Availability and Retrieval Protocols -- 4.1 Erasure Coded PoA& -- R -- 5 Theoretical Analysis -- 5.1 One Sample Per Round -- 5.2 Sampling logn per Round -- 5.3 Sampling n per Round -- 5.4 Simulations -- References -- Limits on Revocable Proof Systems, With Implications for Stateless Blockchains -- 1 Introduction -- 2 Model -- 3 Main Result -- 3.1 No Useful Trade-Offs for Sublinear State Size -- 3.2 Persistence Requires Linear Storage -- 4 Implications for Authenticated Data Structures -- 4.1 Cryptographic Accumulators -- 4.2 Vector Commitments -- 4.3 Authenticated Dictionary -- 5 Implications for Blockchains -- 5.1 Interpreting Our Bound in Practice -- 5.2 Versioning Model -- 5.3 Partially Persistent Model -- 5.4 Proof-Serving Node Model -- References -- Layer 2 -- State Machines Across Isomorphic Layer 2 Ledgers -- 1 Introduction -- 2 Background -- 3 Overview -- 3.1 The Goal -- 3.2 Approach.
4 The Ad-Hoc Ledger State Machine -- 4.1 Setup -- 4.2 Atomic Transactions -- 4.3 Wrapping UTxO -- 4.4 Collateral -- 4.5 Dispute -- 4.6 Extensions -- 5 The Protocols -- 6 Analysis -- 7 Conclusion -- References -- Get Me Out of This Payment! Bailout: An HTLC Re-routing Protocol -- 1 Introduction -- 2 Building Blocks -- 3 The Bailout Protocol -- 3.1 Overview of Bailout -- 3.2 The Phases of Bailout -- 3.3 Security Discussion -- 4 Evaluation -- 5 Related Work -- References -- Extras and Premiums: Local PCN Routing with Redundancy and Fees -- 1 Introduction -- 2 Background and Related Work -- 2.1 Payment Channel Networks -- 2.2 State-of-the-Art PCN Routing Protocols -- 3 Our Protocol -- 3.1 System and Threat Model -- 3.2 Security Goals -- 3.3 Protocol Description -- 3.4 Fees -- 4 Evaluation -- 4.1 Routing Algorithms -- 4.2 Setup -- 4.3 Simulation Results -- 5 Conclusion -- References -- An Efficient Algorithm for Optimal Routing Through Constant Function Market Makers -- 1 Introduction -- 2 Optimal Routing -- 2.1 Constant Function Market Makers -- 3 An Efficient Algorithm -- 3.1 Dual Decomposition -- 3.2 The Dual Problem -- 3.3 Solving the Dual Problem -- 4 Swap Markets -- 4.1 General Swap Markets -- 5 Implementation -- 5.1 Markets -- 5.2 Utility Functions -- 6 Numerical Results -- 7 Conclusion -- A Closed Form Solutions -- References -- Attack Techniques, Defenses, and Attack Case Studies -- Leveraging the Verifier's Dilemma to Double Spend in Bitcoin -- 1 Introduction -- 2 Related Work -- 3 System Model -- 3.1 Bitcoin Mining and the Verifier's Dilemma -- 3.2 Miner Categories -- 4 Attack Overview -- 4.1 Intuition -- 4.2 Interplay Between the Two Private Chains -- 5 The Dual Private Chains Attack -- 5.1 Perishing Mining -- 5.2 Combining Perishing Mining and Double Spending -- 5.3 Markov Decision Process of the DPC Attack. 6 Analysis Using Monte Carlo Simulations -- 6.1 Methodology and Settings -- 6.2 Impact of Perishing Mining on Chain Growth -- 6.3 Double Spending Success Rate -- 7 Attack Discussion -- 8 Conclusion -- References -- On the Sustainability of Bitcoin Partitioning Attacks -- 1 Introduction -- 2 Related Work -- 2.1 Erebus: A Stealthy Single-Node Partitioning Attack -- 2.2 SyncAttack: A P2P Network Splitting Attack -- 2.3 Bitcoin Partitioning Attacks Using Routing Manipulation -- 3 Re-evaluating Existing Partitioning Attacks -- 3.1 Re-evaluation of the Original Erebus Attack -- 3.2 Re-evaluation of the Original SyncAttack -- 4 Optimization and Cost Analysis -- 4.1 Optimization of Two Original Attacks -- 4.2 Cost Analysis of the Optimized Attacks -- 5 Conclusion -- References -- Demystifying Web3 Centralization: The Case of Off-Chain NFT Hijacking -- 1 Introduction -- 2 Related Work -- 3 Modeling NFT Functionality -- 3.1 Data and Interfaces -- 3.2 NFT Life Cycle -- 4 System Architecture and Attack Taxonomy -- 4.1 Architecture Type I: Fully Decentralized -- 4.2 Architecture Type II: Centralized Asset Storage -- 4.3 Architecture Type III: Centralized NFTM -- 4.4 Architecture Type IV: Centralized Ownership Registry -- 5 Attack Validation -- 6 Vulnerabilities of Real-World Entities -- 7 Conclusion -- References -- Defending Against Free-Riders Attacks in Distributed Generative Adversarial Networks -- 1 Introduction -- 2 Background on MD-GAN and Free-Riders -- 2.1 Preliminaries on MD-GAN -- 2.2 Free-Rider Adversarial Model -- 3 Free-Rider Attacks in MD-GAN -- 3.1 Attacks -- 3.2 Empirical Analysis on CIFAR-100 -- 4 Defending MD-GAN Against Free-Riders -- 4.1 Protocol of DFG for MD-GAN -- 5 Experimental Evaluation -- 5.1 Experimental Setup -- 5.2 Evaluation Metrics -- 5.3 Evaluation Results -- 6 Related Work -- 7 Conclusion -- References. Empirical Studies and more Decentralized Finance -- Dissecting Bitcoin and Ethereum Transactions: On the Lack of Transaction Contention and Prioritization Transparency in Blockchains -- 1 Introduction -- 2 Related Work -- 3 On Contention Transparency -- 3.1 The Rise of Private Relay Networks -- 3.2 Characterizing Private Relay Networks -- 3.3 On Preferential Treatment of Private Transactions -- 4 On Prioritization Transparency -- 4.1 Prevalence of Transaction Bundling -- 4.2 Side Channel (dark-Fee) Payments and Transaction Acceleration -- 5 Concluding Discussion -- Appendix 1 Ethereum Private Transaction Experiment -- Appendix 2 Bitcoin Transaction Acceleration Experiment -- References -- Forsage: Anatomy of a Smart-Contract Pyramid Scheme -- 1 Introduction -- 1.1 Main Study Results -- 1.2 Summary of Contributions -- 2 Background -- 3 Forsage Overview -- 4 Measurement Study -- 4.1 Scheme Statistics -- 4.2 Account Behavior and Profitability -- 5 Study of Forsage Community -- 5.1 Forsage User Geography -- 6 Related Work -- 7 Conclusion -- References -- Understanding Polkadot Through Graph Analysis: Transaction Model, Network Properties, and Insights -- 1 Introduction -- 2 Related Work -- 3 Modeling the Polkadot Transaction Graph -- 3.1 Polkadot Transactions -- 3.2 Polkadot Transaction Graph -- 4 Building the Transaction Graph -- 5 Transaction Graph Analysis -- 6 Statistical Analysis of Self-loop Transactions -- 7 Analysis of Polkadot Accounts' Balance -- 8 Discussion -- 9 Conclusion and Future Work -- References -- Short Paper: Estimating Patch Propagation Times Across Blockchain Forks -- 1 Introduction -- 2 Measuring Patch Propagation Times in Git -- 2.1 Git Operations -- 2.2 Extracting Rebase Timing -- 3 Methodology and Evaluation -- 3.1 Dataset -- 3.2 Validation of GitWatch -- 3.3 Evaluation Results -- 4 Case Studies -- 5 Conclusion -- References. Game Theory and Protocols -- DeFi and NFTs Hinder Blockchain Scalability -- 1 Introduction -- 2 Related Work -- 3 Background -- 3.1 Ethereum Transaction Execution -- 3.2 Decentralized Finance Smart Contracts -- 4 Data Collection -- 5 Ethereum Mainnet Workload -- 6 Transaction Graph Representation -- 6.1 Disentangled Transaction Graph Representation -- 7 Parallelizability -- 7.1 Parallelizability over Time -- 7.2 Current Limits of Parallelizability -- 8 Discussion and Conclusion -- References -- Cryptoeconomic Security for Data Availability Committees -- 1 Introduction -- 2 Model -- 3 The Optimal Contract -- 4 Analysis -- 4.1 Contract Properties -- 4.2 Analysis of the Optimal Contract -- 4.3 Analysis of the Dynamic Game -- 5 Evaluation -- 6 Discussion and Future Work -- References -- Kadabra: Adapting Kademlia for the Decentralized Web -- 1 Introduction -- 2 Background -- 2.1 Kademlia -- 2.2 Lookup Latency and Node Geography -- 2.3 Security in Kademlia -- 3 System Model -- 4 Kadabra -- 4.1 Overview -- 4.2 Scoring Function -- 4.3 Random Exploration -- 5 Evaluation -- 5.1 Experiment Setup -- 5.2 Results -- 6 Related Work -- 7 Conclusion -- References -- Optimality Despite Chaos in Fee Markets -- 1 Introduction -- 2 Background and Related Work -- 3 Model and Notation -- 4 Fee Market Mechanisms: Base Fee Update Rules -- 4.1 Proper Base Fee Update Rules -- 4.2 Examples of PBFURs -- 5 Analysis: Bounds on Average Block Sizes -- 5.1 EIP-1559 -- 5.2 Visualizations: Bifurcation Diagrams and Long-Term Averages -- 5.3 Exponential EIP-1559 -- 6 Discussion -- 7 Conclusions -- References -- Author Index. |
| Record Nr. | UNISA-996565867003316 |
Baldimtsi Foteini
|
||
| Cham : , : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Financial Cryptography and Data Security : 27th International Conference, FC 2023, Bol, Brač, Croatia, May 1-5, 2023, Revised Selected Papers, Part I
| Financial Cryptography and Data Security : 27th International Conference, FC 2023, Bol, Brač, Croatia, May 1-5, 2023, Revised Selected Papers, Part I |
| Autore | Baldimtsi Foteini |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Cham : , : Springer, , 2024 |
| Descrizione fisica | 1 online resource (386 pages) |
| Disciplina | 005.824 |
| Altri autori (Persone) | CachinChristian |
| Collana | Lecture Notes in Computer Science Series |
| ISBN | 3-031-47754-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Contents - Part I -- Contents - Part II -- Consensus -- Executing and Proving Over Dirty Ledgers -- 1 Introduction -- 2 Preliminaries -- 2.1 Related Work -- 2.2 Model and Assumptions -- 2.3 Problem Definition -- 3 Overview of the Protocols -- 4 Protocols -- 4.1 Horizontal Sampling -- 4.2 Proof-of-Stake Settings -- 5 Light Clients Protocol -- 6 Data Availability -- 7 Summary of Terminologies -- 8 Conclusion -- References -- Byzantine Generals in the Permissionless Setting -- 1 Introduction -- 1.1 Related Work -- 2 The Framework -- 2.1 The Computational Model -- 2.2 The Resource Pool and the Permitter -- 2.3 Defining the Timed/Untimed, Sized/Unsized and Single/Multi-permitter Settings -- 2.4 The Adversary -- 2.5 The Permissioned Setting -- 3 Byzantine Generals in the Synchronous Setting -- 3.1 The Impossibility of Deterministic Consensus in the Permissionless Setting -- 3.2 Probabilistic Consensus -- 4 Byzantine Generals with Partially Synchronous Communication -- 5 Concluding Comments -- References -- The Unique Chain Rule and Its Applications -- 1 Introduction -- 1.1 An Informal Exposition of Key Ideas -- 1.2 Related Work -- 2 Preliminaries -- 3 Unique Chain Rule (UCR) -- 4 Apollo Protocol -- 4.1 Overview -- 4.2 Handling Faults -- 5 Artemis Protocol -- 5.1 Steady-State Protocol -- 5.2 Handling Byzantine Behavior -- 6 Publicly Verifiable SMR -- References -- Player-Replaceability and Forensic Support Are Two Sides of the Same (Crypto) Coin -- 1 Introduction -- 2 Model and Definitions -- 3 Main Results -- 3.1 Warmup: HotStuff Made Player-Replaceable -- 3.2 Construction of a Player-Replaceable BFT Protocol with Strong Forensic Support -- 3.3 Forensic Protocol and Proof of Forensic Support -- 4 Forensic Analysis for Player-Replaceable Longest-Chain Protocols -- 4.1 Protocol Description.
4.2 Forensic Support for OBFT -- 4.3 Forensic Support for Ouroboros and Praos -- 5 Discussion and Conclusion -- References -- Cryptographic Protocols -- Synchronous Perfectly Secure Message Transmission with Optimal Asynchronous Fallback Guarantees -- 1 Introduction -- 1.1 Motivation -- 1.2 Technical Overview -- 1.3 Related Work -- 2 Preliminaries -- 2.1 Model -- 2.2 Definitions -- 3 Secure Message Transmission with Fallback -- 3.1 Compiler -- 3.2 Synchronous RMT with Asynchronous Detection -- 3.3 Synchronous SMT with Asynchronous Detection -- 3.4 Asynchronous SMT -- 4 Impossibility Result -- 5 Round-Efficient Synchronous SMT with Sub-optimal Trade-Off -- 6 Conclusions -- 6.1 Putting Things Together -- References -- Optimally-Fair Exchange of Secrets via Delay Encryption and Commutative Blinding -- 1 Introduction -- 1.1 Our Contribution and Related Work -- 2 Preliminaries -- 2.1 Notation -- 2.2 Symmetric Encryption and Hashing -- 2.3 Delay Encryption -- 2.4 Commutative Blinding -- 2.5 Fair Exchange -- 3 Protocol -- 3.1 Protocol Overview -- 3.2 Security Requirements -- 3.3 Commutative Blinding and Why It Is Needed -- 4 Analysis -- 4.1 Adversarial Model -- 4.2 Fairness -- 4.3 Optimality -- 4.4 Catching Active Cheaters -- 5 Conclusion and Future Research -- References -- Witness-Authenticated Key Exchange, Revisited: Extensions to Groups, Improved Models, Simpler Constructions -- 1 Introduction -- 2 WAKE: Game-Based Definition -- 3 A General Compiler to Witness-Authentication -- 4 Two-Round Group WAKE -- References -- On the Correlation Complexity of MPC with Cheater Identification -- 1 Introduction -- 1.1 Contributions and Techniques -- 1.2 Related and Concurrent Work -- 1.3 Technical Overview -- References -- TALUS: Reinforcing TEE Confidentiality with Cryptographic Coprocessors -- 1 Introduction -- 2 Background. 2.1 Intel Software Guard eXtension (SGX) -- 2.2 Trusted Platform Module (TPM) -- 3 Requirements Analysis -- 4 High-Level TALUS Overview -- 4.1 Threat Model -- 4.2 Design of TALUS -- 5 TALUS Implementation -- 5.1 Connecting SGX and TPM -- 5.2 Porting SGX Functionality to TPM -- 5.3 Limitations of the TALUS Implementation -- 6 Case Studies -- 6.1 TALUS-Backed Enclave Management -- 6.2 Impeding Microarchitectural Attacks -- 7 Other Platforms -- 8 Conclusion -- References -- Practical Construction for Secure Trick-Taking Games Even with Cards Set Aside -- 1 Introduction -- 2 Technical Overview -- 2.1 Rules of Trick-Taking Games: The Example of Spades -- 2.2 The Particularity of French Tarot -- 2.3 An Overview of Our Protocols -- 3 Cryptographic Tools -- 4 Models for Trick-Taking Game Revisited -- 4.1 Formal Definitions of Trick-Taking Scheme and Protocol -- 4.2 Security Properties -- 5 Our Spades Protocol -- 6 Our French Tarot's Protocol -- 7 Conclusion -- References -- Signature for Objects: Formalizing How to Authenticate Physical Data and More -- 1 Introduction -- 1.1 Our Contribution -- 1.2 Related Works -- 2 Preliminaries -- 2.1 Digital Signature -- 2.2 Obfuscation -- 3 Signature for Objects: Definition and Basic Construction -- 3.1 Object Setting -- 3.2 Algorithms that Can Interact with Physical Objects -- 3.3 Signature for Objects -- 3.4 Basic Construction -- 4 Conf-COA Security and Construction -- 4.1 Security Definition: Conf-COA -- 4.2 Our Construction Based on Obfuscation -- 4.3 Instantiation -- References -- The Superlinearity Problem in Post-quantum Blockchains -- 1 Introduction -- 1.1 Technical Overview -- 1.2 Summary of Contributions -- 2 The Quantum Superlinearity Problem Is Inherent -- 2.1 A Broad Definition of Proofs of Work -- 2.2 Impossibility Result -- 3 Towards Bypassing the Superlinearity Problem. 4 A New Proof of Work in a Random Beacon Model -- 4.1 Challenges of Protocol Integration -- 5 Conclusion -- References -- Fair Delivery of Decentralised Randomness Beacon -- 1 Introduction -- 1.1 Related Works -- 1.2 Our Contributions -- 2 Model -- 2.1 System Model -- 2.2 Components of DRBs -- 2.3 Security Properties of DRBs -- 2.4 Performance Metrics -- 3 Delivery-Fairness Property -- 3.1 Defining Delivery-Fairness -- 3.2 Lower Bound of Delivery-Fairness -- 4 Delivery-Fairness Analysis of Existing DRBs -- 4.1 Drand -- 4.2 HydRand and GRandPiper -- 4.3 SPURT -- References -- Bicorn: An Optimistically Efficient Distributed Randomness Beacon -- 1 Introduction -- 2 Overview -- 2.1 Protocol Outline -- 2.2 Bicorn-ZK: Using Zero-Knowledge Proofs -- 2.3 Bicorn-PC: Using Precommitment -- 2.4 Bicorn-RX: Using Pseudorandom Exponents -- 2.5 Comparison -- 3 Preliminaries -- 4 Timed DRBs: Syntax and Security Definitions -- 5 Security of Bicorn-RX -- 6 Implementation -- 7 Discussion -- References -- McFly: Verifiable Encryption to the Future Made Practical -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Technical Overview -- 1.3 Related Work -- 1.4 Contents -- 1.5 Preliminaries -- 2 Signature-Based Witness Encryption -- 2.1 Construction -- 3 The McFly Protocol -- 3.1 Formal Model and Guarantees -- 3.2 Protocol Description -- References -- Eagle: Efficient Privacy Preserving Smart Contracts -- 1 Introduction -- 2 Preliminaries -- 2.1 Security Model and Building Blocks -- 2.2 Ledgers and Smart Contracts -- 2.3 Confidential Ledgers from FLedger -- 3 Confidential Contracts -- 3.1 Realizing the Confidential Contract Functionality -- 4 Efficiency -- References -- Provably Avoiding Geographic Regions for Tor's Onion Services -- 1 Introduction -- 2 Background and Related Work -- 2.1 Threat Model -- 3 DeTorOS Design -- 3.1 DeTorOS Overview. 3.2 DeTorOS Never-Once function -- 3.3 DeTorOS Never-Twice function -- 3.4 Ensuring Correctness of Input Data -- 4 Security Analysis -- 5 Evaluation -- 5.1 Never-Once -- 5.2 Never-Twice -- 5.3 Performance -- 6 Discussion and Future Work -- 7 Ethical Considerations -- 8 Conclusion -- References -- Decentralized Finance -- R2: Boosting Liquidity in Payment Channel Networks with Online Admission Control -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Related Work -- 2 Model -- 3 Algorithmic Building Blocks -- 4 Unidirectional Transaction Stream Without Rejection -- 5 Unidirectional Transaction Stream with Rejection -- 6 Bidirectional Transaction Stream -- 7 Empirical Evaluation -- 8 Conclusion -- References -- Complexity-Approximation Trade-Offs in Exchange Mechanisms: AMMs vs. LOBs*-14pt -- 1 Introduction -- 1.1 Literature Review -- 2 Model -- 2.1 Model Primitives -- 2.2 Price Discovery and Budget Balance -- 3 Exchange Description Complexity and Examples -- 4 Complexity - Approximation Trade-Offs -- 4.1 Notions of Approximation -- 4.2 Upper and Lower Bounds -- 5 Uniswap V3 -- 6 Proofs -- 6.1 Proof of Theorem 1 -- 6.2 Proof of Theorem 2 -- 6.3 Proof of Theorem 3 -- A Deferred Proofs of Section2.2 -- References -- Mitigating Decentralized Finance Liquidations with Reversible Call Options*-6pt -- 1 Introduction -- 2 Background -- 2.1 Blockchain and Smart Contract -- 2.2 Decentralized Finance -- 2.3 Lending/Borrowing in DeFi -- 2.4 Call Options -- 3 Preliminaries -- 3.1 Collateralized Debt Model -- 3.2 Fixed Spread Liquidation -- 4 Motivation -- 5 Miqado -- 5.1 Reversible Call Option -- 5.2 The Miqado Protocol -- 5.3 Pricing Reversible Call Option -- 5.4 Practical Instantiation -- 5.5 Remarks -- 6 Empirical Evaluation -- 6.1 Quantifying Liquidation Spiral -- 6.2 Miqado Evaluation -- 7 Related Work -- 8 Conclusion -- A Black-Scholes Model -- B Tables. References. |
| Record Nr. | UNISA-996565867303316 |
|
Baldimtsi Foteini
|
||
| Cham : , : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Financial Cryptography and Data Security : 27th International Conference, FC 2023, Bol, Brač, Croatia, May 1-5, 2023, Revised Selected Papers, Part II
| Financial Cryptography and Data Security : 27th International Conference, FC 2023, Bol, Brač, Croatia, May 1-5, 2023, Revised Selected Papers, Part II |
| Autore | Baldimtsi Foteini |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Cham : , : Springer, , 2024 |
| Descrizione fisica | 1 online resource (371 pages) |
| Disciplina | 005.824 |
| Altri autori (Persone) | CachinChristian |
| Collana | Lecture Notes in Computer Science Series |
| ISBN | 3-031-47751-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Contents - Part II -- Contents - Part I -- Proof of X -- SNACKs for Proof-of-Space Blockchains -- 1 Introduction -- 2 Preliminaries -- 3 SNACKs for Proof-of-Space Blockchains -- 3.1 Proof-of-Space Blockchains -- 3.2 SNACKs for PoSpace Blockchains: An Overview -- 3.3 SNACK for PoSpace Blockchains: The Main Construction -- References -- Proof of Necessary Work: Succinct State Verification with Fairness Guarantees -- 1 Introduction -- 2 Proof of Necessary Work -- 2.1 Amortization Resistance and Efficiency -- 3 Implications for Nakamoto Consensus -- 4 Design and Instantiation -- 5 Related Work -- A Security Proofs -- References -- Proof of Availability and Retrieval in a Modular Blockchain Architecture -- 1 Introduction -- 2 Model -- 3 Modular SMR Architecture -- 3.1 The Proof of Availability and Retrieval Problem Definition -- 3.2 Atomic Broadcast -- 3.3 Execution -- 3.4 Bringing Them All Together -- 4 Proof of Availability and Retrieval Protocols -- 4.1 Erasure Coded PoA& -- R -- 5 Theoretical Analysis -- 5.1 One Sample Per Round -- 5.2 Sampling logn per Round -- 5.3 Sampling n per Round -- 5.4 Simulations -- References -- Limits on Revocable Proof Systems, With Implications for Stateless Blockchains -- 1 Introduction -- 2 Model -- 3 Main Result -- 3.1 No Useful Trade-Offs for Sublinear State Size -- 3.2 Persistence Requires Linear Storage -- 4 Implications for Authenticated Data Structures -- 4.1 Cryptographic Accumulators -- 4.2 Vector Commitments -- 4.3 Authenticated Dictionary -- 5 Implications for Blockchains -- 5.1 Interpreting Our Bound in Practice -- 5.2 Versioning Model -- 5.3 Partially Persistent Model -- 5.4 Proof-Serving Node Model -- References -- Layer 2 -- State Machines Across Isomorphic Layer 2 Ledgers -- 1 Introduction -- 2 Background -- 3 Overview -- 3.1 The Goal -- 3.2 Approach.
4 The Ad-Hoc Ledger State Machine -- 4.1 Setup -- 4.2 Atomic Transactions -- 4.3 Wrapping UTxO -- 4.4 Collateral -- 4.5 Dispute -- 4.6 Extensions -- 5 The Protocols -- 6 Analysis -- 7 Conclusion -- References -- Get Me Out of This Payment! Bailout: An HTLC Re-routing Protocol -- 1 Introduction -- 2 Building Blocks -- 3 The Bailout Protocol -- 3.1 Overview of Bailout -- 3.2 The Phases of Bailout -- 3.3 Security Discussion -- 4 Evaluation -- 5 Related Work -- References -- Extras and Premiums: Local PCN Routing with Redundancy and Fees -- 1 Introduction -- 2 Background and Related Work -- 2.1 Payment Channel Networks -- 2.2 State-of-the-Art PCN Routing Protocols -- 3 Our Protocol -- 3.1 System and Threat Model -- 3.2 Security Goals -- 3.3 Protocol Description -- 3.4 Fees -- 4 Evaluation -- 4.1 Routing Algorithms -- 4.2 Setup -- 4.3 Simulation Results -- 5 Conclusion -- References -- An Efficient Algorithm for Optimal Routing Through Constant Function Market Makers -- 1 Introduction -- 2 Optimal Routing -- 2.1 Constant Function Market Makers -- 3 An Efficient Algorithm -- 3.1 Dual Decomposition -- 3.2 The Dual Problem -- 3.3 Solving the Dual Problem -- 4 Swap Markets -- 4.1 General Swap Markets -- 5 Implementation -- 5.1 Markets -- 5.2 Utility Functions -- 6 Numerical Results -- 7 Conclusion -- A Closed Form Solutions -- References -- Attack Techniques, Defenses, and Attack Case Studies -- Leveraging the Verifier's Dilemma to Double Spend in Bitcoin -- 1 Introduction -- 2 Related Work -- 3 System Model -- 3.1 Bitcoin Mining and the Verifier's Dilemma -- 3.2 Miner Categories -- 4 Attack Overview -- 4.1 Intuition -- 4.2 Interplay Between the Two Private Chains -- 5 The Dual Private Chains Attack -- 5.1 Perishing Mining -- 5.2 Combining Perishing Mining and Double Spending -- 5.3 Markov Decision Process of the DPC Attack. 6 Analysis Using Monte Carlo Simulations -- 6.1 Methodology and Settings -- 6.2 Impact of Perishing Mining on Chain Growth -- 6.3 Double Spending Success Rate -- 7 Attack Discussion -- 8 Conclusion -- References -- On the Sustainability of Bitcoin Partitioning Attacks -- 1 Introduction -- 2 Related Work -- 2.1 Erebus: A Stealthy Single-Node Partitioning Attack -- 2.2 SyncAttack: A P2P Network Splitting Attack -- 2.3 Bitcoin Partitioning Attacks Using Routing Manipulation -- 3 Re-evaluating Existing Partitioning Attacks -- 3.1 Re-evaluation of the Original Erebus Attack -- 3.2 Re-evaluation of the Original SyncAttack -- 4 Optimization and Cost Analysis -- 4.1 Optimization of Two Original Attacks -- 4.2 Cost Analysis of the Optimized Attacks -- 5 Conclusion -- References -- Demystifying Web3 Centralization: The Case of Off-Chain NFT Hijacking -- 1 Introduction -- 2 Related Work -- 3 Modeling NFT Functionality -- 3.1 Data and Interfaces -- 3.2 NFT Life Cycle -- 4 System Architecture and Attack Taxonomy -- 4.1 Architecture Type I: Fully Decentralized -- 4.2 Architecture Type II: Centralized Asset Storage -- 4.3 Architecture Type III: Centralized NFTM -- 4.4 Architecture Type IV: Centralized Ownership Registry -- 5 Attack Validation -- 6 Vulnerabilities of Real-World Entities -- 7 Conclusion -- References -- Defending Against Free-Riders Attacks in Distributed Generative Adversarial Networks -- 1 Introduction -- 2 Background on MD-GAN and Free-Riders -- 2.1 Preliminaries on MD-GAN -- 2.2 Free-Rider Adversarial Model -- 3 Free-Rider Attacks in MD-GAN -- 3.1 Attacks -- 3.2 Empirical Analysis on CIFAR-100 -- 4 Defending MD-GAN Against Free-Riders -- 4.1 Protocol of DFG for MD-GAN -- 5 Experimental Evaluation -- 5.1 Experimental Setup -- 5.2 Evaluation Metrics -- 5.3 Evaluation Results -- 6 Related Work -- 7 Conclusion -- References. Empirical Studies and more Decentralized Finance -- Dissecting Bitcoin and Ethereum Transactions: On the Lack of Transaction Contention and Prioritization Transparency in Blockchains -- 1 Introduction -- 2 Related Work -- 3 On Contention Transparency -- 3.1 The Rise of Private Relay Networks -- 3.2 Characterizing Private Relay Networks -- 3.3 On Preferential Treatment of Private Transactions -- 4 On Prioritization Transparency -- 4.1 Prevalence of Transaction Bundling -- 4.2 Side Channel (dark-Fee) Payments and Transaction Acceleration -- 5 Concluding Discussion -- Appendix 1 Ethereum Private Transaction Experiment -- Appendix 2 Bitcoin Transaction Acceleration Experiment -- References -- Forsage: Anatomy of a Smart-Contract Pyramid Scheme -- 1 Introduction -- 1.1 Main Study Results -- 1.2 Summary of Contributions -- 2 Background -- 3 Forsage Overview -- 4 Measurement Study -- 4.1 Scheme Statistics -- 4.2 Account Behavior and Profitability -- 5 Study of Forsage Community -- 5.1 Forsage User Geography -- 6 Related Work -- 7 Conclusion -- References -- Understanding Polkadot Through Graph Analysis: Transaction Model, Network Properties, and Insights -- 1 Introduction -- 2 Related Work -- 3 Modeling the Polkadot Transaction Graph -- 3.1 Polkadot Transactions -- 3.2 Polkadot Transaction Graph -- 4 Building the Transaction Graph -- 5 Transaction Graph Analysis -- 6 Statistical Analysis of Self-loop Transactions -- 7 Analysis of Polkadot Accounts' Balance -- 8 Discussion -- 9 Conclusion and Future Work -- References -- Short Paper: Estimating Patch Propagation Times Across Blockchain Forks -- 1 Introduction -- 2 Measuring Patch Propagation Times in Git -- 2.1 Git Operations -- 2.2 Extracting Rebase Timing -- 3 Methodology and Evaluation -- 3.1 Dataset -- 3.2 Validation of GitWatch -- 3.3 Evaluation Results -- 4 Case Studies -- 5 Conclusion -- References. Game Theory and Protocols -- DeFi and NFTs Hinder Blockchain Scalability -- 1 Introduction -- 2 Related Work -- 3 Background -- 3.1 Ethereum Transaction Execution -- 3.2 Decentralized Finance Smart Contracts -- 4 Data Collection -- 5 Ethereum Mainnet Workload -- 6 Transaction Graph Representation -- 6.1 Disentangled Transaction Graph Representation -- 7 Parallelizability -- 7.1 Parallelizability over Time -- 7.2 Current Limits of Parallelizability -- 8 Discussion and Conclusion -- References -- Cryptoeconomic Security for Data Availability Committees -- 1 Introduction -- 2 Model -- 3 The Optimal Contract -- 4 Analysis -- 4.1 Contract Properties -- 4.2 Analysis of the Optimal Contract -- 4.3 Analysis of the Dynamic Game -- 5 Evaluation -- 6 Discussion and Future Work -- References -- Kadabra: Adapting Kademlia for the Decentralized Web -- 1 Introduction -- 2 Background -- 2.1 Kademlia -- 2.2 Lookup Latency and Node Geography -- 2.3 Security in Kademlia -- 3 System Model -- 4 Kadabra -- 4.1 Overview -- 4.2 Scoring Function -- 4.3 Random Exploration -- 5 Evaluation -- 5.1 Experiment Setup -- 5.2 Results -- 6 Related Work -- 7 Conclusion -- References -- Optimality Despite Chaos in Fee Markets -- 1 Introduction -- 2 Background and Related Work -- 3 Model and Notation -- 4 Fee Market Mechanisms: Base Fee Update Rules -- 4.1 Proper Base Fee Update Rules -- 4.2 Examples of PBFURs -- 5 Analysis: Bounds on Average Block Sizes -- 5.1 EIP-1559 -- 5.2 Visualizations: Bifurcation Diagrams and Long-Term Averages -- 5.3 Exponential EIP-1559 -- 6 Discussion -- 7 Conclusions -- References -- Author Index. |
| Record Nr. | UNINA-9910767528103321 |
|
Baldimtsi Foteini
|
||
| Cham : , : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Financial Cryptography and Data Security : 27th International Conference, FC 2023, Bol, Brač, Croatia, May 1-5, 2023, Revised Selected Papers, Part I
| Financial Cryptography and Data Security : 27th International Conference, FC 2023, Bol, Brač, Croatia, May 1-5, 2023, Revised Selected Papers, Part I |
| Autore | Baldimtsi Foteini |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Cham : , : Springer, , 2024 |
| Descrizione fisica | 1 online resource (386 pages) |
| Disciplina | 005.824 |
| Altri autori (Persone) | CachinChristian |
| Collana | Lecture Notes in Computer Science Series |
| ISBN | 3-031-47754-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Contents - Part I -- Contents - Part II -- Consensus -- Executing and Proving Over Dirty Ledgers -- 1 Introduction -- 2 Preliminaries -- 2.1 Related Work -- 2.2 Model and Assumptions -- 2.3 Problem Definition -- 3 Overview of the Protocols -- 4 Protocols -- 4.1 Horizontal Sampling -- 4.2 Proof-of-Stake Settings -- 5 Light Clients Protocol -- 6 Data Availability -- 7 Summary of Terminologies -- 8 Conclusion -- References -- Byzantine Generals in the Permissionless Setting -- 1 Introduction -- 1.1 Related Work -- 2 The Framework -- 2.1 The Computational Model -- 2.2 The Resource Pool and the Permitter -- 2.3 Defining the Timed/Untimed, Sized/Unsized and Single/Multi-permitter Settings -- 2.4 The Adversary -- 2.5 The Permissioned Setting -- 3 Byzantine Generals in the Synchronous Setting -- 3.1 The Impossibility of Deterministic Consensus in the Permissionless Setting -- 3.2 Probabilistic Consensus -- 4 Byzantine Generals with Partially Synchronous Communication -- 5 Concluding Comments -- References -- The Unique Chain Rule and Its Applications -- 1 Introduction -- 1.1 An Informal Exposition of Key Ideas -- 1.2 Related Work -- 2 Preliminaries -- 3 Unique Chain Rule (UCR) -- 4 Apollo Protocol -- 4.1 Overview -- 4.2 Handling Faults -- 5 Artemis Protocol -- 5.1 Steady-State Protocol -- 5.2 Handling Byzantine Behavior -- 6 Publicly Verifiable SMR -- References -- Player-Replaceability and Forensic Support Are Two Sides of the Same (Crypto) Coin -- 1 Introduction -- 2 Model and Definitions -- 3 Main Results -- 3.1 Warmup: HotStuff Made Player-Replaceable -- 3.2 Construction of a Player-Replaceable BFT Protocol with Strong Forensic Support -- 3.3 Forensic Protocol and Proof of Forensic Support -- 4 Forensic Analysis for Player-Replaceable Longest-Chain Protocols -- 4.1 Protocol Description.
4.2 Forensic Support for OBFT -- 4.3 Forensic Support for Ouroboros and Praos -- 5 Discussion and Conclusion -- References -- Cryptographic Protocols -- Synchronous Perfectly Secure Message Transmission with Optimal Asynchronous Fallback Guarantees -- 1 Introduction -- 1.1 Motivation -- 1.2 Technical Overview -- 1.3 Related Work -- 2 Preliminaries -- 2.1 Model -- 2.2 Definitions -- 3 Secure Message Transmission with Fallback -- 3.1 Compiler -- 3.2 Synchronous RMT with Asynchronous Detection -- 3.3 Synchronous SMT with Asynchronous Detection -- 3.4 Asynchronous SMT -- 4 Impossibility Result -- 5 Round-Efficient Synchronous SMT with Sub-optimal Trade-Off -- 6 Conclusions -- 6.1 Putting Things Together -- References -- Optimally-Fair Exchange of Secrets via Delay Encryption and Commutative Blinding -- 1 Introduction -- 1.1 Our Contribution and Related Work -- 2 Preliminaries -- 2.1 Notation -- 2.2 Symmetric Encryption and Hashing -- 2.3 Delay Encryption -- 2.4 Commutative Blinding -- 2.5 Fair Exchange -- 3 Protocol -- 3.1 Protocol Overview -- 3.2 Security Requirements -- 3.3 Commutative Blinding and Why It Is Needed -- 4 Analysis -- 4.1 Adversarial Model -- 4.2 Fairness -- 4.3 Optimality -- 4.4 Catching Active Cheaters -- 5 Conclusion and Future Research -- References -- Witness-Authenticated Key Exchange, Revisited: Extensions to Groups, Improved Models, Simpler Constructions -- 1 Introduction -- 2 WAKE: Game-Based Definition -- 3 A General Compiler to Witness-Authentication -- 4 Two-Round Group WAKE -- References -- On the Correlation Complexity of MPC with Cheater Identification -- 1 Introduction -- 1.1 Contributions and Techniques -- 1.2 Related and Concurrent Work -- 1.3 Technical Overview -- References -- TALUS: Reinforcing TEE Confidentiality with Cryptographic Coprocessors -- 1 Introduction -- 2 Background. 2.1 Intel Software Guard eXtension (SGX) -- 2.2 Trusted Platform Module (TPM) -- 3 Requirements Analysis -- 4 High-Level TALUS Overview -- 4.1 Threat Model -- 4.2 Design of TALUS -- 5 TALUS Implementation -- 5.1 Connecting SGX and TPM -- 5.2 Porting SGX Functionality to TPM -- 5.3 Limitations of the TALUS Implementation -- 6 Case Studies -- 6.1 TALUS-Backed Enclave Management -- 6.2 Impeding Microarchitectural Attacks -- 7 Other Platforms -- 8 Conclusion -- References -- Practical Construction for Secure Trick-Taking Games Even with Cards Set Aside -- 1 Introduction -- 2 Technical Overview -- 2.1 Rules of Trick-Taking Games: The Example of Spades -- 2.2 The Particularity of French Tarot -- 2.3 An Overview of Our Protocols -- 3 Cryptographic Tools -- 4 Models for Trick-Taking Game Revisited -- 4.1 Formal Definitions of Trick-Taking Scheme and Protocol -- 4.2 Security Properties -- 5 Our Spades Protocol -- 6 Our French Tarot's Protocol -- 7 Conclusion -- References -- Signature for Objects: Formalizing How to Authenticate Physical Data and More -- 1 Introduction -- 1.1 Our Contribution -- 1.2 Related Works -- 2 Preliminaries -- 2.1 Digital Signature -- 2.2 Obfuscation -- 3 Signature for Objects: Definition and Basic Construction -- 3.1 Object Setting -- 3.2 Algorithms that Can Interact with Physical Objects -- 3.3 Signature for Objects -- 3.4 Basic Construction -- 4 Conf-COA Security and Construction -- 4.1 Security Definition: Conf-COA -- 4.2 Our Construction Based on Obfuscation -- 4.3 Instantiation -- References -- The Superlinearity Problem in Post-quantum Blockchains -- 1 Introduction -- 1.1 Technical Overview -- 1.2 Summary of Contributions -- 2 The Quantum Superlinearity Problem Is Inherent -- 2.1 A Broad Definition of Proofs of Work -- 2.2 Impossibility Result -- 3 Towards Bypassing the Superlinearity Problem. 4 A New Proof of Work in a Random Beacon Model -- 4.1 Challenges of Protocol Integration -- 5 Conclusion -- References -- Fair Delivery of Decentralised Randomness Beacon -- 1 Introduction -- 1.1 Related Works -- 1.2 Our Contributions -- 2 Model -- 2.1 System Model -- 2.2 Components of DRBs -- 2.3 Security Properties of DRBs -- 2.4 Performance Metrics -- 3 Delivery-Fairness Property -- 3.1 Defining Delivery-Fairness -- 3.2 Lower Bound of Delivery-Fairness -- 4 Delivery-Fairness Analysis of Existing DRBs -- 4.1 Drand -- 4.2 HydRand and GRandPiper -- 4.3 SPURT -- References -- Bicorn: An Optimistically Efficient Distributed Randomness Beacon -- 1 Introduction -- 2 Overview -- 2.1 Protocol Outline -- 2.2 Bicorn-ZK: Using Zero-Knowledge Proofs -- 2.3 Bicorn-PC: Using Precommitment -- 2.4 Bicorn-RX: Using Pseudorandom Exponents -- 2.5 Comparison -- 3 Preliminaries -- 4 Timed DRBs: Syntax and Security Definitions -- 5 Security of Bicorn-RX -- 6 Implementation -- 7 Discussion -- References -- McFly: Verifiable Encryption to the Future Made Practical -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Technical Overview -- 1.3 Related Work -- 1.4 Contents -- 1.5 Preliminaries -- 2 Signature-Based Witness Encryption -- 2.1 Construction -- 3 The McFly Protocol -- 3.1 Formal Model and Guarantees -- 3.2 Protocol Description -- References -- Eagle: Efficient Privacy Preserving Smart Contracts -- 1 Introduction -- 2 Preliminaries -- 2.1 Security Model and Building Blocks -- 2.2 Ledgers and Smart Contracts -- 2.3 Confidential Ledgers from FLedger -- 3 Confidential Contracts -- 3.1 Realizing the Confidential Contract Functionality -- 4 Efficiency -- References -- Provably Avoiding Geographic Regions for Tor's Onion Services -- 1 Introduction -- 2 Background and Related Work -- 2.1 Threat Model -- 3 DeTorOS Design -- 3.1 DeTorOS Overview. 3.2 DeTorOS Never-Once function -- 3.3 DeTorOS Never-Twice function -- 3.4 Ensuring Correctness of Input Data -- 4 Security Analysis -- 5 Evaluation -- 5.1 Never-Once -- 5.2 Never-Twice -- 5.3 Performance -- 6 Discussion and Future Work -- 7 Ethical Considerations -- 8 Conclusion -- References -- Decentralized Finance -- R2: Boosting Liquidity in Payment Channel Networks with Online Admission Control -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Related Work -- 2 Model -- 3 Algorithmic Building Blocks -- 4 Unidirectional Transaction Stream Without Rejection -- 5 Unidirectional Transaction Stream with Rejection -- 6 Bidirectional Transaction Stream -- 7 Empirical Evaluation -- 8 Conclusion -- References -- Complexity-Approximation Trade-Offs in Exchange Mechanisms: AMMs vs. LOBs*-14pt -- 1 Introduction -- 1.1 Literature Review -- 2 Model -- 2.1 Model Primitives -- 2.2 Price Discovery and Budget Balance -- 3 Exchange Description Complexity and Examples -- 4 Complexity - Approximation Trade-Offs -- 4.1 Notions of Approximation -- 4.2 Upper and Lower Bounds -- 5 Uniswap V3 -- 6 Proofs -- 6.1 Proof of Theorem 1 -- 6.2 Proof of Theorem 2 -- 6.3 Proof of Theorem 3 -- A Deferred Proofs of Section2.2 -- References -- Mitigating Decentralized Finance Liquidations with Reversible Call Options*-6pt -- 1 Introduction -- 2 Background -- 2.1 Blockchain and Smart Contract -- 2.2 Decentralized Finance -- 2.3 Lending/Borrowing in DeFi -- 2.4 Call Options -- 3 Preliminaries -- 3.1 Collateralized Debt Model -- 3.2 Fixed Spread Liquidation -- 4 Motivation -- 5 Miqado -- 5.1 Reversible Call Option -- 5.2 The Miqado Protocol -- 5.3 Pricing Reversible Call Option -- 5.4 Practical Instantiation -- 5.5 Remarks -- 6 Empirical Evaluation -- 6.1 Quantifying Liquidation Spiral -- 6.2 Miqado Evaluation -- 7 Related Work -- 8 Conclusion -- A Black-Scholes Model -- B Tables. References. |
| Record Nr. | UNINA-9910767533703321 |
|
Baldimtsi Foteini
|
||
| Cham : , : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Proceedings of HotDep '13 : the 9th Workshop on Hot Topics in Dependable Systems : November 13, 2013, Nemacolin Woodlands Resort, (Farmington, PA, USA
| Proceedings of HotDep '13 : the 9th Workshop on Hot Topics in Dependable Systems : November 13, 2013, Nemacolin Woodlands Resort, (Farmington, PA, USA |
| Autore | Cachin Christian |
| Pubbl/distr/stampa | [Place of publication not identified], : ACM, 2013 |
| Descrizione fisica | 1 online resource (64 pages) |
| Collana | ACM Conferences |
| Soggetto topico |
Engineering & Applied Sciences
Computer Science |
| ISBN | 1-4503-2457-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Altri titoli varianti |
HotDep '13
Proceedings of the 9th Workshop on Hot Topics in Dependable Systems |
| Record Nr. | UNINA-9910375730703321 |
|
Cachin Christian
|
||
| [Place of publication not identified], : ACM, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Proceedings of the 39th Symposium on Principles of Distributed Computing / / Yuval Emek, Christian Cachin, editors
| Proceedings of the 39th Symposium on Principles of Distributed Computing / / Yuval Emek, Christian Cachin, editors |
| Pubbl/distr/stampa | New York, NY : , : Association for Computing Machinery, , 2020 |
| Descrizione fisica | 1 online resource (539 pages) : illustrations |
| Disciplina | 004.36 |
| Collana | ACM international conference proceedings series |
| Soggetto topico | Electronic data processing - Distributed processing |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910412062403321 |
| New York, NY : , : Association for Computing Machinery, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||