Weizmann Institute of Science

Displaying 1-10 of 10 results

  • White Papers // Mar 2012

    On the Circular Security of Bit-Encryption

    Motivated by recent developments in fully homomorphic encryption, the authors consider the folklore conjecture that every semantically-secure bit-encryption scheme is circular secure, or in other words, that every bit-encryption scheme remains secure even when the adversary is given encryptions of the individual bits of the private-key. They show the following...

    Provided By Weizmann Institute of Science

  • White Papers // May 2011

    An Experimentally Verified Attack on Full Grain-128 Using Dedicated Recon figurable Hardware

    In this paper, the authors describe the first single-key attack which can break the full version of Grain-128 for arbitrary keys by an algorithm which is considerably faster than exhaustive search. It uses a new version of a cube tester, which uses an improved choice of dynamic variables to eliminate...

    Provided By Weizmann Institute of Science

  • White Papers // Mar 2011

    The Topology of Wireless Communication

    In This Paper the authors topological Properties of Wireless Communication Maps and Their Usability in Algorithmic Design. They consider the SINR Model, Which Compares the Received Power of a Signal at a Receiver Against the Sum of Strengths of Other Interfering Signals Plus Background Noise. To Describe the Behavior of...

    Provided By Weizmann Institute of Science

  • White Papers // Mar 2011

    Breaking Grain-128 With Dynamic Cube Attacks

    A well designed cipher is expected to resist all known cryptanalytic attacks, including distinguishing attacks and key recovery attacks. These two types of attacks are closely related since in many cases a distinguisher can be extended to a key recovery attack. Examples include many of the key-recovery attacks on iterated...

    Provided By Weizmann Institute of Science

  • White Papers // Feb 2011

    ALRED Blues: New Attacks on AES-Based MAC's

    The ALRED family of Message Authentication Codes (MAC's) is based on three principles: Using a keyless block cipher in CBC mode to process the message, choosing AES-128 as this cipher, and reducing the effective number of rounds to 4 in order to speed up the processing. In this paper the...

    Provided By Weizmann Institute of Science

  • White Papers // Jan 2011

    An Improved Algebraic Attack on Hamsi-256

    Hamsi is one of the 14 second-stage candidates in NIST's SHA-3 competition. The only previous attack on this hash function was a very marginal attack on its 256-bit version published by Thomas Fuhr at Asiacrypt 2010, which is better than generic attacks only for very short messages of fewer than...

    Provided By Weizmann Institute of Science

  • White Papers // Sep 2010

    A Framework for Efficient Signatures, Ring Signatures and Identity Based Encryption in the Standard Model

    In this paper, the authors present a generic framework for constructing efficient signature schemes, ring signature schemes, and identity based encryption schemes, all in the standard model (without relying on random oracles). They start by abstracting the recent work of Hohenberger and Waters (Crypto 2009), and specifically their "Prefix method"....

    Provided By Weizmann Institute of Science

  • White Papers // Jan 2010

    A Practical-Time Attack on the A5/3 Cryptosystem Used in Third Generation GSM Telephony

    The privacy and security of GSM cellular telephony is protected by the A5 family of cryptosystems. The first two members of this family, A5/1 (Developed primarily for European markets) and A5/2 (Developed primarily for export markets) were designed in the late 1980's in an opaque process and were kept secret...

    Provided By Weizmann Institute of Science

  • White Papers // Oct 2009

    Public-Key Encryption in the Bounded-Retrieval Model

    The authors construct the first public-key encryption scheme in the Bounded-Retrieval Model (BRM), providing security against various forms of adversarial "Key leakage" attacks. In this model, the adversary is allowed to learn arbitrary information about the decryption key, subject only to the constraint that the overall amount of "Leakage" is...

    Provided By Weizmann Institute of Science

  • White Papers // Jan 2009

    Un-Trusted-HB: Security Vulnerabilities of Trusted-HB

    With increased use of passive RFID tags, the need for secure lightweight identification protocols arose. HB+ is one such protocol, which was proven secure in the detection-based model, but shown breakable by man-in-the-middle attacks. Trusted-HB is a variant of HB+, specifically designed to resist man-in-the-middle attacks. In this paper, the...

    Provided By Weizmann Institute of Science

  • White Papers // Jan 2010

    A Practical-Time Attack on the A5/3 Cryptosystem Used in Third Generation GSM Telephony

    The privacy and security of GSM cellular telephony is protected by the A5 family of cryptosystems. The first two members of this family, A5/1 (Developed primarily for European markets) and A5/2 (Developed primarily for export markets) were designed in the late 1980's in an opaque process and were kept secret...

    Provided By Weizmann Institute of Science

  • White Papers // Mar 2011

    The Topology of Wireless Communication

    In This Paper the authors topological Properties of Wireless Communication Maps and Their Usability in Algorithmic Design. They consider the SINR Model, Which Compares the Received Power of a Signal at a Receiver Against the Sum of Strengths of Other Interfering Signals Plus Background Noise. To Describe the Behavior of...

    Provided By Weizmann Institute of Science

  • White Papers // Feb 2011

    ALRED Blues: New Attacks on AES-Based MAC's

    The ALRED family of Message Authentication Codes (MAC's) is based on three principles: Using a keyless block cipher in CBC mode to process the message, choosing AES-128 as this cipher, and reducing the effective number of rounds to 4 in order to speed up the processing. In this paper the...

    Provided By Weizmann Institute of Science

  • White Papers // Sep 2010

    A Framework for Efficient Signatures, Ring Signatures and Identity Based Encryption in the Standard Model

    In this paper, the authors present a generic framework for constructing efficient signature schemes, ring signature schemes, and identity based encryption schemes, all in the standard model (without relying on random oracles). They start by abstracting the recent work of Hohenberger and Waters (Crypto 2009), and specifically their "Prefix method"....

    Provided By Weizmann Institute of Science

  • White Papers // Jan 2011

    An Improved Algebraic Attack on Hamsi-256

    Hamsi is one of the 14 second-stage candidates in NIST's SHA-3 competition. The only previous attack on this hash function was a very marginal attack on its 256-bit version published by Thomas Fuhr at Asiacrypt 2010, which is better than generic attacks only for very short messages of fewer than...

    Provided By Weizmann Institute of Science

  • White Papers // Mar 2011

    Breaking Grain-128 With Dynamic Cube Attacks

    A well designed cipher is expected to resist all known cryptanalytic attacks, including distinguishing attacks and key recovery attacks. These two types of attacks are closely related since in many cases a distinguisher can be extended to a key recovery attack. Examples include many of the key-recovery attacks on iterated...

    Provided By Weizmann Institute of Science

  • White Papers // Oct 2009

    Public-Key Encryption in the Bounded-Retrieval Model

    The authors construct the first public-key encryption scheme in the Bounded-Retrieval Model (BRM), providing security against various forms of adversarial "Key leakage" attacks. In this model, the adversary is allowed to learn arbitrary information about the decryption key, subject only to the constraint that the overall amount of "Leakage" is...

    Provided By Weizmann Institute of Science

  • White Papers // Jan 2009

    Un-Trusted-HB: Security Vulnerabilities of Trusted-HB

    With increased use of passive RFID tags, the need for secure lightweight identification protocols arose. HB+ is one such protocol, which was proven secure in the detection-based model, but shown breakable by man-in-the-middle attacks. Trusted-HB is a variant of HB+, specifically designed to resist man-in-the-middle attacks. In this paper, the...

    Provided By Weizmann Institute of Science

  • White Papers // May 2011

    An Experimentally Verified Attack on Full Grain-128 Using Dedicated Recon figurable Hardware

    In this paper, the authors describe the first single-key attack which can break the full version of Grain-128 for arbitrary keys by an algorithm which is considerably faster than exhaustive search. It uses a new version of a cube tester, which uses an improved choice of dynamic variables to eliminate...

    Provided By Weizmann Institute of Science

  • White Papers // Mar 2012

    On the Circular Security of Bit-Encryption

    Motivated by recent developments in fully homomorphic encryption, the authors consider the folklore conjecture that every semantically-secure bit-encryption scheme is circular secure, or in other words, that every bit-encryption scheme remains secure even when the adversary is given encryptions of the individual bits of the private-key. They show the following...

    Provided By Weizmann Institute of Science