Coverart for item
The Resource Information Theoretic Security : 7th International Conference, ICITS 2013, Singapore, November 28-30, 2013, Proceedings

Information Theoretic Security : 7th International Conference, ICITS 2013, Singapore, November 28-30, 2013, Proceedings

Label
Information Theoretic Security : 7th International Conference, ICITS 2013, Singapore, November 28-30, 2013, Proceedings
Title
Information Theoretic Security
Title remainder
7th International Conference, ICITS 2013, Singapore, November 28-30, 2013, Proceedings
Creator
Subject
Language
eng
Cataloging source
MiAaPQ
Literary form
non fiction
Nature of contents
dictionaries
Information Theoretic Security : 7th International Conference, ICITS 2013, Singapore, November 28-30, 2013, Proceedings
Label
Information Theoretic Security : 7th International Conference, ICITS 2013, Singapore, November 28-30, 2013, Proceedings
Link
http://libproxy.rpi.edu/login?url=https://ebookcentral.proquest.com/lib/rpi/detail.action?docID=3101257
Publication
Copyright
Related Contributor
Related Location
Related Agents
Related Authorities
Related Subjects
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
  • Preface -- ICITS 2013 -- Workshop Track Presentations -- Contents -- How to Construct Strongly Secure Network Coding Scheme -- 1 Introduction -- 1.1 Related Works -- 2 Preliminaries -- 2.1 Linear Network Coding -- 2.2 k-Secure Linear Network Coding -- 2.3 Simple Proof of Proposition 2 -- 3 Strongly k-Secure Network Coding Scheme -- 3.1 Definition -- 3.2 Necessary and Sufficient Condition -- 4 How to Construct Strongly 1-Secure Scheme -- 4.1 How to Increase Hamming Weight -- 4.2 How to Make a NonZero Row -- 4.3 How to Construct 1-Secure Schemes -- 4.4 How to Construct Strongly 1-Secure Schemes -- 5 How to Construct Strongly k-Secure Schemes -- 5.1 D-Zero Projection of U -- 5.2 Construction of Strongly k-Secure Scheme -- 5.3 Example for k=2 -- References -- Secure Two-Party Computation: A Visual Way -- 1 Introduction -- 2 Definitions and Tools -- 2.1 Notation -- 2.2 Secure Two-Party Computation -- 3 Visual Gate Evaluation Secret Sharing -- 3.1 Secret Sharing and Multi-Secret Sharing Schemes -- 3.2 Visual Cryptography -- 3.3 GESS: Definition -- 3.4 A General Construction for GESS -- 3.5 Visual GESS -- 4 A Visual Two-Party Protocol -- 4.1 Physical Oblivious Transfer -- 4.2 Our Visual Two-Party Protocol -- 4.3 Efficiency and Implementation Details -- 5 A Simple Example -- 6 Conclusions -- References -- Measure-Independent Characterization of Contrast Optimal Visual Cryptography Schemes -- 1 Introduction -- 2 The Model -- 3 Contrast: Properties and Notions -- 4 Previous Results -- 4.1 Results About ns -- 4.2 Results About vv -- 4.3 Results About es -- 5 Optimal Contrast for (2,n)-Threshold Schemes -- 5.1 Value of w that Maximizes es -- 5.2 Value of w that Maximizes ns -- 5.3 Value of w that Maximizes vv for Schemes in Canonical Form -- 6 Contrast Optimal (n,n)-Threshold Schemes -- 7 Conclusions and Future Work -- References
  • On (k, n) Visual Cryptography Scheme with t Essential Parties -- 1 Introduction -- 2 Preliminaries -- 2.1 Basic Definitions -- 2.2 Previous Results -- 3 Our Work -- 3.1 Construction of VCS with t Essential Parties -- 3.2 Analysis of the Proposed VCS with t Essential Parties -- 4 Conclusion -- References -- New Lower Bounds for Privacy in Communication Protocols -- 1 Introduction -- 2 Preliminaries -- 2.1 Definitions of Privacy -- 3 Relations Between Privacy Notions and Communication -- 3.1 Relations Between the Different Notions of Privacy and Communication Complexity -- 3.2 Applications: Tight Bounds on PAR and PRIV for Specific Functions -- 4 New Lower Bound Techniques for PAR and PRIV of Deterministic Protocols -- 4.1 External PAR of Boolean Functions -- 4.2 External PAR for Non-boolean Functions -- 4.3 New Lower Bound Techniques for External IC -- 4.4 Applications: Tight Bounds on External PAR and PRIV for Specific Functions -- 5 Quality of the Two Definitions -- 5.1 Privacy for Deterministic Protocols -- References -- On the Transmit Beamforming for MIMO Wiretap Channels: Large-System Analysis -- 1 Introduction -- 2 System Model -- 3 Achievable Ergodic Secrecy Rate -- 4 Transmit Covariance Optimization -- 4.1 Water-Filling over the Main Channel -- 4.2 GSVD-Based Precoder -- 5 Numerical Results -- 6 Conclusions -- References -- Information Theoretic Security for Encryption Based on Conditional Rényi Entropies -- 1 Introduction -- 2 Conditional Rényi Entropies, Revisited -- 2.1 Preliminaries: Rényi Entropies and -Divergence -- 2.2 Definitions of Conditional Rényi Entropies -- 2.3 Fundamental Requirements for Conditional Rényi Entropies -- 3 Information Theoretic Inequalities for Rényi Entropies -- 3.1 Conditioning Reduces Entropy -- 3.2 Data Processing Inequality -- 3.3 Conditioned Monotonicity -- 3.4 Fano's Inequality
  • 4 Security Criteria Based on Conditional Rényi Entropies -- 4.1 Existing Lower Bounds on Secret-Keys -- 4.2 Lower Bounds on Failure Probability of Adversary's Guessing -- 5 Generalizing Shannon's Impossibility in Encryption -- 5.1 The Model and Security Definition -- 5.2 Basic Idea for Generalization of Shannon's Impossibility -- 5.3 Lower Bounds -- 5.4 Construction -- References -- Insider-Proof Encryption with Applications for Quantum Key Distribution -- 1 Introduction -- 1.1 Private Channels -- 1.2 QKD -- 1.3 Results -- 1.4 Organization of the Paper -- 2 The Private Channel -- 2.1 The Ideal Channel -- 2.2 The Channel -- 2.3 Security of the Channel -- 3 Application to DIQKD -- 3.1 The Model -- 3.2 The Protocol -- 3.3 Security of DIQKD Using an Insider-Proof Channel -- 3.4 Composing Rounds of the New Protocol -- 3.5 Asymptotic Secret Key Rate -- 4 Conclusions -- References -- Superposition Attacks on Cryptographic Protocols -- 1 Introduction -- 2 Preliminaries -- 2.1 Running Functions in Superposition -- 3 Secret Sharing -- 3.1 Two-Party Bit Sharing Example -- 3.2 Model for Secret Sharing -- 3.3 (In)security Against Superposition Attacks on Classical Secret-Sharing -- 3.4 Attacks on Secret Sharing -- 4 Quantum Secret Sharing -- 5 Zero-Knowledge -- 5.1 An Attack Against the Graph Isomorphism Protocol -- 5.2 A Superposition-Secure Zero-Knowledge Protocol -- 5.3 The Model -- 5.4 The Protocol -- 6 Multiparty Computation -- Overcoming Weak Expectations via the Rnyi Entropy and the Expanded Computational Entropy -- 1 Introduction -- 2 Preliminaries -- 3 Overcoming Weak Expectations via the Rnyi Entropy -- 4 Overcoming Weak Expectations via the Expanded Computational Entropy -- 5 Conclusion -- References -- Modulus Computational Entropy -- 1 Introduction -- 2 Preliminaries -- 2.1 Min Entropy -- 2.2 Indistinguishability
  • 3 Computational Entropy and Leakage - Previous Works -- 3.1 Defining Computational Entropy -- 3.2 Leakage Rules -- 4 Modulus Entropy -- 4.1 Leakage Chain Rule for Modulus Entropy -- 5 Passing to Modulus Entropy -- 5.1 Benefits of Using Modulus Entropy -- 6 Proofs of Conversion Results -- 6.1 Decomposable Entropy -- 6.2 The Samplability Assumption -- 6.3 Approximate Counting -- 6.4 Squared Indistinguishability -- References -- Broadcast (and Round) Efficient Verifiable Secret Sharing -- 1 Introduction -- 2 Model, Definitions and Tools -- 3 A Broadcast- and Round-Efficient VSS Protocol -- 3.1 A (3,0)-Broadcast, Constant-Round VSS Protocol -- 3.2 Further Reducing the Number of Broadcast Rounds -- 4 Summary and Open Problems -- Leakage Resilience of the Blom's Key Distribution Scheme -- 1 Introduction -- 2 Blom's Key Distribution Scheme -- 3 Leakage Attacks on the Blom's Scheme -- 4 Our Results -- 5 The Main Technical Lemma -- 5.1 Strong Two Source Extractors -- 5.2 Linear Algebra Tools -- 5.3 Proof of Lemma 1 -- 6 Proof of Theorem 1 -- 7 An Even Weaker Adversary -- References -- Detection of Algebraic Manipulation in the Presence of Leakage -- 1 Introduction -- 1.1 Problem Definition and Results -- 1.2 Discussion and Related Work -- 2 Notations and Preliminaries -- 3 LR-AMD Codes: Definitions -- 3.1 LLR-AMD Codes -- 3.2 BLR-AMD Codes -- 3.3 LR-AMD Code Optimality -- 4 Optimal LR-AMD Constructions -- 4.1 LLR-AMD Code Constructions -- 4.2 BLR-AMD Code Construction -- 4.3 Comparing the Three Constructions -- 5 Wiretap Channels: Manipulation Detection -- 5.1 Algebraic Manipulation -- 5.2 Unrestricted Manipulation -- 5.3 Wiretap Codes for Active Adversaries -- 6 Conclusion -- References -- Author Index
http://library.link/vocab/cover_art
https://contentcafe2.btol.com/ContentCafe/Jacket.aspx?Return=1&Type=S&Value=9783319042688&userID=ebsco-test&password=ebsco-test
Dimensions
unknown
http://library.link/vocab/discovery_link
{'f': 'http://opac.lib.rpi.edu/record=b4383648'}
Extent
1 online resource (270 pages)
Form of item
online
Isbn
9783319042688
Media category
computer
Media MARC source
rdamedia
Media type code
c
Sound
unknown sound
Specific material designation
remote

Library Locations

    • Folsom LibraryBorrow it
      110 8th St, Troy, NY, 12180, US
      42.729766 -73.682577
Processing Feedback ...