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.

Dynamic Proofs of Retrievability Based on Partitioning-Based Square Root Oblivious RAM

With the development of cloud storage,the problem of efficiently checking and proving data integrity needs more consideration.Therefore,much of growing interest has been pursed in the context of the integrity verification of cloud storage.Provable data possession(PDP)and Proofs of retrievablity(POR)are two kinds of important scheme which can guarantee the data integrity in the cloud storage environments.The main difference between them is that POR schemes store a redundant encoding of the client data on the server so as to she has the ability of retrievablity while PDP does not have.Unfortunately,most of POR schemes support only static data.Stefanov et al.proposed a dynamic POR,but their scheme need a large of amount of client storage and has a large audit cost.Cash et al.use Oblivious RAM(ORAM)to construct a fully dynamic POR scheme,but the cost of their scheme is also very heavy.Based on the idea which proposed by Cash,we propose dynamic proofs of retrievability via Partitioning-Based Square Root Oblivious RAM(DPoR-PSR-ORAM).Firstly,the notions used in our scheme are defined.The Partitioning-Based Square Root Oblivious RAM(PSR-ORAM)protocol is also proposed.The DPOR-PSR-ORAM Model which includes the formal definitions,security definitions and model construction methods are described in the paper.Finally,we give the security analysis and efficiency analysis.The analysis results show that our scheme not only has the property of correctness,authenticity,next-read pattern hiding and retrievabiltiy,but also has the high efficiency.

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.

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.

Area inside a Circle: Intuitive and Rigorous Proofs

In this article I conduct a short review of the proofs of the area inside a circle. These include intuitive as well as rigorous analytic proofs. This discussion is important not just from mathematical view point but also because pedagogically the calculus books still use circular reasoning today to prove the area inside a circle (also that of an ellipse) on this important historical topic, first illustrated by Archimedes. I offer an innovative approach through the introduction of a theorem, which will lead to proving the area inside a circle avoiding circular argumentation.

Constructive Proofs of the Brouwer Type Coincidence Theorems

This note gives constructive proofs of the Brouwer type coincidence theorems via the homotopy method.

A Blockchain-Based Proxy Re-Encryption Scheme with Conditional Privacy Protection and Auditability

With the development of Internet of Things technology,intelligent door lock devices are widely used in the field of house leasing.In the traditional housing leasing scenario,problems of door lock information disclosure,tenant privacy disclosure and rental contract disputes frequently occur,and the security,fairness and auditability of the housing leasing transaction cannot be guaranteed.To solve the above problems,a blockchain-based proxy re-encryption scheme with conditional privacy protection and auditability is proposed.The scheme implements fine-grained access control of door lock data based on attribute encryption technology with policy hiding,and uses proxy re-encryption technology to achieve auditable supervision of door lock information transactions.Homomorphic encryption technology and zero-knowledge proof technology are introduced to ensure the confidentiality of housing rent information and the fairness of rent payment.To construct a decentralized housing lease transaction architecture,the scheme realizes the efficient collaboration between the door lock data ciphertext stored under the chain and the key information ciphertext on the chain based on the blockchain and InterPlanetary File System.Finally,the security proof and computing performance analysis of the proposed scheme are carried out.The results show that the scheme can resist the chosen plaintext attack and has low computational cost.

Recurrent Neural Network Inspired Finite-Time Control Design

Dear Editor,This letter is concerned with the role of recurrent neural networks(RNNs)on the controller design for a class of nonlinear systems.Inspired by the architectures of RNNs,the system states are stacked according to the dynamic along with time while the controller is represented as the neural network output.To build the bridge between RNNs and finite-time controller,a novel activation function is imposed on RNNs to drive the convergence of states at finite-time and propel the overall control process smoother.Rigorous stability proof is briefly provided for the convergence of the proposed finite-time controller.At last,a numerical simulation example is presented to illustrate the efficiency of the proposed strategy.Neural networks can be classified as static(feedforward)and dynamic(recurrent)nets[1].The former nets do not perform well in dealing with training data and using any information of the local data structure[2].In contrast to the feedforward neural networks,RNNs are constituted by high dimensional hidden states with dynamics.

Thermally Conductive and UV-EMI Shielding Electronic Textiles for Unrestricted and Multifaceted Health Monitoring

