我的项目主题是防止篡改问题纸使用视觉密码。
防篡改问题纸 （新） 提供了一个非常安全的方法来隐藏文件在不同股票的问题。在此应用中，试卷的题目分解成 n 件，单独地产量没有关于试卷的题目的信息。问题，这些纸片被称为股票或阴影，然后可能分布在一组 n 参与者/经销商。通过结合任何 k 问题纸可以恢复这些股票，但结合小于 k 的他们不会透露任何信息关于问题的论文。在此方法中， 重建的问题本文基于 XOR 运算。这将启用一个回获得完
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.003124s ]
SELECT `a`.`aid`,`a`.`title`,`a`.`create_time`,`m`.`username` FROM `jrk_downrecords` `a` INNER JOIN `jrk_member` `m` ON `a`.`uid`=`m`.`id` WHERE `a`.`status` = 1 GROUP BY `a`.`aid` ORDER BY `a`.`create_time` DESC LIMIT 10 [ RunTime:0.102418s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.002047s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001873s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.002630s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003655s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.007770s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.006452s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.024905s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.002028s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 326925 [ RunTime:0.001133s ]
