Passive image forgery detection methods that identify forgeries without prior knowledge have become a key research focus.In copy-move forgery,the assailant intends to hide a portion of an image by pasting other portio...
supported by Institute of Information&communications Technology Planning&Evaluation(IITP)grant funded by the Korea government(MSIT)(No.2022-0-00518,Blockchain privacy preserving techniques based on data encryption).
Afuzzy extractor can extract an almost uniformrandom string from a noisy source with enough entropy such as biometric data.To reproduce an identical key from repeated readings of biometric data,the fuzzy extractor gen...
Non-malleable extractor is an important tool for studying the problem of privacy amplification in classical and quantum cryptography with an active adversary. The randomness of the weakly-random source X before privac...
Project supported by the National Safety Academy Foundation(U1530107);National Natural Science Foundation of China(21476121,21636004);National Key Basic Research Program of China(2012CBA01203);Beijing Natural Science Foundation(2162020)
The extraction of low concentration rare earth elements at high phase ratio was investigated. The traditional extraction set-up, such as mixer-settler, have drawbacks of easy emulsification, difficult separation and l...
supported by National Natural Science Foundation of China (Grant Nos. NSFC61133014, NSFC61472114, NSFC61572318, NSFC61272440, NSFC61472251, U1536101, NSFC61502400);Foundation of Sichuan Educational Committee (Grant No. 16ZB0140);Natural Science Foundation of Anhui Science and Technology University (Grant No. ZRC2013380)
We present a new primitive of randomized message-locked encryption(MLE) in this paper and define a new security model for it. The new primitive, named message-locked encryption3(hereafter referred as MLE3),is actu...
partially supported by National Basic Research Program of China(973 program)(Grant No.2007CB311202);National Natural Science Foundation of China(Grant No.60970139);Strategic Priority Program of Chinese Academy of Sciences(Grant No.XDA06010702);IIEs Cryptography Research Project
Barak and Lindell showed that there exist constant-round zero-knowledge arguments of knowledge with strict polynomial-time extractors. This leaves the open problem of whether it is possible to obtain an analogous resu...
We briefly survey a number of important recent uchievements in Theoretical Computer Science (TCS), especially Computational Complexity Theory. We will discuss the PCP Theorem, its implications to inapproximability o...