Group Signature Based on Non-interactive Zero-Knowledge Proofs

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.

Block Verification Mechanism Based on Zero-Knowledge Proof in Blockchain

Since transactions in blockchain are based on public ledger verification,this raises security concerns about privacy protection.And it will cause the accumulation of data on the chain and resulting in the low efficiency of block verification,when the whole transaction on the chain is verified.In order to improve the efficiency and privacy protection of block data verification,this paper proposes an efficient block verification mechanism with privacy protection based on zeroknowledge proof(ZKP),which not only protects the privacy of users but also improves the speed of data block verification.There is no need to put the whole transaction on the chain when verifying block data.It just needs to generate the ZKP and root hash with the transaction information,then save them to the smart contract for verification.Moreover,the ZKP verification in smart contract is carried out to realize the privacy protection of the transaction and efficient verification of the block.When the data is validated,the buffer accepts the complete transaction,updates the transaction status in the cloud database,and packages up the chain.So,the ZKP strengthens the privacy protection ability of blockchain,and the smart contracts save the time cost of block verification.

Memorizable Interactive Proof and Zero-Knowledge Proof Systems

Interactive proof and zero-knowledge proof systems are two important concepts in cryptography and complexity theory. In the past two decades, a great number of interactive proof and zero-knowledge proof protocols have been designed and applied in practice. In this paper, a simple memorizable zero-knowledge protocol is proposed for graph non-isomorphism problem, based on the memorizable interactive proof system, which is extended from the original definition of interactive proof and is more applicable in reality. Keywords interactive proof - zero-knowledge proof - memorizable interactive proof - memorizable zero-knowledge proof This work was supported by the ministry of Science and Technology of China (Grant No.2001CCA03000), and the National Natural Science Foundation of China (Grant No.60273045).Ning Chen received his B.S. degree from Fudan University in 2001. Now he is a master candidate of Department of Computer Science, Fudan University. His research interests include computational complexity, computational cryptography, algorithm design and analysis.Jia-Wei Rong received her B.S. degree from Fudan University in 2002. Now she is a master candidate of Department of Computer Science, Fudan University. Her research interests include computational cryptography, machine learning, artificial intelligence.

Existence of 3-round zero-knowledge proof systems for NP

This paper considers the existence of 3-round zero-knowledge proof systems for NP. Whether there exist 3-round non-black-box zero-knowledge proof systems for NP language is an open problem. By introducing a new interactive proof model, we construct a 3-round zero-knowledge proof system for graph 3-coloring under standard assumptions. Our protocol is a non-black-box zero-knowledge proof because we adopt a special strategy to prove the zero-knowledge property. Consequently, our construction shows the existence of 3-round non-black-box zero-knowledge proof for all languages in NP under the DDH assumption.

BMSC:A Novel Anonymous Trading Scheme Based on Zero-Knowledge Proof in Ethereum

Blockchains are widely used because of their openness,transparency,nontampering and decentralization.However,there is a high risk of information leakage when trading on blockchain,and the existing anonymous trading schemes still have some problems.To meet the high requirement of anonymity,the cost of proof submitted by the user is too large,which does not apply to blockchain storage.Meanwhile,transaction verification takes too long to ensure the legitimacy of the transaction.To solve these problems,this paper presents a novel anonymous trading scheme named Block Maze Smart Contract(BMSC)based on the zeroknowledge proof system zk-SNARKs to propose efficiency.This scheme can hide account balances,transaction amounts,and the transfer relationships between transaction parties while preventing overspending attacks and double-spending attacks.Compared with other anonymous schemes,this scheme has less cost of proof and takes less time for transaction verification while meeting the high requirements of anonymity and security.

Privacy-preserving analytics for the securitization market: a zero-knowledge distributed ledger technology application

A zero-knowledge proof or protocol is a cryptographic technique for verifying private data without revealing it in its clear form.In this paper,we evaluate the potential for zero-knowledge distributed ledger technology to alleviate asymmetry of information in the asset-backed securitization market.To frame this inquiry,we conducted market data analyses,a review of prior literature,stakeholder interviews with investors,originators and security issuers and collaboration with blockchain engineers and researchers.We introduce a new system which could enable all market participants in the securitization lifecycle(e.g.investors,rating agencies,regulators and security issuers)to interact on a unique decentralized platform while maintaining the privacy of loan-level data,therefore providing the industry with timely analytics and performance data.Our platform is powered by zkLedger(Narula et al.2018),a zero-knowledge protocol developed by the MIT Media Lab and the first system that enables participants of a distributed ledger to run publicly verifiable analytics on masked data.

Blockchain-based continuous data integrity checking protocol with zero-knowledge privacy protection

