Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
Lattice-based cryptography has recently produced several time-efficient cryptosystems that are provably secure under assumptions that are not known to be more easily solvable by quantum computers. An interesting research direction is improving their storage complexity, as current solutions are far from practical with respect to this metric. In this paper we show that program obfuscators for point...
In this paper, we construct efficient and practical signature schemes which allows a tight reduction from security in the multi-user setting to standard hardness assumptions. Firstly, we show that, for a general class of signature schemes, which we denote key convertible schemes, it is possible to construct a tight reduction from multi-user security to single-user security. Combined with the well-known...
Crowdsensing applications rely on volunteers to collect sensor readings using their mobile devices. Since the collected sensor readings are annotated with spatiotemporal information, the volunteers' privacy may be endangered. Existing privacy-preserving solutions often disclose the volunteers' location information to either a central third party or their peers. As a result, the volunteers need to...
Many cryptographic primitives that are used in crucial cryptographic schemes and commercial security protocols utilize hash functions. Recently, the National Institute of Standards and Technology (NIST) launched an international competition for establishing the new hash standard, SHA-3. One of the semifinalists is the Skein algorithm. In this paper, an 8-round unrolled architecture of the complete...
In this paper, the first class of low power current-based physically unclonable functions (PUFs) is introduced. The new PUF circuit is able to convert the analog variations present in device leakage currents to a unique digital quantity at high speed and low power. Robust digital responses are achieved with the new architecture in presence of fluctuations in operational conditions such as temperature...
In this paper a new method is introduced to increase security in wireless sensor networks by using data-oriented random number generator to encrypt tag of frames. These tags are exclusive disjunction with output of data-oriented random number generator. Data-oriented is a new and applied theory which provides methods that models the concepts with data structures. This idea increases the security in...
Most of the existing encryption schemes used for practical applications rely on un-proven assumptions. The limited access model proposed by Michael Rabin, describes a crypto-system which is provably unbreakable without any assumption on the computational power of an adversary. But this model makes assumption on the inaccessibility of a distributed source of randomness. In this paper we describe precisely...
Model checking is to check whether a bounded state system can meet their design specifications using state-space search approach automatically. This paper describes the key exchange protocol SSL 3.0, and conducts a formalized analysis and modeling and verification of the protocol by using the famous model checker tool SPIN. The LTL property is dynamically changed during the verification which can...
Recently, Libert and Quisquater proposed an efficient signcryption scheme based on the hardness of q-Diffie-Hellman problems in Gap Diffie-Hellman groups. Their scheme is quite efficient: the signcryption operation has almost the same cost as an ElGamal encryption while the reverse operation only requires one pairing evaluation and three exponentiations. However, Tan showed that their scheme is not...
Based on the interactive proof of Hamiltonian Cycle (HC) of large directed graph, which is a ??-protocol, we construct a perfectly hiding and computationally binding trapdoor commitment in 2-round from any one-way permutation. Then, based on this trapdoor commitment, we construct perfect zero-knowledge argument of knowledge with negligible error probability in 2-round for NP, assuming only the existence...
MD5 and SHA-1 are two known message digest algorithms widely used in the information security. A novice method of evaluating them is proposed here to analyze the collision rate of those two message digests. Computer-simulating technology is a key to this method and used to establish the statistical evaluation model in which data blocks are produced by a random number generator and corrupted by natural...
In this paper, we present the first biometric identity based signature (BIO-IBS) scheme that is fully secure in the standard model. We use biometric information as the identity and construct the user's public key by using a fuzzy extractor. A biometric reading provided by the alleged signer would be enough to verify the signature. The scheme was proven fully secure based on well-exploited q-Strong...
Disjoint NP-pairs are an interesting model of computation with important applications in cryptography and proof complexity. The question whether there exists a complete disjoint NP-pair was posed by Razborov in 1994 and is one of the most important problems in the field. In this paper we prove that there exists a many-one hard disjoint NP-pair which is computed with access to a very weak oracle (a...
Private scalar product protocols have proved to be interesting in various applications such as data mining, data integration, trust computing, etc. In 2007, Yao et al. proposed a distributed scalar product protocol with application to privacy-preserving computation of trust [1]. This protocol is split in two phases: an homorphic encryption computation; and a private multi-party summation protocol...
A verifiably encrypted signature can convince the verifier that a given cipher-text is the encryption of a signature on a given message. It is often used as a building block to construct optimistic fair exchange. In this paper, we propose a new concept: proxy verifiable encryption signature scheme, by combining proxy signature with verifiable encryption signature. And we formalize security model of...
In the grid security infrastructure (GSI), cross-domain authentication is based on traditional PKI cross certificate, which brings about problems of certificates management. Encouragingly, identity-based cryptography (IBC) can overcome these problems for its certificate-free feature. Therefore, an identity-based signcryption scheme is proposed in order to meet the requirement of cross-domain authentication...
The verifiably encrypted signature schemes proposed by Asokan solved the fairness problem in the fair exchange process. In the work, we propose an ID-based strong unforgeability verifiably encrypted signature scheme without random oracles, and show that the security of the scheme is based on the difficulty of solving the computational Diffie-Hellman problem. Our scheme is obtained from a modification...
Signcryption has clear advantage over traditional sign-then-encrypt schemes. However, the computational overhead for signcryption is still too heavy when it is applied to resource-constraint systems. In this paper, we propose a generic construction of the identity-based online/offline signcryption, where most of computations are carried out when the associated message is still unavailable and the...
In this paper we criticize the claimed security of an identity-based strong designated verifier signature (IBSDVS) scheme proposed recently based on bilinear pairings. In particular, we show that, contrary to the authorspsila claim, this scheme is delegatable if the computational Diffie-Hellman problem in the underlying group is intractable. We also explain why the claimed proof fails, in the hope...
Ring signature is an anonymous signature which allows a user to anonymously sign on behalf of a group. In some cases, we only hope that our signatures were anonymously verified by the designated users, such as hospital records. In this works, by combining ring signature and designated verifier signature scheme, a ring signature scheme with Multi-designated verifiers are proposed to satisfy the multi-user...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.