Skin-attachable electronics have garnered considerable research attention in health monitoring and artificial intelligence domains,whereas susceptibility to elec-tromagnetic interference(EMI),heat accumulation issues,and ultraviolet(UV)-induced aging problems pose significant constraints on their potential applications.Here,an ultra-elas-tic,highly breathable,and thermal-comfortable epidermal sensor with exceptional UV-EMI shielding performance and remarkable thermal conductivity is developed for high-fidelity monitoring of multiple human electrophysiological signals.Via filling the elastomeric microfibers with thermally conductive boron nitride nanoparticles and bridging the insulating fiber interfaces by plating Ag nanoparticles(NPs),an interwoven thermal con-ducting fiber network(0.72 W m^(-1) K^(-1))is constructed benefiting from the seamless thermal interfaces,facilitating unimpeded heat dissipation for comfort skin wearing.More excitingly,the elastomeric fiber substrates simultaneously achieve outstanding UV protection(UPF=143.1)and EMI shielding(SET>65,X-band)capabilities owing to the high electrical conductivity and surface plasmon resonance of Ag NPs.Furthermore,an electronic textile prepared by printing liquid metal on the UV-EMI shielding and thermally conductive nonwoven textile is finally utilized as an advanced epidermal sensor,which succeeds in monitoring different electrophysiological signals under vigorous electromagnetic interference.This research paves the way for developing protective and environmentally adaptive epidermal electronics for next-generation health regulation.

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.

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.

A Fair and Trusted Trading Scheme for Medical Data Based on Smart Contracts

Data is regarded as a valuable asset,and sharing data is a prerequisite for fully exploiting the value of data.However,the current medical data sharing scheme lacks a fair incentive mechanism,and the authenticity of data cannot be guaranteed,resulting in low enthusiasm of participants.A fair and trusted medical data trading scheme based on smart contracts is proposed,which aims to encourage participants to be honest and improve their enthusiasm for participation.The scheme uses zero-knowledge range proof for trusted verification,verifies the authenticity of the patient’s data and the specific attributes of the data before the transaction,and realizes privacy protection.At the same time,the game pricing strategy selects the best revenue strategy for all parties involved and realizes the fairness and incentive of the transaction price.The smart contract is used to complete the verification and game bargaining process,and the blockchain is used as a distributed ledger to record the medical data transaction process to prevent data tampering and transaction denial.Finally,by deploying smart contracts on the Ethereum test network and conducting experiments and theoretical calculations,it is proved that the transaction scheme achieves trusted verification and fair bargaining while ensuring privacy protection in a decentralized environment.The experimental results show that the model improves the credibility and fairness of medical data transactions,maximizes social benefits,encourages more patients and medical institutions to participate in the circulation of medical data,and more fully taps the potential value of medical data.

A Blockchain-Based Efficient Cross-Domain Authentication Scheme for Internet of Vehicles

The Internet of Vehicles(IoV)is extensively deployed in outdoor and open environments to effectively address traffic efficiency and safety issues by connecting vehicles to the network.However,due to the open and variable nature of its network topology,vehicles frequently engage in cross-domain interactions.During such processes,directly uploading sensitive information to roadside units for interaction may expose it to malicious tampering or interception by attackers,thus compromising the security of the cross-domain authentication process.Additionally,IoV imposes high real-time requirements,and existing cross-domain authentication schemes for IoV often encounter efficiency issues.To mitigate these challenges,we propose CAIoV,a blockchain-based efficient cross-domain authentication scheme for IoV.This scheme comprehensively integrates technologies such as zero-knowledge proofs,smart contracts,and Merkle hash tree structures.It divides the cross-domain process into anonymous cross-domain authentication and safe cross-domain authentication phases to ensure efficiency while maintaining a balance between efficiency and security.Finally,we evaluate the performance of CAIoV.Experimental results demonstrate that our proposed scheme reduces computational overhead by approximately 20%,communication overhead by around 10%,and storage overhead by nearly 30%.

A Cloud-Fog Enabled and Privacy-Preserving IoT Data Market Platform Based on Blockchain

The dynamic landscape of the Internet of Things(IoT)is set to revolutionize the pace of interaction among entities,ushering in a proliferation of applications characterized by heightened quality and diversity.Among the pivotal applications within the realm of IoT,as a significant example,the Smart Grid(SG)evolves into intricate networks of energy deployment marked by data integration.This evolution concurrently entails data interchange with other IoT entities.However,there are also several challenges including data-sharing overheads and the intricate establishment of trusted centers in the IoT ecosystem.In this paper,we introduce a hierarchical secure data-sharing platform empowered by cloud-fog integration.Furthermore,we propose a novel non-interactive zero-knowledge proof-based group authentication and key agreement protocol that supports one-to-many sharing sets of IoT data,especially SG data.The security formal verification tool shows that the proposed scheme can achieve mutual authentication and secure data sharing while protecting the privacy of data providers.Compared with previous IoT data sharing schemes,the proposed scheme has advantages in both computational and transmission efficiency,and has more superiority with the increasing volume of shared data or increasing number of participants.

Mathematical Wave Functions and 3D Finite Element Modelling of the Electron and Positron