The cloud computing technology has emerged,developed,and matured in recent years,consequently commercializing remote outsourcing storage services.An increasing number of companies and individuals have chosen the cloud to store their data.However,accidents,such as cloud server downtime,cloud data loss,and accidental deletion,are serious issues for some applications that need to run around the clock.For some mission and business-critical applications,the continuous availability of outsourcing storage services is also necessary to protect users'outsourced data during downtime.Nevertheless,ensuring the continuous availability of data in public cloud data integrity auditing protocols leads to data privacy issues because auditors can obtain the data content of users by a sufficient number of storage proofs.Therefore,protecting data privacy is a burning issue.In addition,existing data integrity auditing schemes that rely on semi-trusted third-party auditors have several security problems,including single points of failure and performance bottlenecks.To deal with these issues,we propose herein a blockchain-based continuous data integrity checking protocol with zero-knowledge privacy protection.We realize a concrete construction by using a verifiable delay function with high efficiency and proof of retrievability,and prove the security of the proposal in a random oracle model.The proposed construction supports dynamic updates for the outsourced data.We also design smart contracts to ensure fairness among the parties involved.Finally,we implement the protocols,and the experimental results demonstrate the efficiency of the proposed protocol.

Time Dilation Cosmology 3: Mathematical Proof of the 3 Temporal and 2 Spatial Acceleration Factors

This is the fifth paper in a series on Time Dilation Cosmology, TDC. TDC is an eternal holographic model of the universe based on time dilation that ties astrophysics to quantum physics and resolves all the conundrums in astrophysics and serves as a model for the unified field. In the author’s previous four TDC papers, it was demonstrated that all gravitationally induced velocities are compensation for the apparent difference in the rates of time, “dRt”, due to mass/energy densities, and, vice-versa, in all force-induced velocities the dRt is compensation for the velocity, so the uniform evolution of the continuum at c is maintained at the invariant 1 s/s rate of time of the universe as a whole. These compensations make it impossible for an event to lag behind or get ahead of the evolving continuum. When the author did the first velocity formula derivations in “General Relativity: Effects in Time as Causation” [1], the author felt the explanations for the appearance of the 2spatial and the 3temporal acceleration factors in the formulas were correct, but poorly explained and incomplete. This paper is a proof of the temporal and spatial acceleration factors used in the time dilation-based velocity formula derivations in the Time Dilation Cosmology model.

Corrigendum: MicroRNA-502-3p regulates GABAergic synapse function in hippocampal neurons

There is an error in the name of the cell line in the abstract of the published paper“MicroRNA-502-3p regulates GABAergic synapse function in hippocampal neurons”published on pages 2698-2707,Issue 12,Volume 19 of Neural Regeneration Research(Sharma et al.,2024),because of oversight during final proof checking.The correct description should be“human-GABA receptor A-α1/β2/γ2L human embryonic kidney(HEK)recombinant cell line.”The authors apologize for any inconvenience this correction may cause for readers and editors of Neural Regeneration Research.

Glia-to-neuron reprogramming to the rescue?

Over the last two decades,the dogma that cell fate is immutable has been increasingly challenged,with important implications for regenerative medicine.The brea kth rough discovery that induced pluripotent stem cells could be generated from adult mouse fibroblasts is powerful proof that cell fate can be changed.An exciting extension of the discovery of cell fate impermanence is the direct cellular reprogram ming hypothesis-that terminally differentiated cells can be reprogrammed into other adult cell fates without first passing through a stem cell state.

Fool-Proof法在图书馆工作中的应用浅探

防呆法在企业生产中有大量的应用,在一些大型企业中也取得了显著的效果。作为一个服务部门和信息生产部门,图书馆应用防呆法无疑有助于图书馆的自动化和规范化。根据防呆法原理从10个方面详细列举了防呆法在图书馆的可能应用。

民事诉讼表见证明的性质定位及其构造

如何认定事实并适用法律,是诉讼中经常遇到的问题。从强化法官心证、缓解当事人证明负担以及保障当事人双方武器平等等因素考量,表见证明作为一种特殊的事实认定方式,在审判实践中发挥着不可替代的作用。但对于如何界定表见证明,理论研究与判例在经历了长时间的争论后依然莫衷一是,导致我国《民事诉讼法》在考虑是否引进该制度时显得顾虑重重。文章认为,为使表见证明发挥应有的功能价值,应当在明晰其性质的基础上,通过域外相关理论的借鉴,分析和梳理其基本构造,从而对我国民事立法提供有效经验。

电影《相助》片尾曲《The Living Proof》的功能文体学分析

电影歌曲作为整部电影的有机组成部分,其重要性不可小觑,一首好的歌曲能达到锦上添花的观影效果。目前国内对电影歌词的研究,大多集中在音乐学、美学、文学等语言学之外的领域,从功能语言学的角度对电影歌曲的解读尚且不多。本文拟以系统功能语法理论为指导,从语境、经验功能、人际功能着手解析电影《相助》片尾曲《The Living Proof》,以期丰富系统功能语法的研究内容,为电影歌词的分析提供新的视角,帮助观影者深度理解影片主题。

