Efficient Fully Structure-Preserving Signatures for Large Messages

摘要: We construct both randomizable and strongly existentially unforgeable structure-preserving signatures for messages consisting of many group elements. To sign a message $$N=mn$$ elements we have verification key size m contain $$n+2$$ Verification signature requires evaluating $$n+1$$ pairing product equations. We also investigate the case fully where it is required that secret signing consists only. show variant our scheme allowing signer to pick part at time still secure. This gives us signatures. In structure preserving single element, $$m+n+1$$ equations.