منابع مشابه
Cryptography. key exchange, public key
General cryptographic schemes are presented where keys can be one-time or ephemeral. Processes for key exchange are derived. Public key cryptographic schemes based on the new systems are established. Authentication and signature schemes are easy to implement. The schemes may be integrated with error-correcting coding schemes so that encryption/coding and decryption/decoding may be done simultan...
متن کاملRFID Privacy Based on Public-Key Cryptography
RFID systems makes it possible for a server to identify known tags in wireless settings. As they become more and more pervasive, people privacy is more and more threatened. In this talk, we list a few models for privacy in RFID and compare them. We review a few protocols. We further show that strong privacy mandates the use of public-key cryptography. Finally, we present a new cryptosystem whic...
متن کاملA SAT-based Public Key Cryptography Scheme
A homomorphic public key cryptography scheme based on the Boolean Satisfiability Problem (SAT) is proposed. The public key is a SAT formula satisfied by the private key. The probabilistic encryption algorithm generates random Boolean functions, which are implied to be false by the public key. Adding the message bits to them yields the cipher functions. A variant of Blum’s Hamilton cycle zero-kn...
متن کاملPublic Key Cryptography based on Semigroup Actions
A generalization of the original Diffie-Hellman key exchange in (Z/pZ) found a new depth when Miller [27] and Koblitz [16] suggested that such a protocol could be used with the group over an elliptic curve. In this paper, we propose a further vast generalization where abelian semigroups act on finite sets. We define a Diffie-Hellman key exchange in this setting and we illustrate how to build in...
متن کاملPublic-Key Cryptography Based on Modular Lattices
We present an approach to generalization of practical Identity-Based Encryption scheme of [BF01]. In particular we show how the protocol could be used on finite modular lattices and as a special case on vector spaces over finite field. The original proof of security for this protocol does not hold in this general algebraic structure, thus this is still a work in progress.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ukrainian Information Security Research Journal
سال: 2016
ISSN: 2410-7840,2221-5212
DOI: 10.18372/2410-7840.18.11088