The wave/particle duality of particles in Physics is well known. Particles have properties that uniquely characterize them from one another, such as mass, charge and spin. Charged particles have associated Electric and Magnetic fields. Also, every moving particle has a De Broglie wavelength determined by its mass and velocity. This paper shows that all of these properties of a particle can be derived from a single wave function equation for that particle. Wave functions for the Electron and the Positron are presented and principles are provided that can be used to calculate the wave functions of all the fundamental particles in Physics. Fundamental particles such as electrons and positrons are considered to be point particles in the Standard Model of Physics and are not considered to have a structure. This paper demonstrates that they do indeed have structure and that this structure extends into the space around the particle’s center (in fact, they have infinite extent), but with rapidly diminishing energy density with the distance from that center. The particles are formed from Electromagnetic standing waves, which are stable solutions to the Schrödinger and Classical wave equations. This stable structure therefore accounts for both the wave and particle nature of these particles. In fact, all of their properties such as mass, spin and electric charge, can be accounted for from this structure. These particle properties appear to originate from a single point at the center of the wave function structure, in the same sort of way that the Shell theorem of gravity causes the gravity of a body to appear to all originate from a central point. This paper represents the first two fully characterized fundamental particles, with a complete description of their structure and properties, built up from the underlying Electromagnetic waves that comprise these and all fundamental particles.

A REVIEW AND PROSPECT OF READABLE MACHINE PROOFS FOR GEOMETRY THEOREMS

After half a century research, the mechanical theorem proving in geometries has become an active research topic in the automated reasoning field. This review involves three approaches on automated generating readable machine proofs for geometry theorems which include search methods, coordinate-free methods, and formal logic methods. Some critical issues about these approaches are also discussed. Furthermore, the authors propose three further research directions for the readable machine proofs for geometry theorems, including geometry inequalities, intelligent geometry softwares and machine learning.

Experimentally testing Bell's theorem based on Hardy's nonlocal ladder proofs

Bell＇s theorem argues the existence of quantum nonlocality which goes basically against the hidden variable theory （HVT）. Many experiments have been done via testing the violations of Bell＇s inequalities to statistically verify the Bell＇s theorem. Alternatively, by testing the Hardy＇s ladder proofs we experimentally demonstrate the deterministic violation of HVT and thus confirm the quantum nonlocality. Our tests are implemented with non-maximal entangled photon pairs generated by spontaneous parametric down conversions （SPDCs）. We show that the degree freedom of photon entanglement could be significantly enhanced by using interference filters. As a consequence, the Hardy＇s ladder proofs could be tested and Bell＇s theorem is verified robustly. The probability of violating the locality reach to 41.9%, which is close to the expectably ideal value 46.4% for the photon pairs with degree of entanglement e = 0.93. The higher violating probability is possible by further optimizing the experimental parameters.

Corigendum to“Efficient benzaldehyde photosynthesis coupling photocatalytic hydrogen evolution”[J.Energy Chem.66(2022)52-60]

It is regretful that the wrong image of Fig.4 was used in the paperin the final proof stage by editor.The correct one should be as follow.

A bioinspired flexible optical sensor for force and orientation sensing

Flexible optical sensors have been an emerging paradigm for applications in robotics,healthcare,and human–machine interfaces due to their high sensitivity,fast response,and anti-electromagnetic interference.Recently,Marques reports a bioinspired multifunctional flexible optical sensor(BioMFOS),achieving a forces sensitivity of 13.28μN,and a spatial resolution of 0.02 mm.The BioMFOS has a small dimension(around 2 cm)and a light weight(0.8 g),making it suitable for wearable application and clothing integration.As proof-of-concept demonstrations,monitoring of finger position,trunk movements,and respiration rate are realized,implying their prominent applications in remote healthcare,intelligent robots,assistance devices teleoperation,and human-machine interfaces.

An Effective Security Comparison Protocol in Cloud Computing

With the development of cloud computing technology,more and more data owners upload their local data to the public cloud server for storage and calculation.While this can save customers’operating costs,it also poses privacy and security challenges.Such challenges can be solved using secure multi-party computation(SMPC),but this still exposes more security issues.In cloud computing using SMPC,clients need to process their data and submit the processed data to the cloud server,which then performs the calculation and returns the results to each client.Each client and server must be honest.If there is cooperation or dishonest behavior between clients,some clients may profit from it or even disclose the private data of other clients.This paper proposes the SMPC based on a Partially-Homomorphic Encryption(PHE)scheme in which an addition homomorphic encryption algorithm with a lower computational cost is used to ensure data comparability and Zero-Knowledge Proof(ZKP)is used to limit the client’s malicious behavior.In addition,the introduction of Oblivious Transfer(OT)technology also ensures that the semi-honest cloud server knows nothing about private data,so that the cloud server of this scheme can calculate the correct data in the case of malicious participant models and safely return the calculation results to each client.Finally,the security analysis shows that the scheme not only ensures the privacy of participants,but also ensures the fairness of the comparison protocol data.