FORMAL PROOF OF RELATIVE STRENGTH OF SECURITY AMONG ECK2007 MODEL AND OTHER PROOF MODELS FOR KEY AGREEMENT PROTOCOLS

The differences among the extended Canetti ＆ Krawezyk 2007 model （ECK2007） and other four models, i.e., the Bellare ＆ Rogaway （1993, 1995）models （BR93,BR95）, the Bellare, Pointcheval ＆ Rogaway （2000） model （BPR2000） and the Canetti ＆ Krawczyk （2001） model （CK2001） are given. The relative strength of security among these models is analyzed. To support the implication or non-implication relation among these models, the formal proof or the counter-example is provided.

大数据证明的司法适用与理论检视

在刑事司法活动中,业已出现了有异于传统证明的大数据证明方式。通过对我国当下司法实践中适用案件的观察性分析,可归纳出大数据在刑事司法领域中的证明作用主要表现为:证明涉案主体的同一性、信息载体的关联性、海量信息的涉案数额、犯罪行为、犯罪构成中的特征信息五个方面。与传统司法证明相比,大数据证明最鲜明的特点体现为智能化、模型化及特殊相关性,要认识其内在原理与运行机制,可采取一种“海量信息+数据处理+结论”的要素思维。文章基于司法适用和内在机理对大数据证明进行理论上的检视,认为首先应当确立能够作为定案依据的大数据证明结论证据本位的法律属性规范,其次厘清其作为机器意见的事实认定原理,最后尝试以算法应用场景的稳定性为标准建立类案通用型和个案专门型二元分化的审查进路范式。

限缩法定犯适用的证明困境及其出路

在法定犯时代,为避免刑法过度适用减损国家治理整体效果,刑法学界提出了司法限缩方案,希望通过激活违法性认识的适用、严格审查前置的违法性、实质判断法益侵害程度来实现出罪减责。上述主张忽略了司法证明对构成要件的反向制约作用。违法性认识证明困难,决定其应作为责任要素,而非故意要素。行政监管的专业性和复杂性决定了,片面强调司法认定的独立性,否定行政鉴定与行政认定证据资格,不具有现实性。应区分关于专门性问题的报告和行政机关处理决定或意见,对前者参照司法鉴定意见予以规制,将后者归入辅助资料。将个人法益受到侵害作为法定犯构罪的前提,与增设法定犯特别是抽象危险犯立法目的不相适应。抽象危险和具体损害,只有通过反向刑事推定方可建立可转换的联系,从而实现积极出罪。

Comments and Research on Proofs of Chain Rule

In this paper we point out that the proofs of Chain Rule in many intensively used textbooks are not strict an construct anexa mple of a composite function f(u) which is differentiable with respects t o the independednt variable u, but is not differentiable with respect to the dependent variable u=g(x). A strict proof of Chain Rule is presented. Incon sistency of the form and content of Chain Rule is disclosed.

Study on Ignition Proof AZ91D Magnesium Alloy Chips with Cerium Addition

The effect of Ce on ignition point of AZ91D magnesium alloy chips was studied. For the AZ91D and the AZ91D-xCe magnesium alloys, changing the sizes of the chips in the range of 58 - 270 μm has a limited influence on ignition point, however, the shift of the content of Ce has much effect on ignition point. Increasing the Ce content, x from 0.15 to 0.25, the ignition point increases with increasing of Ce; however, x from 0.25 to 0.45, the ignition point decreases with increasing of Ce. By the addition of Ce of 0.25 %. the ignition point is raised by 43℃.

A SIMPLE PROOF OF STABILITY AND CONVERGENCE IN L＿2 FOR SOME DIFFERENCE SCHEMES AND THEIR EXTRAPOLATION METHOD FOR PARABOLIC EQUATIONS

ＡＳＩＭＰＬＥＰＲＯＯＦＯＦＳＴＡＢＩＬＩＴＹＡＮＤＣＯＮＶＥＲＧＥＮＣＥＩＮＬ＿２ＦＯＲＳＯＭＥＤＩＦＦＥＲＥＮＣＥＳＣＨＥＭＥＳＡＮＤＴＨＥＩＲＥＸＴＲＡＰＯＬＡＴＩＯＮＭＥＴＨＯＤＦＯＲＰＡＲＡＢＯＬＩＣＥＱＵＡＴＩＯＮＳＳｕｎＺｈｉｚｈｏｎｇ...

Game-Based Automated Security Proofs for Cryptographic Protocols

Provable security has become a popular approach for analyzing the security of cryptographic protocols.However,writing and verifying proofs by hand are prone to errors.This paper advocates the automatic security proof framework with sequences of games.We make slight modifications to Blanchet's calculus to make it easy for parsing the initial game.The main contribution of this work is that it introduces algebraic properties with observational equivalences to automatic security proofs,and thus can deal with some practical cryptographic schemes with hard problems.We illustrate the use of algebraic properties in the framework by proving the semantic security of the ElGamal encryption scheme.