Sun Yat-sen University

Displaying 1-10 of 10 results

  • White Papers // Apr 2012

    On the Existence of Boolean Functions With Optimal Resistance Against Fast Algebraic Attacks

    Boolean functions used in stream ciphers should have large Algebraic Immunity (AI) in order to resist algebraic attacks. Constructing Boolean functions with the Maximum AI (MAI Boolean functions) and studying their cryptographic properties have been received attention for years. The existence of low degree multiples (or low degree annihilators) of...

    Provided By Sun Yat-sen University

  • White Papers // Apr 2012

    Robust Biometric-Based User Authentication Scheme for Wireless Sensor Networks

    Similarity coefficients play an important role in many application aspects. Recently, a privacy-preserving similarity coefficients protocol for binary data was proposed by Wong and Kim (Computers and Mathematics with Application 2012). In this paper, the authors show that their protocol is not secure, even in the semi-honest model, since the...

    Provided By Sun Yat-sen University

  • White Papers // Nov 2011

    A New Type of ID-Based Encryption System and Its Application to Pay-TV Systems

    The authors proposed a new type of ID-based encryption scheme. Their scheme is different from other schemes on that they use tamper resistant smart card to store the private key and do the decryption job for the users. The user knows nothing about the private key. Their scheme is identical...

    Provided By Sun Yat-sen University

  • White Papers // Nov 2011

    Analysis on Hu et al.'s Identity-Based Broadcast Encryption

    Broadcast Encryption (BE) provides a convenient method to distribute digital content to subscribers over an insecure broadcast channel so that only the qualified users can recover the data. Broadcast encryption is quite useful and enjoys many applications including pay-TV systems, distribution of copyrighted material, streaming audio/video, secure ad hoc routing...

    Provided By Sun Yat-sen University

  • White Papers // Jun 2011

    A DFA With Extended Character-Set for Fast Deep Packet Inspection

    Deep Packet Inspection (DPI), based on regular expressions, is expressive, compact, and efficient in specifying attack signatures. The authors focus on their implementations based on general-purpose processors that are cost-effective and flexible to update. In this paper, they propose a novel solution, called Deterministic Finite Automata with Extended Character-set (DFA/EC),...

    Provided By Sun Yat-sen University

  • White Papers // Mar 2011

    Traitor Tracing Against Public Collaboration (Full Version)

    Broadcast encryption provides a convenient method to distribute digital content to subscribers over an insecure broadcast channel. Traitor tracing is needed because some users may give out their decryption keys to construct pirate decoders. There are many traitor tracing schemes based on collusion secure codes and identifiable parent property codes....

    Provided By Sun Yat-sen University

  • White Papers // Feb 2011

    Turbo Codes Can Be Asymptotically Information-Theoretically Secure

    This paper shows that a turbo-coded communication system can be made secure with a little bit of complexity cost. The classical permutation ciphers are revisited and analyzed. Firstly, the ideal stream permutation ciphers are shown to be asymptotically information-theoretically secure in the sense that the channel from plaintext to ciphertext...

    Provided By Sun Yat-sen University

  • White Papers // Jan 2011

    Key-Exposure Free Chameleon Hashing and Signatures Based on Discrete Logarithm Systems

    Chameleon signatures simultaneously provide the properties of non-repudiation and non-transferability for the signed message. However, the initial constructions of chameleon signatures suffer from the problem of key exposure. This creates a strong disincentive for the recipient to forge signatures, partially undermining the concept of non-transferability. Recently, some specific constructions of...

    Provided By Sun Yat-sen University

  • White Papers // Sep 2010

    Homomorphic One-Way Function Trees and Application in Collusion-Free Multicast Key Distribution

    Efficient Multicast Key Distribution (MKD) is essential for secure multicast communications. Although Sherman et al. claimed that their MKD scheme - OFT (One-way Function Tree) achieves both perfect forward and backward secrecy, several types of collusion attacks on it still have been found. Solutions to prevent these attacks have also...

    Provided By Sun Yat-sen University

  • White Papers // Apr 2009

    Divisible On-line/Off-line Signatures

    On-line/Off-line signatures are used in a particular scenario where the signer must respond quickly once the message to be signed is presented. The idea is to split the signing procedure into two phases: the off-line and on-line phases. The signer can do some pre-computations in o-line phase before he sees...

    Provided By Sun Yat-sen University

  • White Papers // Sep 2010

    Homomorphic One-Way Function Trees and Application in Collusion-Free Multicast Key Distribution

    Efficient Multicast Key Distribution (MKD) is essential for secure multicast communications. Although Sherman et al. claimed that their MKD scheme - OFT (One-way Function Tree) achieves both perfect forward and backward secrecy, several types of collusion attacks on it still have been found. Solutions to prevent these attacks have also...

    Provided By Sun Yat-sen University

  • White Papers // Mar 2011

    Traitor Tracing Against Public Collaboration (Full Version)

    Broadcast encryption provides a convenient method to distribute digital content to subscribers over an insecure broadcast channel. Traitor tracing is needed because some users may give out their decryption keys to construct pirate decoders. There are many traitor tracing schemes based on collusion secure codes and identifiable parent property codes....

    Provided By Sun Yat-sen University

  • White Papers // Feb 2011

    Turbo Codes Can Be Asymptotically Information-Theoretically Secure

    This paper shows that a turbo-coded communication system can be made secure with a little bit of complexity cost. The classical permutation ciphers are revisited and analyzed. Firstly, the ideal stream permutation ciphers are shown to be asymptotically information-theoretically secure in the sense that the channel from plaintext to ciphertext...

    Provided By Sun Yat-sen University

  • White Papers // Jan 2011

    Key-Exposure Free Chameleon Hashing and Signatures Based on Discrete Logarithm Systems

    Chameleon signatures simultaneously provide the properties of non-repudiation and non-transferability for the signed message. However, the initial constructions of chameleon signatures suffer from the problem of key exposure. This creates a strong disincentive for the recipient to forge signatures, partially undermining the concept of non-transferability. Recently, some specific constructions of...

    Provided By Sun Yat-sen University

  • White Papers // Apr 2009

    Divisible On-line/Off-line Signatures

    On-line/Off-line signatures are used in a particular scenario where the signer must respond quickly once the message to be signed is presented. The idea is to split the signing procedure into two phases: the off-line and on-line phases. The signer can do some pre-computations in o-line phase before he sees...

    Provided By Sun Yat-sen University

  • White Papers // Jun 2011

    A DFA With Extended Character-Set for Fast Deep Packet Inspection

    Deep Packet Inspection (DPI), based on regular expressions, is expressive, compact, and efficient in specifying attack signatures. The authors focus on their implementations based on general-purpose processors that are cost-effective and flexible to update. In this paper, they propose a novel solution, called Deterministic Finite Automata with Extended Character-set (DFA/EC),...

    Provided By Sun Yat-sen University

  • White Papers // Nov 2011

    A New Type of ID-Based Encryption System and Its Application to Pay-TV Systems

    The authors proposed a new type of ID-based encryption scheme. Their scheme is different from other schemes on that they use tamper resistant smart card to store the private key and do the decryption job for the users. The user knows nothing about the private key. Their scheme is identical...

    Provided By Sun Yat-sen University

  • White Papers // Nov 2011

    Analysis on Hu et al.'s Identity-Based Broadcast Encryption

    Broadcast Encryption (BE) provides a convenient method to distribute digital content to subscribers over an insecure broadcast channel so that only the qualified users can recover the data. Broadcast encryption is quite useful and enjoys many applications including pay-TV systems, distribution of copyrighted material, streaming audio/video, secure ad hoc routing...

    Provided By Sun Yat-sen University

  • White Papers // Apr 2012

    On the Existence of Boolean Functions With Optimal Resistance Against Fast Algebraic Attacks

    Boolean functions used in stream ciphers should have large Algebraic Immunity (AI) in order to resist algebraic attacks. Constructing Boolean functions with the Maximum AI (MAI Boolean functions) and studying their cryptographic properties have been received attention for years. The existence of low degree multiples (or low degree annihilators) of...

    Provided By Sun Yat-sen University

  • White Papers // Apr 2012

    Robust Biometric-Based User Authentication Scheme for Wireless Sensor Networks

    Similarity coefficients play an important role in many application aspects. Recently, a privacy-preserving similarity coefficients protocol for binary data was proposed by Wong and Kim (Computers and Mathematics with Application 2012). In this paper, the authors show that their protocol is not secure, even in the semi-honest model, since the...

    Provided By Sun Yat-sen University