对一个理性秘密共享方案的改进

对一个理性秘密共享方案进行分析,发现此方案有两个问题：如果参与者进行欺骗,那么欺骗者能够以23的概率欺骗成功;秘密恢复阶段,参与者不能验证对方出示的子密钥是否正确,可能存在欺骗行为。对此,我们对方案进行了改进,新的方案能够解决上述问题。     

基于椭圆曲线的可验证的理性秘密共享方案

采用博弈论的方法,提出一种新的理性秘密共享方案.该方案具有以下特点:基于椭圆曲线密码体制,能检验出分发者和参与者的欺骗行为;在密钥重构阶段,不需要可信者参与;将真秘密放在一系列假秘密之中,参与者不知当前轮是否是测试轮;参与者偏离协议不如遵守协议的收益大,理性的参与者有动机遵守协议;最终每位参与者公平地得到秘密.分析表明方案是简单、公平和有效的.     

秘密共享在备份中的应用

为了保护密钥的安全性,本文将（t,n）门限秘密共享应用于资料备份中,实现了加密密钥的安全管理。该方案通过加密算法保证了用户备份文件的安全性,备份软件实现了资料的异地备份。     

基于Plncker坐标的秘密共享方案

基于Pliicker坐标这一数学中的重要概念，提出一个构造门限秘密共享方案的新方法.该方案不仅是安全的，并且几个著名的线性秘密共享方案都能够由Pliicker坐标表示.     

基于Plücker坐标的秘密共享方案(英文)

基于 Plücker坐标这一数学中的重要概念,提出一个构造门限秘密共享方案的新方法.该方案不仅是安全的,并且几个著名的线性秘密共享方案都能够由Plücker坐标表示.     

一种基于因数分解的动态密钥分存方案研究

本文给出了一种基于因数分解的动态（t,n）-门限方案,该方案具有如下特点：（1）系统在更新系统密钥时,无须更改每个成员的子密钥;（2）当某个成员的子密钥泄密时,系统只须为该成员重新分配子密钥而不必更改其他成员的子密钥;（3）当新成员加入时,系统只须为新成员分配一个子密钥,而其他成员不受任何影响;（4）子密钥可无限制地多次使用;（5）恢复系统密钥时,采用并行过程。     

基于可验证秘密分享机制的电子拍卖协议

介绍了一种基于PKI系统中的安全的密钥管理基础上的电子拍卖协议。利用秘密分享的方法来备份和恢复私钥,有效地维护了私钥的安全性,防止由一方单方面来独享私钥。并且,该方案采用了可验证的秘密分享协议有效地解决了分享者欺骗的问题,在一定范围里提高了电子拍卖中的安全性。     

公开可验证的秘密重新分配门限方案

建立了一个公开可验证秘密重新分配模型 ,并提出了一个公开可验证秘密重新分配方案 .这个方案将秘密从 (t1,n1)接入结构分配到 (t2 ,n2 )接入结构 .在对旧的份额和子份额的有效性进行检验后 ,新的分享者能产生有效的新份额 .在此方案中 ,新的分享者能验证其他分享者的子份额的有效性 .     

一个新的基于Plucker坐标的门限方案

给出了构造秘密共享方案的一般框架,同时给出了一个结构简单、易于操作的具体方案.     

一个新的基于Plcker坐标的门限方案(英文)

给出了构造秘密共享方案的一般框架 ,同时给出了一个结构简单、易于操作的具体方案     

Recognizing fake information through a developed feature scheme: A user study of health misinformation on social media in China

This study aims at helping people recognize health misinformation on social media in China. A scheme was first developed to identify the features of health misinformation on social media based on content analysis of 482 pieces of health information from WeChat, a social media platform widely used in China. This scheme was able to identify salient features of health misinformation, including exaggeration/absolutes, induced text, claims of being unique and secret, intemperate tone or language, and statements of excessive significance and likewise. The scheme was then evaluated in a user-centred experiment to test if it is useful in identifying features of health misinformation. Forty-four participants for the experimental group and 38 participants for the control group participated and finished the experiment, which compared the effectiveness of these participants in using the scheme to identify health misinformation. The results indicate that the scheme is effective in terms of improving users’ capability in health misinformation identification. The results also indicate that the participants’ capability of recognizing misinformation in the experimental group has been significantly improved compared to those of the control group. The study provides insights into health misinformation and has implications in enhancing people's online health information literacy. It informs the development of a system that can automatically limit the spread of health misinformation. Moreover, it potentially improves users’ online health information literacy, in particular, under the circumstances of the COVID-19 pandemic.     

