The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Probabilistic key pre-distribution techniques for ad-hoc wireless sensor networks cannot guarantee link establishment and are prone to redundancy and key reuse. There is also a tradeoff between storage requirements, scalability and key reuse, which limits secure scalability. Master key an d Computation based key establishment techniques are vulnerable to clone attacks in case of compromised nodes...
For the first time it is proposed a stream deniable-encryption algorithm. The algorithm generates cryptogram that is computationally indistinguishable from the cryptogram produced by some probabilistic encryption algorithm, called associated probabilistic algorithm, while ciphering a fake message with a fake key. When the sender and receiver of the message are coerced to open the encryption key, they...
A program obfuscator takes a program and outputs a "scrambled" version of it, where the goal is that the obfuscated program will not reveal much about its structure beyond what is apparent from executing it. There are several ways of formalizing this goal. Specifically, in indistinguishability obfuscation, first defined by Barak et al. (CRYPTO 2001), the requirement is that the results of...
We introduce the notion of complementary-witness-soundness for a witness indistinguishable proof system. We then present a new general framework for public key encryption schemes, denoted as CWSWI-type encryption, based on a complementary-witness-sound witness indistinguishable (CWSWI) proof system. The construction of a CWSWI-type encryption scheme is relatively straight forward, while the security...
A new public key encryption scheme is proposed and analyzed, which is based on a vector space over some finite field with respect to a class of matrix semigroup action. The scheme is proved secure against adaptive chosen ciphertext attack under EDDH assumption. Since EDDH assumption is weaker than DDH assumption for generic bilinear groups, the new encryption scheme is a good replacement for Cramer-Shoup...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.