A public watermark detection scheme using verifiable secret sharing is proposed. It removes the expensive zero-knowledge interactive proofs and replaces the traditional trusted third party with a group of proxies. Moreover, the scheme is secure against sensitivity attacks and very efficient in terms of computation cost, the number of rounds and bandwidth required in the communications.
Open access
Advanced Steganography and Watermarking Techniques
A new watermark embedding and detection method in Microsoft Word 2007-2010 files which use Office Open XML (OOXML) format is proposed in this paper. Watermark information can be imperceptibly embedded into OOXML documents by replacing or adding the values of Revision Identifiers (RIs), which are specific attributes in the main document body of the OOXML document. In the detection process, a secure watermark detection scheme based on zero-knowledge proof is proposed without revealing any watermarking-related information to improve the security of watermarking detection. Experiments show that 4.43 bit is embedded into each word and 0.07 bit is embedded into each bit of the document on average, which is higher than contemporary linguistic watermarking approaches. The method can resist âFormatâ, âImpersonationâ, âSave Asâ, âCopyâ and other active attacks and all these changes will not be shown on the MS Office screen display. Therefore, the proposed method can apply to the field of security protection for OOXML format documents.
Advanced Steganography and Watermarking Techniques
Abhilasha Bhargav-Spantzel, Anna Squicciarini, Elisa Bertino, Xiangwei Kong · 5 authors
We present algorithms to reliably generate biometric identifiers from a user's biometric image which in turn is used for identity verification possibly in conjunction with cryptographic keys. The biometric identifier generation algorithms employ image hashing functions using singular value decomposition and support vector classification techniques. Our algorithms capture generic biometric features that ensure unique and repeatable biometric identifiers. We provide an empirical evaluation of our techniques using 2569 images of 488 different individuals for three types of biometric images; namely fingerprint, iris and face. Based on the biometric type and the classification models, as a result of the empirical evaluation we can generate biometric identifiers ranging from 64 bits up to 214 bits. We provide an example use of the biometric identifiers in privacy preserving multi-factor identity verification based on zero knowledge proofs. Therefore several identity verification factors, including various traditional identity attributes, can be used in conjunction with one or more biometrics of the individual to provide strong identity verification. We also ensure security and privacy of the biometric data. More specifically, we analyze several attack scenarios. We assure privacy of the biometric using the one-way hashing property, in that no information about the original biometric image is revealed from the biometric identifier.
Biometric Identification and Security
Advanced Steganography and Watermarking Techniques
With the secret distribution of a publicly verifiable secret sharing accomplished,k old participants take the place of the dealer to distribute new shares to new participants when the dealer is off-line and new participants want to share the secret. This paper presents a more general (k,n+t) scheme transformed from the (k,n) scheme based on the publicly verifiable secret sharing scheme and non-interactive zero-knowledge proof when t(tâ„1) new participants attach to the scheme. The (k,n+t) secret sharing scheme is publicly verifiable with the access structure and the former shares unchanged. Comparison with conventional publicly verifiable secret sharing schemes with enrollment ability shows that the (k,n+t) scheme flexibly allows multiple new participants to share the secret and reduces the public parameters and computational complexity.
Cryptography and Data Security
Advanced Steganography and Watermarking Techniques
A zero-knowledge proof of identity protocol is a special cryptographic algorithm for identity verification. The security of most of the zero-knowledge proof of identity protocols is based on complex mathematical algorithms and requires heavy computations for both parties involved, the proverb and the verifier. Thus, the two parties must depend on computing devices (computers) to perform these computations. Visual cryptography is a special kind of the cryptography that does not require one to know the cryptography and the corresponding complex mathematical computations. In this paper, we propose a new method of zero-knowledge proof of identity based on a non-expansion visual cryptography to overcome the disadvantage of complex computation in the current zero-knowledge proof of identity protocols, thus overcoming the dependence on computing devices.
Advanced Steganography and Watermarking Techniques
The similarity of E-cash and E-lottery was taken into account to have designed a secure E-cash-lottery scheme by using zero-knowledge proof and blind signature on the basis of applications of the traditional lottery. This E-cash-lottery is characterized with anonymity, double stake resisting, forgery resisting, traceableness and off-line. For lottery players, banks, and lottery delivery to infer the identity of the winners by E-lottery is as difficult as for them to solve discrete logarithm. For lottery players to forge the E-cash or the E-cash-lottery is as difficult as for them to attack the RSA public key signature system. If there exists any repeated spending by using this E-cash- lottery, the bank can certainly determine the identity of the spender. Compared with the traditional lottery, the anonymity and privacy of the E-cash-lottery were preferable.
Advanced Steganography and Watermarking Techniques
A secure web-based watermarking scheme is proposed to allow the publisher or information provider to mark their copyrighted materials and identify an illegal distributor through the World Wide Web (WWW). In our proposed scheme, multi-watermark techniques and double encryption method is applied to make the scheme available in e-transaction and secure against collusion attacks even if the third party is not trusted. And the basic idea of zero knowledge proof is also used to make verification of an illegal distributor without the disclosure of any watermark information. Furthermore, a multiparty transaction scenario is also introduced by using our scheme in this paper. The analysis results indicate that our design goals are successfully achieved and some improvements are made over previously proposed schemes.
Advanced Steganography and Watermarking Techniques
Combining the identification characteristics of zero-knowledge proof and blind watermark, an identity verification protocol is proposed. In this protocol, the public key encryption is used to encrypt the watermark and the watermarked data of the watermark embedding locations, and the verification of user's identity watermarking is achieved through estimating the relativity of them. Furthermore, a way which restricts the prover and verifierpsilas communication to a closed situation is put forward, and this way can resist such as brute force cheat-attack.
Cryptography and Data Security
Internet Traffic Analysis and Secure E-voting
Advanced Steganography and Watermarking Techniques
A new buyer-seller watermarking protocol is proposed by applying a double encryption method and a novel mechanism of embedding a buyer's watermark. The protocol can effectively prevent against collusion attacks and the man in the middle attack if the third party is not trusted. Also, based on the proposed scheme for the first-hand transaction, a new buyer-reseller watermarking protocol and a formal multi-party watermarking protocol are also proposed. The proposed buyer-resell watermarking protocol only needs the original seller to provide transfer certificate and encryption-decryption service to support the second-hand transaction, and the multi-party watermarking protocol with distributed certificate authorities can overcome the difficulty in the combination of multicast mechanism with multiple unique watermarks and allow a seller to multicast the watermarked digital contents and key transaction information to n buyers. Furthermore, the idea of zero knowledge proof is also applied into the proposed scheme to allow the seller to take an effective control on the task performed by the third party.
Advanced Steganography and Watermarking Techniques
Traditional definition of signature of knowledge can not prevent steganographic communication.To solve this problem,we introduce and formally define the notion of fairness of the signature of knowledge.We then construct a fair signature of knowledge scheme by use of fair zero-knowledge proofs of knowledge,and finally prove that this scheme indeed guarantees the fairness and can efficiently prevent steganographic communication.
Cryptography and Data Security
Privacy-Preserving Technologies in Data
Advanced Steganography and Watermarking Techniques
To provide a high level of security guarantee cryptography is introduced into the design of the voting machine. The voting machine based on cryptography is vulnerable to attacks through covert channels. An adversary may inject malicious codes into the voting machine and make it leak vote information unnoticeably by exploiting the randomness used in encryptions and zero-knowledge proofs. In this paper a voting machine resistant to covert channels is designed. It has the following properties: Firstly, it is tamper-evident. The randomness used by the voting machine is generated by the election authority. The inconsistent use of the randomness can be detected by the voter from examining a destroyable verification code. Even if malicious codes are run in the voting machine attacks through subliminal channels are thwarted. Next, it is voter-verifiable. The voter has the ability to verify if the ballot cast by the machine is consistent with her intent without doing complicated cryptographic computation. Finally, the voting system is receipt-free. Vote-buying and coercion are prevented.
2 source records
Internet Traffic Analysis and Secure E-voting
Cryptography and Data Security
Advanced Steganography and Watermarking Techniques
This paper proposes RSA-based zero-knowledge proof watermark verification protocols.It can tackle the problem of disclosing sensitive information.In the protocols,the public key encryption are used to encrypt the watermark and the watermarked data of the watermark embedding locations,the open verification of copyright watermarking is achieved through estimating the relativity of them.Furthermore,the authors research how to resist cheat-attack,and propose the way that prover and verifier can only communicate with each other to resist this attack.
Advanced Steganography and Watermarking Techniques
Zero-knowledge watermark detectors presented to date are based on a linear correlation between the asset features and a given secret sequence. This detection function is susceptible of being attacked by sensitivity attacks, for which zero-knowledge does not provide protection. In this paper, an efficient zero-knowledge version of the Generalized Gaussian Maximum Likelihood (ML) detector is introduced. The inherent robustness that this detector presents against sensitivity attacks, together with the security provided by the zero-knowledge protocol that conceals the keys that could be used to remove the watermark or to produce forged assets, results in a robust and secure protocol. Two versions of the zero-knowledge detector are presented; the first one makes use of two new zero-knowledge proofs for modulus and square root calculation; the second is an improved version applicable when the spreading sequence is binary, and it has minimum communication complexity. Completeness, soundness and zero-knowledge properties of the developed protocols are proved, and they are compared with previous zero-knowledge watermark detection protocols in terms of receiver operating characteristic, resistance to sensitivity attacks and communication complexity.
Cryptography and Data Security
Advanced Steganography and Watermarking Techniques
Abstract: Cryptography is an important tool in the design and implementation of electronic voting schemes for it provides the property of verifiability, which is not provided in the traditional voting. But in the real life, neither can most voters understand the profound theory of cryptographic e-voting nor can they perform the complicated cryptographic computation. An e-voting system is presented in this paper to leverage the use of cryptography between theory and practice. It combines the advantages of Moran-Naorâs voting scheme and voting schemes based on homomorphic encryption. It makes use of cryptographic techniques, but it hides the details of cryptographic computation from voters. Voters can be convinced that the ballot is cast as intended. The tally can be verified in public. Compared with Moran-Naorâs voting scheme, the new system has three advantages: the ballots can be recovered when the voting machine breaks down, the costly cut-and-choose zero-knowledge proofs for shuffling votes made by the voting machine are avoided and the partial tally result in each voting machine is kept secret. Key words: electronic voting, homomorphic commitment, homomorphic encryption, threshold decryption 1.
2 source records
Internet Traffic Analysis and Secure E-voting
Advanced Steganography and Watermarking Techniques
We propose a cryptographic protocol for biometrics authentication without revealing personal biometrical data against malicious verifier. Our protocol uses a neural network and zero-knowledge interactive proof. In this paper, we developed a sample implementation system of our proposed protocol and we evaluate the performance and the accuracy of the proposed protocol. Especially, we study several algorithms for feature extraction of minutiae of fingerprint which is appropriate to our protocol. We examine false acceptance rates and rejection rates
Biometric Identification and Security
User Authentication and Security Systems
Advanced Steganography and Watermarking Techniques
Zero-knowledge set is a primitive introduced by Micali, Rabin, and Kilian (FOCS 2003) which enables a prover to commit a set to a verifier, without revealing even the size of the set. Later the prover can give zero-knowledge proofs to convince the verifier of membership/nonmembership of elements in/not in the committed set. We present a new primitive called Statistically Hiding Sets (SHS), similar to zero-knowledge sets, but providing an information theoretic hiding guarantee. This is comparable to relaxing zero-knowledge proofs to witness independent proofs. More precisely, we continue to use the simulation paradigm for our definition, but do not require the simulator (nor the distinguisher) to be efficient. We present a new scheme for statistically hiding sets, which does not fit into the âMerkletree/mercurial-commitmentâ paradigm used for all zero-knowledge set constructions so far. This not only provides some efficiency gains compared to the best possible schemes in that paradigm, but also lets us provide statistical hiding, without the prover having to maintain growing amounts of state with each new proof; this is not known to be possible with the previous approach.
2 source records
Advanced Steganography and Watermarking Techniques
Zero-knowledge proof has been one of the key technologies to be applied in identity authentication in the fields of information security.To avoid the use of the graph isomorphism problem in the known zero-knowledge proof systems,an efficient computational zero-knowledge proof of knowledge whose security relies on the NP-Completeness of the independent set problem is presented here.The proposed logarithm is constructed from a bit commitment scheme based on the hardness of the discrete logarithm problem,which guarantees the fulfillment of soundness,completeness and computational zero-knowledge properties.The system and its logarithm parameter choice were analyzed from two aspects of computational complexity and communication complexity.It was proved theoretically that the system is feasible and effective.
Biometric Identification and Security
Access Control and Trust
Advanced Steganography and Watermarking Techniques