A5007965804- Cryptographic Implementations and Security
- Cloud Data Security Solutions
- Coding theory and cryptography
- Cryptography and Data Security
- graph theory and CDMA systems
- Chaos-based Image/Signal Encryption
- Security and Verification in Computing
- Complexity and Algorithms in Graphs
- Cloud Computing and Remote Desktop Technologies
- Physical Unclonable Functions (PUFs) and Hardware Security
- Advanced Data Storage Technologies
- Error Correcting Code Techniques
- Technology and Security Systems
- Digital Rights Management and Security
- Big Data Technologies and Applications
- Software Reliability and Analysis Research
- Data Quality and Management
- Software System Performance and Reliability
- Software Testing and Debugging Techniques
The University of Melbourne
2018-2021
Beijing Jiaotong University
2016
Central South University
2009
Central South University of Forestry and Technology
2009
To solve the combination explosion and undecidable problem on feasibility of complete computation paths when testing composed Web services programmed by business process execution language (BPEL), this paper presents a simple strategy for generating BPEL program an approach test data feasible based tabu search genetic algorithm (Tabu GA). Firstly, basic structure graph is built from open source tool BPEL4WS20WLS. Then converted to middle facilitating generate selected adequacy criteria,...
The previous threshold proxy re-signature schemes have been mainly constructed with bilinear maps, the implementations of which are much more time-consuming than exponentiation operations. To solve this problem, we propose efficient El-Gamal signatures. performance analysis shows that our existing schemes. Based on discrete logarithm provable secure in random oracle model.
Lightweight stream ciphers are highly demanded in IoT applications. In order to optimize the hardware performance, a new class of cipher has been proposed. The basic idea is employ single Galois NLFSR with maximum period construct cipher. As representative design this kind ciphers, Espresso based on 256-bit initialized by 128-bit key. $2^{256}-1$ assured because transformed from length LFSR. However, we propose Galois-to-Fibonacci transformation algorithm and successfully transform into...
In Sprout, a new design principle is proposed to resist the Time-Memory-Data Tradeoff (TMDTO) attack. The general idea involve secret key bits in keystream generation phase. A round function introduced determine involvement of bit at each clock. However, this turns out be main weakness design. recovery attack can easily mounted on Sprout. attacker able recover whole 80-bit with time complexity equivalent 269 encryptions. paper, we investigate fundamental mechanism divide-and-conquer based...