This legal technicality indicates the Hague must dismiss charges against Dr Karadzic and others awaiting trials in the Hague jail; like it or not. Unfortunately for the Signatures Of the Rome Statute United Nations member states instituting the ICC & ICTY housed at the Hague, insofar as the, Radovan Karadzic, as with the other Hague cases awaiting trial there, I personally witnessed these United Nations member states openly speaking about trading judicial appointments and verdicts for financial funding when I attended the 2001 ICC Preparatory Meetings at the UN in Manhattan making the iCTY and ICC morally incapable trying Radovan Karazdic and others. I witnessed with my own eyes and ears when attending the 2001 Preparatory Meetings to establish an newly emergent International Criminal Court, the exact caliber of criminal corruption running so very deeply at the Hague, that it was a perfectly viable topic of legitimate conversation in those meetings I attended to debate trading verdicts AND judicial appointments, for monetary funding. Jilly wrote: The rep from Spain became distraught and when her country’s proposal was not taken to well by the chair of the meeting , then Spain argued in a particularly loud and noticeably strongly vocal manner, “Spain (my country) strongly believes if we contribute most financial support to the Hague’s highest court, that ought to give us and other countries feeding it financially MORE direct power over its decisions.” (Instead of censoring the country representative from Spain for even bringing up this unjust, illegal and unfair judicial idea of bribery for international judicial verdicts and judicial appointments, all country representatives present in the meeting that day all treated the Spain proposition as a ”totally legitimate topic” discussed and debated it between each other for some time. I was quite shocked! The idea was "let's discuss it." "It's a great topic to discuss." Some countries agreed with Spain’s propositions while others did not. The point here is, bribery for judicial verdicts and judicial appointments was treated as a totally legitimate topic instead of an illegitimate topic which it is in the meeting that I attended in 2001 that day to establish the ground work for a newly emergent international criminal court.) In particular., since "Spain" was so overtly unafraid in bringing up this topic of trading financial funding the ICC for influence over its future judicial appointments and verdicts in front of every other UN member state present that day at the UN, "Spain" must have already known by previous experience the topic of bribery was "socially acceptable" for conversation that day. They must have previously spoke about bribing the ICTY and ICC before in meetings; this is my take an international sociological honor student. SPAIN's diplomatic gesture of international justice insofar as, Serbia, in all of this is, disgusting morally! SPAIN HAS TAUGHT THE WORLD THE TRUE DEFINITION OF AN "INTERNATIONAL CRIMINAL COURT." I remind everyone, when I attended those ICC Preparatory Meetings in 2001, witnessing first hand the country plenipotentiary representatives present with me discussing so openly, trading judicial funding of a new international criminal court, for its direct judicial appointments and judicial verdicts, those same state powers were concurrently, those same countries and people were already simultaneously, funding the already established ICTY which was issuing at that time, arrest warrants for Bosnian Serbs under false primary diplomatic pretenses. The ICTY and ICC is just where it should be for once. Cornered and backed into and an international wall, scared like a corned animal (and I bet it reacts in the same way a rabid cornered animal does too in such circumstances). Documents: Hague war crimes tribunal for the former Yugoslavia (ICTY) has destroyed all material evidence about the monsterous KLA Albanian/KLA organ trade in Kosovo). I believe strongly that ICYU associates murdered former Serb President, Slobodan Milosevic, tried to murder me, as well and other Serbs prisoners and presently places, Doctor Radovan Karadzic’s life in direct danger as well as Ratko Mladic’s life in danger should he be brought there. The ICTY has no other choice than to halt all further court proceedings against, Doctor Radovan Karadzic, and others there both serving sentences and awaiting trials. Miss JIll Louise Starr (The UN Security Council has no choice but to act on this now). I accuse the Hague ICTY war crimes tribunal of attempted assassination on my life and others, contempt of court and obstruction of international justice and "international witness tampering" in complicity with Richard Holbrook and Bill Clinton (Former US President of the USA) as well as political players in Spain and the Netherlands . I represented the state interests' of the Former Yugoslavia, in Darko Trifunovic’s absence in those meetings and I am proud to undertake this effort on Serbia’s behalf.
Software piracy is the major challenge to software providers, and most trade organizations today face problems with software piracy. As a result, there are several developed systems available in the market to deal with this problem. Unfortunately, the majority of these systems do not provide an appropriate solution and the problem has not been solved yet. After reviewing the nature of existing systems, the author found that these systems do not take in their consideration the international standard specifications to treat this problem. Therefore, it is difficult for these systems to prevent or stop piracy. Thus the purpose of this paper is to develop a new scheme carrying the characteristics of international standard specifications in order to be able to prevent piracy in any country by utilizing the Internet and Web services, by using one from the deterministic public key encryption scheme, namely ElGamal scheme, and by using zero knowledge proof of identity technique to grant the users access to a scheme correctly and also to use the international standard copy number, to ease many of these difficulties. Results are given from which the conclusion drawn is that developing a new scheme entitled “An Efficient Software Anti-Piracy Scheme” can help significantly in the work of trade organizations and software providers suffering from software piracy. Some recent patents are also discussed in this paper. Keywords: Static protection, dynamic protection, software piracy attacks, identification, authentication
DAA scheme in the TCG specification is based on CL signature,which is also combined by group signature and zero knowledge proof techniques to prove the direct anonymous attestation,and its security is based on the decomposition of large numbers.With the increasement of computer performance and the development of cryptography,the problem based on integer factorization problem is likely to be attacked,the corresponding DAA scheme has become no longer safety.But the algorithm based on the elliptic curve discrete logarithm and the prime on the discrete logarithm (double discrete logarithm) can use a shorter key,achieve higher security.Based on double discrete logarithm algorithm,this article designed a new DAA scheme.Demonstrated by analyzing solution,this new DAA scheme could not only meet the requirements of direct anonymous attestation,but also could make the implementation efficiency of the scheme consistent with the original one,while improved its security greatly.
To address the problem that the common authentication mechanism is not applicable to the P2P network system model with anonymous communication requirements.This paper,based on the improvement of the Diffle-Hellman key agreement protocol and the combination of the RSA digital signatures agreements and zero-knowledge proof GQ agreement,proposes a new token-based services authentication mechanism to identify the nodes in P2P anonymous communication systems.This mechanism,with the premise of guaranteeing various general characteristics of P2P anonymous communication system and introduction of the trusted third party node into P2P anonymous communication system,implements anonymous control and behavior management of various communication nodes in P2P anonymous communication system.It could resist the threat of various common networks attack and realize effective authentication of P2P anonymous communication system,thus improving the security management ability of P2P anonymous communication system.
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 novel fair and efficient divisible E-Cash system based on the schnorr blind signature and non-interactive zero-knowledge proofs is proposed in this paper.In this system,both discrete logarithm and collision-resistance Hash function are used in the computation of divisible E-Cash.It contains the C value which defines the security.C can only be C1or be obtained by associated by C1and C2,where C1 is able to disclose the users' ID when over-spending happened.Moreover,the combination of and can realized owner tracing and coin tracing through the cooperation of B and T more easily.The scheme can also realize overspending tracing and over-deposit user,furthermore,it can limit the power of T,avoid the possibility of the association guilt between B and T.
For most present threshold signature schemes,sub-sign member can not sign a message anonymously or theirs anonymity is very weak.To improve their anonymity,a strong anonymity (n,t) threshold signature scheme based on DAA (Direct Anonymous Attestation),which is adopted by Trusted Computing Group v1.2 specifications,is proposed.Compared with the others,the scheme colligates DAA,zero-knowledge proof and Feldman verifiable secret sharing technique to achieve untraceable sub-sign and insure strong anonymity of signers,even the verifier and the dealer are colluded.Besides strong anonymity,analysis shows the scheme also has the property of unforgeable share,verifiable sub-sign,and robustness etc.It can be used in the situations which desire high-level anonymity such as anonymous voting.
In recent years, the studies of blind signatures achieved a lot of results, but there still are many problems. Boneh and Boyen gave a new signature, derived the blind signature scheme from their idea. This paper first gave a blind signature without random oracles, with this property, the scheme was secure in standard model. Then, used common reference string to do non-interactive zero knowledge proof, made the blind signature into only two moves to achieve round optimal, and the concurrency operation of blind signature could be reach by this. For the algorithm is simple and not complicated, the blind signature is more efficient than the existing secure blind signature schemes,so save transmission bandwidth and improves transfer efficiency.
We deisgn a DAA scheme based on Short Group Signature on l-MOMSDH assumption.On the basis of Fiat-Shamir heuristic theory,the signature of knowledge and realization of the transformation from non-interactive zero knowledge proof to signature of knowledge are introduced.Because of its short signature,high efficiency and provable security in Standard Model,the security of DAA is increased while its efficiency is also guaranteed.
Abstract : Mobile airborne networks deployed and used by the armed forces face significant challenges in balancing security concerns with reliably servicing the needs of the forces dependent on it. These issues are complicated by the ever-changing collaborative environments that these networks are tasked to support. The Zero Knowledge Protocol (ZKP) is a powerful technique that replaces the portion of a traditional credential-based key management system where credentials are exchanged. Instead, in ZKPs a proof of the existence of the credential is sent, allowing the receiver to develop absolute confidence that the user has a valid credential, without exposing the credential to risk of compromise. Based on the results of this research, we assert that it may be possible to construct a ZKP scheme with strong anonymity given any identification protocol and a shared-key update scheme.
In a digital world, users’ Personally Identifiable Information (PII) is normally managed with a system called an Identity Management System (IMS). There are many types of IMSs. There are situations when two or more IMSs need to communicate with each other (such as when a service provider needs to obtain some identity information about a user from a trusted identity provider). There could be interoperability issues when communicating parties use different types of IMS. To facilitate interoperability between different IMSs, an Identity Meta System (IMetS) is normally used. An IMetS can, at least theoretically, join various types of IMSs to make them interoperable and give users the illusion that they are interacting with just one IMS. However, due to the complexity of an IMS, attempting to join various types of IMSs is a technically challenging task, let alone assessing how well an IMetS manages to integrate these IMSs. The first contribution of this thesis is the development of a generic IMS model called the Layered Identity Infrastructure Model (LIIM). Using this model, we develop a set of properties that an ideal IMetS should provide. This idealized form is then used as a benchmark to evaluate existing IMetSs. Different types of IMS provide varying levels of privacy protection support. Unfortunately, as observed by Josang et al (2007), there is insufficient privacy protection in many of the existing IMSs. In this thesis, we study and extend a type of privacy enhancing technology known as an Anonymous Credential System (ACS). In particular, we extend the ACS which is built on the cryptographic primitives proposed by Camenisch, Lysyanskaya, and Shoup. We call this system the Camenisch, Lysyanskaya, Shoup - Anonymous Credential System (CLS-ACS). The goal of CLS-ACS is to let users be as anonymous as possible. Unfortunately, CLS-ACS has problems, including (1) the concentration of power to a single entity - known as the Anonymity Revocation Manager (ARM) - who, if malicious, can trivially reveal a user’s PII (resulting in an illegal revocation of the user’s anonymity), and (2) poor performance due to the resource-intensive cryptographic operations required. The second and third contributions of this thesis are the proposal of two protocols that reduce the trust dependencies on the ARM during users’ anonymity revocation. Both protocols distribute trust from the ARM to a set of n referees (n > 1), resulting in a significant reduction of the probability of an anonymity revocation being performed illegally. The first protocol, called the User Centric Anonymity Revocation Protocol (UCARP), allows a user’s anonymity to be revoked in a user-centric manner (that is, the user is aware that his/her anonymity is about to be revoked). The second protocol, called the Anonymity Revocation Protocol with Re-encryption (ARPR), allows a user’s anonymity to be revoked by a service provider in an accountable manner (that is, there is a clear mechanism to determine which entity who can eventually learn - and possibly misuse - the identity of the user). The fourth contribution of this thesis is the proposal of a protocol called the Private Information Escrow bound to Multiple Conditions Protocol (PIEMCP). This protocol is designed to address the performance issue of CLS-ACS by applying the CLS-ACS in a federated single sign-on (FSSO) environment. Our analysis shows that PIEMCP can both reduce the amount of expensive modular exponentiation operations required and lower the risk of illegal revocation of users’ anonymity. Finally, the protocols proposed in this thesis are complex and need to be formally evaluated to ensure that their required security properties are satisfied. In this thesis, we use Coloured Petri nets (CPNs) and its corresponding state space analysis techniques. All of the protocols proposed in this thesis have been formally modeled and verified using these formal techniques. Therefore, the fifth contribution of this thesis is a demonstration of the applicability of CPN and its corresponding analysis techniques in modeling and verifying privacy enhancing protocols. To our knowledge, this is the first time that CPN has been comprehensively applied to model and verify privacy enhancing protocols. From our experience, we also propose several CPN modeling approaches, including complex cryptographic primitives (such as zero-knowledge proof protocol) modeling, attack parameterization, and others. The proposed approaches can be applied to other security protocols, not just privacy enhancing protocols.
In this paper, based on the verifiable pair and identity-based threshold cryptography, a novel identity-based (ID-based) threshold decryption scheme (IDTDS) is proposed, which is provably secure against adaptive chosen ciphertext attack under the computational bilinear Diffie-Hellman (CBDH) problem assumption in the random oracle. The pubic checkability of ciphertext in the IDTDS is given by simply creating a signed ElGamal encryption instead of a noninteractive zero-knowledge proof. Furthermore, we introduce a modified verifiable pairing to ensure all decryption shares are consistent. Our scheme is more efficient in verification than the schemes considered previously.
BACKGROUND: Software to help control diabetes is currently an embryonic market with the main activity to date focused mainly on the development of noncomputerized solutions, such as cardboard calculators or computerized solutions that use "flat" computer models, which are applied to each person without taking into account their individual lifestyles. The development of true, mobile device-driven health applications has been hindered by the lack of tools available in the past and the sheer lack of mobile devices on the market. This has now changed, however, with the availability of pocket personal computer handsets. METHOD: This article describes a solution in the form of an intelligent neural network running on mobile devices, allowing people with diabetes access to it regardless of their location. Utilizing an easy to learn and use multipanel user interface, people with diabetes can run the software in real time via an easy to use graphical user interface. The neural network consists of four neurons. The first is glucose. If the user's current glucose level is within the target range, the glucose weight is then multiplied by zero. If the glucose level is high, then there will be a positive value multiplied to the weight, resulting in a positive amount of insulin to be injected. If the user's glucose level is low, then the weights will be multiplied by a negative value, resulting in a decrease in the overall insulin dose. RESULTS: A minifeasibility trial was carried out at a local hospital under a consultant endocrinologist in Belfast. The short study ran for 2 weeks with six patients. The main objectives were to investigate the user interface, test the remote sending of data over a 3G network to a centralized server at the university, and record patient data for further proofing of the neural network. We also received useful feedback regarding the user interface and the feasibility of handing real-world patients a new mobile phone. Results of this short trial confirmed to a large degree that our approach (which also can be known as intensive insulinotherapy) has value and perhaps that our neural network approach has implications for future intelligent insulin pumps. CONCLUSIONS: Currently, there is no software available to tell people with diabetes how much insulin to inject in accordance with their lifestyle and individual inputs, which leads to adjustments in software predictions on the amount of insulin to inject. We have taken initial steps to supplement the knowledge and skills of health care professionals in controlling insulin levels on a daily basis using a mobile device for people who are less able to manage their disease, especially children and young adults.
Aiming at the problem that current schemes can not protect the benefits of proxy signer and message owner at the same time,this paper presents a blind proxy blind signature scheme on elliptic curve. By using Elliptic Curve Cryptography(ECC) and zero-knowledge proof,it has small amount of computing,high security and high implementation efficiency. Security analysis proves that the scheme satisfies the security properties of blind proxy signature scheme and proxy blind signature scheme,and it has strong enforceability.
In order to solve the security problem that the E-cash users get from bank have no blindness in the new E-cash system based on partial blind signature,this paper brings forward a new E-cash payment model which combines zero-knowledge identity proof based on improved ELGamal signature and partial blind signature. It can track user with the help of the third trusted party to avoid using E-cash illegally. Security analysis indicate that the model has strong security and practicability.