In this correspondence, construction of balanced Boolean functions with maximum possible algebraic (annihilator) immunity (AI) is studied with an additional property which is necessary to resist fast algebraic attack. The additional property considered here is, given an n-variable (n even) balanced function f with maximum possible AI n 2 , and given two n-variable Boolean functions g, h such th...

In this paper, we propose a 2/3-rate double length compression function and study its security in the black-box model. We prove that to get a collision attack for the compression function requires Ω(2) queries, where n is the single length output size. Thus, it has better security than a most secure single length compression function. This construction is more efficient than the construction gi...

One aspect of constructing secure networks is identifying unauthorized use of those networks. Intrusion Detection systems look for unusual or suspicious activity, such as pattems of network trafic that are likely indicators of unauthorized activity. However, normal operation often produces trafic that matches likely “attack signatures”, resulting in false alarms. We are using data mining techni...

One aspect of constructing secure networks is identifying unauthorized use of those networks. Intrusion Detection systems look for unusual or suspicious activity, such as pattems of network trafic that are likely indicators of unauthorized activity. However, normal operation often produces trafic that matches likely “attack signatures”, resulting in false alarms. We are using data mining techni...

The goal of leakage-resilient cryptography is to construct cryptographic algorithms that are secure even if the devices on which they are implemented leak information to the adversary. One of the main parameters for designing leakage resilient constructions is the leakage rate, i.e., a proportion between the amount of leaked information and the complexity of the computation carried out by the c...

At Crypto 2004 Joux showed a novel attack against the concatenated hash combiner instantiated with Merkle-Damgård iterated hash functions. His method of producing multicollisions in the Merkle-Damgård design was the rst in a recent line of generic attacks against the Merkle-Damgård construction. In the same paper, Joux raised an open question concerning the strength of the concatenated hash com...

Myers and Shelat (FOCS 2009) showed how to convert a chosen ciphertext secure (CCA secure) PKE scheme that can encrypt only 1-bit plaintexts into a CCA secure scheme that can encrypt arbitrarily long plaintexts (via the notion of key encapsulation mechanism (KEM) and hybrid encryption), and subsequent works improved efficiency and simplicity. In terms of efficiency, the best known construction ...

Watrous (STOC 2006) proved that plugging classical bit commitment scheme that is secure against quantum attack into the GMW-type construction of zero-knowledge gives a classical zero-knowledge proof that is secure against quantum attack. In this paper, we showed that plugging quantum bit commitment scheme (allowing quantum computation and communication) into the GMW-type construction also gives...

how to cite this article: akhondian j, ashrafzadeh f, beiraghi toosi m, hashemi n. a rare presentation of neurobrucellosis in a child with recurrent transient ischemic attacks and pseudotumor cerebri (a case report and review of literature). iran j child neurol. 2014 spring; 8(2):65-69.   brucellosis is a multi-system infectious disease that presents with various manifestations and complication...

In this paper, the security of a distance bounding protocol is analyzed which has been recently proposed by Jannati and Falahati (so-called JF). We prove that an adversary can recover key bits of JF protocol with probability of “1” while the complexity of attack is “2n” runs of protocol. In addition, we propose an improved protocol and prove that the improved protocol is resistant to mafia frau...