Hello Everyone. I am Kangyang from Staticky Laboratory of Cryptology.This is a joint work with Xiao Wang from Lowe's Western University.Our work is entitled Non-interactive Zoology Proofs to Multiple Varifiers.Zoology Proofs in Apple Approver took comments on Varifers.A statement is true.Here Statement X is often represented by a circuit.W is calledIn this case, XW satisfies an NP relationship is equivalent to CW is equal to 0.ZK proves these two satisfy three properties.Completely this means the verifier always accepts for an unanswered execution.Sunless means the malicious prover cannot convince an unanswered verifier or false statement is true.Their loyalty means the malicious verifier cannot know any information except the statement is true.NIZK allows the communication between a prover and a verifier to be non-interactive.NIZK is publicly verifiable and a proof can be reduced to convince multiple verifiers.The efficiency of NIZK has been significantly improved under different frameworks.Designated verifier ZK that is DVZK is often an interactive protocol between a prover and a verifier.DVZK comments only one verifier every time.DVZK can be constructed under different frameworks.In general,NIZK has sublinear verifier time, sublinear proof side is non-interactive.Compared to NIZK,DVZK has faster proof time, faster total time, slower memory,but requires linear verifier time, linear proof side, constant rounds of communication.Therefore,NIZK and DVZK have different efficiency features.We attempt to explore the middle ground between NIZK and DVZK.Particularly,we study the efficiency of ZK proofs when a prover wants to convince multiple verifiers,that is,NVZK.We allow the adversary to corrupt up to T of the N-verifier,unless corrupted verifiers can conclude with the prover.We focus on the case T less than N over 2.Our goal is to design concretely efficient NVZK proofs,achieving significantly less communication than running N-DVZK proofs.Having rounds close to NIZK,support streaming the proofs that obtain small memory.Here,streaming a proof means the prover can generate and send the proof on the fly,and a low party needs to store the whole proof during the protocol execution.We proposed three new concrete efficient N-VZK proofs with a simple property.The first protocol is information theoretic.The other two protocols are computational security.The two protocols in the CCTIN are our main protocols.All our protocols is only one round between the prover and the verifier.Thus,these protocols are non-interactive,that is,they are NIMVZK.The protocols in the CCTIN lead also one round between verifiers.We call them strong NIMVZK proofs.The two protocols in the CCTIN have significantly less communication than running N-DVZK protocols.All our protocols are streamable and have small memory.For computational complexity,our protocols are linear to the circle size and cheaper than DVZK.Our strong NIMVZK protocols keep the round among verifiers unchanged.All our strong NIMVZK proofs also have uninteresting asymmetric characteristic.That is,DVVZK have sublinear communication and company-novel resource mobile devices.Thanks for your attention.If you have any questions,send them to me.