menu
{ "item_title" : "Information Theoretic Security", "item_author" : [" Carles Padró "], "item_description" : "How to Construct Strongly Secure Network Coding Scheme.- Secure two-party computation: a visual way.- Measure-independent Characterization of Contrast Optimal Visual Cryptography Schemes.- On (k; n) visual cryptography scheme with t essential parties.- New Lower Bounds for Privacy in Communication Protocols.- On the Transmit Beamforming for MIMO Wiretap Channels: Large-System Analysis.- Information Theoretic Security for Encryption Based on Conditional Renyi Entropies.- Insider-proof encryption with applications for quantum key distribution.- Superposition Attacks on Cryptographic Protocols.- Overcoming Weak Expectations via the Renyi Entropy and the Expanded Computational Entropy.- Modulus Computational Entropy.- Broadcast (and Round) Efficient Verifiable Secret Sharing.- Leakage Resilience of the Blom's Key Distribution Scheme.- Detection of Algebraic Manipulation in the Presence of Leakage.", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/3/31/904/267/331904267X_b.jpg", "price_data" : { "retail_price" : "54.99", "online_price" : "54.99", "our_price" : "54.99", "club_price" : "54.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Information Theoretic Security|Carles Padró

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

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

How to Construct Strongly Secure Network Coding Scheme.- Secure two-party computation: a visual way.- Measure-independent Characterization of Contrast Optimal Visual Cryptography Schemes.- On (k; n) visual cryptography scheme with t essential parties.- New Lower Bounds for Privacy in Communication Protocols.- On the Transmit Beamforming for MIMO Wiretap Channels: Large-System Analysis.- Information Theoretic Security for Encryption Based on Conditional Renyi Entropies.- Insider-proof encryption with applications for quantum key distribution.- Superposition Attacks on Cryptographic Protocols.- Overcoming Weak Expectations via the Renyi Entropy and the Expanded Computational Entropy.- Modulus Computational Entropy.- Broadcast (and Round) Efficient Verifiable Secret Sharing.- Leakage Resilience of the Blom's Key Distribution Scheme.- Detection of Algebraic Manipulation in the Presence of Leakage.

This item is Non-Returnable

Details

  • ISBN-13: 9783319042671
  • ISBN-10: 331904267X
  • Publisher: Springer
  • Publish Date: February 2014
  • Dimensions: 9.21 x 6.14 x 0.57 inches
  • Shipping Weight: 0.85 pounds
  • Page Count: 259

Related Categories

You May Also Like...

    1

BAM Customer Reviews