Return to home page
Searching: Muskingum library catalog
Some OPAL libraries remain closed or are operating at reduced service levels. Materials from those libraries may not be requestable; requested items may take longer to arrive. Note that pickup procedures may differ between libraries. Please contact your library for new procedures, specific requests, or other assistance.
  Previous Record Previous Item Next Item Next Record
  Reviews, Summaries, etc...
Conference ISC (Conference : Information security) (22nd : 2019 : New York, N.Y.)
Title Information security : 22nd international conference, ISC 2019, New York City, NY, USA, September 16-18, 2019 : proceedings / Zhiqiang Lin, Charalampos Papamanthou, Michalis Polychronakis (eds.).
Imprint Cham : Springer, [2019]

View online
View online
Conference ISC (Conference : Information security) (22nd : 2019 : New York, N.Y.)
Series Lecture notes in computer science ; 11723.
LNCS sublibrary. SL 4, Security and cryptology.
Lecture notes in computer science ; 11723.
LNCS sublibrary. SL 4, Security and cryptology.
Subject Computer security -- Congresses.
Data encryption (Computer science) -- Congresses.
Alt Name Lin, Zhiqiang (Computer scientist),
Papamanthou, Charalampos,
Polychronakis, Michalis (Computer scientist),
Description 1 online resource : illustrations (some color).
polychrome rdacc
Note Online resource; title from PDF title page (SpringerLink, viewed September 16, 2019).
Includes author index.
Contents Intro; Preface; Organization; Contents; Attacks and Cryptanalysis; IBWH: An Intermittent Block Withholding Attack with Optimal Mining Reward Rate; 1 Introduction; 2 Related Work; 3 Preliminaries; 3.1 Block Withholding Attack; 3.2 Notations for the Reward Rate; 4 The Reward Rate of Block Withholding Attack Under Static Mining Power; 5 Intermittent Withholding Attack; 5.1 Reward Rate; 5.2 The Intermittent Block WithHolding (IBWH) Attack; 5.3 Discussion; 6 The Reward Rate of BWH and IBWH Under Dynamic Mining Power; 7 Evaluation; 8 Further Discussions
8.1 The Reward Rate of Fork After Withholding8.2 The Reward Rate of Selfish Mining; 9 Conclusion; References; Full Database Reconstruction with Access and Search Pattern Leakage; 1 Introduction; 1.1 Organization of the Paper; 1.2 Contributions; 2 Model and Problem Statement; 3 Related Work; 3.1 Context; 3.2 Previous Results; 4 Full Ordering Reconstruction; 4.1 Approach; 4.2 Algorithm; 4.3 Query Complexity Analysis; 4.4 Lower Bound; 4.5 Dense Databases; 4.6 Databases with Special Properties; 5 Full Database Reconstruction; 5.1 Example; 5.2 Algorithm; 5.3 Analysis; 6 Conclusions; References
Cube Cryptanalysis of Round-Reduced ACORN1 Introduction; 1.1 Our Contributions; 2 Preliminaries; 2.1 Cube Attacks and Cube Testers; 2.2 Numeric Mapping; 2.3 Mixed Integer Linear Programming; 2.4 Bit-Based Division Property and MILP Representation; 2.5 Bit-Based Division Property and Cube Attack; 3 A Brief Description of ACORN; 4 A New Method to Search Good Cube Testers; 4.1 Greedy Algorithm for Finding Cube Testers; 4.2 Accelerating the Greedy Algorithm via Numeric Mapping; 4.3 Applications to ACORN; 5 Searching Cubes in Division Property Based Cube Attack
5.1 Finding Cube Testers via Division Property Based Cube Attack5.2 Finding Cubes for Key Recovery Attacks; 5.3 Applications to ACORN; 6 Conclusions; A KSG128(t) and FBK128(t); B Proof of Theorem1; C Cube Testers of Different Dimensions; D Embedded Property; References; Crypto I: Secure Computation and Storage; Auditable Compressed Storage; 1 Introduction; 2 Background; 2.1 Compression Algorithms; 2.2 Related Work; 3 Model and Security Guarantees; 3.1 System Model; 3.2 Adversarial Model; 3.3 Security Guarantees; 4 Auditable Compressed Storage; 4.1 ACS-RLE Scheme; 4.2 ACS-HUFF Scheme
4.3 Differences Between ACS-RLE and ACS-HUFF5 Analysis; 5.1 Security; 5.2 Performance; 6 Conclusion; References; Decentralized Evaluation of Quadratic Polynomials on Encrypted Data; 1 Introduction; 1.1 Technical Contribution; 1.2 Applications; 2 Preliminaries; 2.1 Notations; 2.2 Bilinear Group Setting; 2.3 Computational Assumption; 2.4 Security Notions; 3 Encryption for Quadratic Polynomial Evaluation; 3.1 Freeman's Framework; 3.2 Optimized Version; 3.3 Security Properties; 4 Decentralized Homomorphic Encryption; 4.1 Decentralized Key Generation; 4.2 Distributed Decryption
ISBN 9783030302153 (electronic bk.)
3030302156 (electronic bk.)
ISBN/ISSN 10.1007/978-3-030-30215-3
OCLC # 1119668533

If you experience difficulty accessing or navigating this content, please contact the OPAL Support Team