Non-Interactive Zero-Knowledge(NIZK for short) proofs are fascinating and extremely useful in many security protocols. In this paper,a new group signature scheme,decisional linear assumption group signature(DLAGS for ...Non-Interactive Zero-Knowledge(NIZK for short) proofs are fascinating and extremely useful in many security protocols. In this paper,a new group signature scheme,decisional linear assumption group signature(DLAGS for short) with NIZK proofs is proposed which can prove and sign the multiple values rather than individual bits based on DLIN assumption. DLAGS does not need to interact between the verifier and issuer,which can decrease the communication times and storage cost compared with the existing interactive group signature schemes. We prove and sign the blocks of messages instead of limiting the proved message to only one bit(0 or 1) in the conventional non-interactive zero-knowledge proof system,and we also prove that our scheme satisfy the property of anonymity,unlinkability and traceability. Finally,our scheme is compared with the other scheme(Benoitt's scheme) which is also based on the NIZK proofs system and the DLIN assumption,and the results show that our scheme requires fewer members of groups and computational times.展开更多
This article is based on research on pre-service teachers＇ perspectives on their mathematics knowledge of proof in geometry. The study was framed using tile mathematical knowledge for teaching framework. This qualita...This article is based on research on pre-service teachers＇ perspectives on their mathematics knowledge of proof in geometry. The study was framed using tile mathematical knowledge for teaching framework. This qualitative study employed the use of a task-based worksheet, focus group sessions and semi-structured individual interviews. The task-based worksheet was completed by 180 pre-service mathematics teachers （second, third and fourth year mathematics education students）. Pre-service mathematics teachers are student teachers who have not yet completed their training to become teachers. After the analysis of the task-based worksheet, 20 participants were invited to participate in focus group sessions and individual interviews. The findings of the study reveal that the participants possess peripheral mathematics knowledge of proof in geometry. The study aims at assisting pre-service teachers and interested educationists to explore innovative methods of acquiring and imparting mathematics knowledge of proof in geometry. The study proposes possible changes in curriculum at school and university level.展开更多
针对目前格上环签名方案在环成员数量较多的情况下,签名效率低下且签名尺寸和公钥尺寸过大的问题,基于零知识证明,使用E-MLWE(extended module learning with errors)和MSIS(module short interger solution)问题降低了公钥大小,结合拒...针对目前格上环签名方案在环成员数量较多的情况下,签名效率低下且签名尺寸和公钥尺寸过大的问题,基于零知识证明,使用E-MLWE(extended module learning with errors)和MSIS(module short interger solution)问题降低了公钥大小,结合拒绝采样算法和追踪机制设计了一种可追踪环签名方案,签名算法中使用递归算法压缩了承诺的大小,进一步降低了签名尺寸,在随机预言机模型下证明方案满足可链接性、匿名性和抗陷害性。性能分析表明,签名尺寸与环成员数量为对数大小关系,在环成员数量较多时,公钥的存储开销和签名的通信开销具有明显优势。展开更多
V2X communication enables vehicles to share real-time traffic and road-condition data,but binding messages to persistent identifiers enables location tracking.Furthermore,since forged reports from malicious vehicles c...V2X communication enables vehicles to share real-time traffic and road-condition data,but binding messages to persistent identifiers enables location tracking.Furthermore,since forged reports from malicious vehicles can distort trust decisions and threaten road safety,privacy-preserving trust management is essential.Lu et al.previously presented BARS,an anonymous reputation mechanism founded on blockchain technology to establish a privacy-preserving trust architecture for V2X communication.In this system,reputation certificates without a vehicle identifier ensure anonymity,while two authorities jointly manage certificate issuance and reputation updates.However,the centralized certificate updates introduce scalability limitations,and the authorities can trace vehicle behavioral information,which threatens privacy guarantees.Several subsequent systems derived from BARS still rely on centralized certificate management and are subject to authority-side privacy leakage.As a result,a key challenge in this line of research remains unresolved:how to decentralize the certificate-update process while preserving privacy against the authorities in privacy-preservingV2X trustmanagement.In this paper,we propose a distributed anonymous reputation system for V2X communication,based on an anonymous reputation system for crowdsensing.In our proposed system for V2X communication,the server is distributed to a certificate authority(CA)and roadside units(RSUs).Each vehicle shows the reputation level to the nearest RSU at the beginning of each time interval,and registers a short-time public key.In the interval,the messages from the vehicle are authenticated under the public key and are scored.At the end of the interval,the nearest RSU updates the certificate anonymously.Our solution decentralizes the certificate-update process by assigning each update to the nearest RSU.A zero-knowledge-proof-based show protocol removes the need for any central authority to handle vehicle certificates and thus prevents the authorities from tracing vehicle activities.Compared with BARS,where centralized authorities must update the reputation certificates of many vehicles and may incur communication and processing delays,our system performs each update locally at the nearest RSUonce per interval.The required interaction consists only of a fewkilobytes of communication and a zero-knowledge proof that is almost fully precomputed on the vehicle side,while the RSU-side processing is estimated to take about 40 ms based on timingmeasurements of the underlying cryptographic operations.This distributed updatemodel avoids the centralized bottleneck of BARS and simultaneously removes the privacy risk arising from authority collusion.展开更多
大语言模型(Large Language Model,LLM)驱动的开放域问答(Open-Domain Question Answering,ODAQ)系统,如GIST(Generating Identifiers and Selecting chunks for Tables)框架,在处理海量表格数据时展现出巨大潜力,受到了广泛关注.然而,...大语言模型(Large Language Model,LLM)驱动的开放域问答(Open-Domain Question Answering,ODAQ)系统,如GIST(Generating Identifiers and Selecting chunks for Tables)框架,在处理海量表格数据时展现出巨大潜力,受到了广泛关注.然而,当ODQA系统需要整合多方私有表格数据进行Top-K候选筛选等环节时,传统方法需要访问全部原数据,这在数据隐私、计算透明度及参与方行为可信度方面面临挑战.虽然现有研究采用零知识证明和基于权益的机制实现了公开可验证性,但在大规模场景下生成和验证单个证明的开销过高,而传统的基于权益的机制在公平性和对动态环境的适应性方面也存在局限性.对此,本文基于多方安全计算(Multi-Party Computation,MPC)、可公开聚合审计与动态信誉机制,提出了一种面向LLM开放域问答中多方私有表格筛选的增强方法.将Top-K多方私有表格筛选过程通过MPC完成,以保护多方私有数据隐私.同时,引入高效的聚合审计机制,将零知识证明技术与随机抽样、聚合证明构造、基于时间窗口的批处理和错误定位相结合,确保评分与排序过程的正确性可以被批量、公开验证.基于区块链的动态信誉反馈机制的集成也增强了系统的公平性,并约束了恶意行为.实验评估表明,本文的Top-K候选筛选方法在保证隐私的同时与GIST原有筛选方法在结果上达到0.91的Top-50平均召回率和0.83的平均Jaccard指数,具有高度一致性,不会影响ODQA端到端任务性能.同时,大规模任务下可公开审计的证明和验证效率均得到提升,与单独的证明相比节省了约87%的证明时间.反馈机制的适应性和公平性也得到了增强.展开更多
基金supported by the National High-Tech Research and Development Plan of China under Grant Nos.863-317-01- 04-99, 2009AA01Z122 (863)the Natural Science Foundation of Shenyang City of China under Grant No. F10-205-1-12
文摘Non-Interactive Zero-Knowledge(NIZK for short) proofs are fascinating and extremely useful in many security protocols. In this paper,a new group signature scheme,decisional linear assumption group signature(DLAGS for short) with NIZK proofs is proposed which can prove and sign the multiple values rather than individual bits based on DLIN assumption. DLAGS does not need to interact between the verifier and issuer,which can decrease the communication times and storage cost compared with the existing interactive group signature schemes. We prove and sign the blocks of messages instead of limiting the proved message to only one bit(0 or 1) in the conventional non-interactive zero-knowledge proof system,and we also prove that our scheme satisfy the property of anonymity,unlinkability and traceability. Finally,our scheme is compared with the other scheme(Benoitt's scheme) which is also based on the NIZK proofs system and the DLIN assumption,and the results show that our scheme requires fewer members of groups and computational times.
文摘This article is based on research on pre-service teachers＇ perspectives on their mathematics knowledge of proof in geometry. The study was framed using tile mathematical knowledge for teaching framework. This qualitative study employed the use of a task-based worksheet, focus group sessions and semi-structured individual interviews. The task-based worksheet was completed by 180 pre-service mathematics teachers （second, third and fourth year mathematics education students）. Pre-service mathematics teachers are student teachers who have not yet completed their training to become teachers. After the analysis of the task-based worksheet, 20 participants were invited to participate in focus group sessions and individual interviews. The findings of the study reveal that the participants possess peripheral mathematics knowledge of proof in geometry. The study aims at assisting pre-service teachers and interested educationists to explore innovative methods of acquiring and imparting mathematics knowledge of proof in geometry. The study proposes possible changes in curriculum at school and university level.
文摘针对目前格上环签名方案在环成员数量较多的情况下,签名效率低下且签名尺寸和公钥尺寸过大的问题,基于零知识证明,使用E-MLWE(extended module learning with errors)和MSIS(module short interger solution)问题降低了公钥大小,结合拒绝采样算法和追踪机制设计了一种可追踪环签名方案,签名算法中使用递归算法压缩了承诺的大小,进一步降低了签名尺寸,在随机预言机模型下证明方案满足可链接性、匿名性和抗陷害性。性能分析表明,签名尺寸与环成员数量为对数大小关系,在环成员数量较多时,公钥的存储开销和签名的通信开销具有明显优势。
文摘V2X communication enables vehicles to share real-time traffic and road-condition data,but binding messages to persistent identifiers enables location tracking.Furthermore,since forged reports from malicious vehicles can distort trust decisions and threaten road safety,privacy-preserving trust management is essential.Lu et al.previously presented BARS,an anonymous reputation mechanism founded on blockchain technology to establish a privacy-preserving trust architecture for V2X communication.In this system,reputation certificates without a vehicle identifier ensure anonymity,while two authorities jointly manage certificate issuance and reputation updates.However,the centralized certificate updates introduce scalability limitations,and the authorities can trace vehicle behavioral information,which threatens privacy guarantees.Several subsequent systems derived from BARS still rely on centralized certificate management and are subject to authority-side privacy leakage.As a result,a key challenge in this line of research remains unresolved:how to decentralize the certificate-update process while preserving privacy against the authorities in privacy-preservingV2X trustmanagement.In this paper,we propose a distributed anonymous reputation system for V2X communication,based on an anonymous reputation system for crowdsensing.In our proposed system for V2X communication,the server is distributed to a certificate authority(CA)and roadside units(RSUs).Each vehicle shows the reputation level to the nearest RSU at the beginning of each time interval,and registers a short-time public key.In the interval,the messages from the vehicle are authenticated under the public key and are scored.At the end of the interval,the nearest RSU updates the certificate anonymously.Our solution decentralizes the certificate-update process by assigning each update to the nearest RSU.A zero-knowledge-proof-based show protocol removes the need for any central authority to handle vehicle certificates and thus prevents the authorities from tracing vehicle activities.Compared with BARS,where centralized authorities must update the reputation certificates of many vehicles and may incur communication and processing delays,our system performs each update locally at the nearest RSUonce per interval.The required interaction consists only of a fewkilobytes of communication and a zero-knowledge proof that is almost fully precomputed on the vehicle side,while the RSU-side processing is estimated to take about 40 ms based on timingmeasurements of the underlying cryptographic operations.This distributed updatemodel avoids the centralized bottleneck of BARS and simultaneously removes the privacy risk arising from authority collusion.
文摘大语言模型(Large Language Model,LLM)驱动的开放域问答(Open-Domain Question Answering,ODAQ)系统,如GIST(Generating Identifiers and Selecting chunks for Tables)框架,在处理海量表格数据时展现出巨大潜力,受到了广泛关注.然而,当ODQA系统需要整合多方私有表格数据进行Top-K候选筛选等环节时,传统方法需要访问全部原数据,这在数据隐私、计算透明度及参与方行为可信度方面面临挑战.虽然现有研究采用零知识证明和基于权益的机制实现了公开可验证性,但在大规模场景下生成和验证单个证明的开销过高,而传统的基于权益的机制在公平性和对动态环境的适应性方面也存在局限性.对此,本文基于多方安全计算(Multi-Party Computation,MPC)、可公开聚合审计与动态信誉机制,提出了一种面向LLM开放域问答中多方私有表格筛选的增强方法.将Top-K多方私有表格筛选过程通过MPC完成,以保护多方私有数据隐私.同时,引入高效的聚合审计机制,将零知识证明技术与随机抽样、聚合证明构造、基于时间窗口的批处理和错误定位相结合,确保评分与排序过程的正确性可以被批量、公开验证.基于区块链的动态信誉反馈机制的集成也增强了系统的公平性,并约束了恶意行为.实验评估表明,本文的Top-K候选筛选方法在保证隐私的同时与GIST原有筛选方法在结果上达到0.91的Top-50平均召回率和0.83的平均Jaccard指数,具有高度一致性,不会影响ODQA端到端任务性能.同时,大规模任务下可公开审计的证明和验证效率均得到提升,与单独的证明相比节省了约87%的证明时间.反馈机制的适应性和公平性也得到了增强.