乘性单调张成方案

乘性单调张成方案（或乘性的线性密钥共享体制）是设计安全多方计算协议的一个重要 工具。本文给出了一个单调张成方案（或线性密钥共享体制）具有乘性的充分必要条件，即通过判断 一个线性方程组是否有解可以确定一个单调张成方案是否具有乘性。作为例子，我们研究了Shamir的 门限密钥共享体制以及带权重的门限密钥共享体制，指出了它们具有乘性时所应具备的条件。     

Visually imperceptible image hiding scheme based on vector quantization

A novel visually imperceptible image hiding scheme based on VQ compression and LSB modification is introduced in this article. Multiple secret images can be simultaneously and imperceptibly hid into another cover image with the same image size by the proposed scheme. In order to reduce the volume of secret images to be hid, a codebook is first generated from the secret images and these images are encoded into binary indices by the vector quantization technique. Then the compressed data of secret images are embedded into the VQ codebook used in the encoding procedure by an adaptive least-significant-bits (LSB) modification technique. For the security purpose, the slightly modified codebook is further encrypted into a meaningless data stream by the DES cryptosystem. Finally, the encrypted codebook is embedded into the cover image using the greedy LSB modification technique. Simulation results show that the proposed scheme provides a good improvement in the visual quality of the extracted secret images and the cover image at the receiver. In addition, the proposed scheme provides better hiding capacity for the cover image than earlier works.     

适用于电子图书版权保护的可逆可见水印方案

现有众多电子图书版权系统不能较好权衡用户初步预览功能与电子图书版权保护之间的矛盾。在充分利用电子图书视觉特性的基础上,提出面向电子图书的可逆可见水印方案。该方案在保护电子图书版权的同时,可提供用户预订与预览功能,仅授权用户可去除可见水印而获得高清电子图书,其可较好地应用于数字图书馆中电子图书的版权保护与安全流通。     

一种基于一般接入结构的抗欺骗秘密共享体制

秘密共享体制是适用于保管极其重要信息的一种安全协议，其最大威胁是欺骗攻击，构造抗欺骗攻击的秘密共享体制具有重要意义。本文给出了一种有效构造方法，对于一般的接入结构也可以构造出抗欺骗攻击的体制，并且利用纠错编码的思想，使得体制的信息率有较大的提高。     

A robust APD synchronization scheme and its application to secure communication

This paper proposes a robust active-passive decomposition (APD) synchronization scheme. Compared with the original APD scheme, the robust APD scheme can effectively deal with the uncertainty in the master. Further, this scheme can also be applied to secure communication, where the hidden message can be recovered by the concept of equivalent control. Simulation results of Lorenz system verify the effectiveness of the proposed scheme.     

带容错性的门限签名方案

利用多方计算的方法 ,给出一个带容错性的门限签名方案 .从而使得一个门限签名方案即使在有恶意行为的情况下 ,仍可顺利地对消息进行有效的签名     

The performance of surgery in enlightenment France

During the 18th century, the reinvention of French surgery as a ‘monarchical profession’, in the words of Toby Gelfand, enabled the creation of an elite surgical knowledge from which uninstructed participants could be excluded. A link can be made between the types of resources used by surgeons to present themselves as expert healers, and the epistemological strategies of the operation. The sickbed was the scene of a performance, in which every actor's movements were described and constrained; the end product of an extended process of social negotiation, surgical training, physical restraint and submission.     

基于椭圆曲线的门限群数字签名机制的研究

本文结合椭圆曲线密钥短和(t,n)门限方案的特点,研究了一种基于椭圆曲线的多人同时签名并可验证的门限群数字签名算法,并分析了这个算法的安全性、可行性。