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.
This work investigates the anonymous tag cardinality estimation problem in radio frequency identification systems with frame slotted aloha-based protocol. Each tag, instead of sending its identity upon receiving the reader's request, randomly responds by only one bit in one of the time slots of the frame due to privacy and security. As a result, each slot with no response is observed as in an empty...
In the Public Key infrastructure (PKI) model, digital certificates play a vital role in securing online communication. Communicating parties exchange and validate these certificates, the validation fails if a certificate has been revoked. In this paper we propose the Certificate Revocation Guard (CRG) to efficiently check certificate revocation while minimising bandwidth, latency and storage overheads...
The previous electronic sealed-bid auction schemes usually have a common drawback, the third party (auction host) can conspire with a malicious bidder to leak all bidding prices before the opening stage. It results in the malicious bidder wining the auction with an optimal bidding price. This paper proposes a sealed-bid auction scheme without third party to get over this drawback. The proposed scheme...
Differential privacy, introduced in 2006, has become a standard definition of privacy for statistical computations. Most of the research on differential privacy has explored questions arising in the client-server setting, where privacy guarantees are one-sided and cover data held by just one of the protocol participants. We observe that differential privacy complements the classic definition of secure...
Yao's classical millionaires' problem is about securely determining whether x>y, given two input values x, y, which are held as private inputs by two parties, respectively. The output which is result of comparison becomes known to both parties. In this paper we consider a variant of comparison problem in which the inputs x, y are encrypted and the actual values are not known to the parties. Our...
Recently, Tsukada et al. propose to use multi-agent epistemic logic for a taxonomy of information-hiding/disclosure properties, in particular properties used in authentication protocols. We follow their proposal and introduce a new multi-agent justification logic for protocol analysis and verification. We show our logic at work analyzing a non-repudiation protocol due to Zhou and Gollmann. Based on...
In this paper, the problems of secure multi-party ranking and secure selection were studied. Two protocols were proposed. They were both based on Secure Sum protocol. Secure multi-party ranking problem is an extended problem from millionaires' problem. It can be applied to many fields, such as auctions, commercial enterprises and so on. Secure Sum protocol was used to calculate the sum of vectors...
In today’s distributed computing environment multiple parties compute some function of their private inputs. In such a scenario privacy preservation of such inputs is a matter of great concern because each party is also worried about the privacy of their inputs. This subject is evolved as Secure Multiparty Computation (SMC). The protocols proposed in this paper allow multiple parties to get maximum...
This paper focuses on the challenges on the privacy of Radio Frequency Identification (RFID) systems. RFID systems have already widely applied in industry and have been bringing lots of benefits to our daily life, it also creates new security and privacy problems to individuals and organizations. The security and privacy challenges are analysed after a brief introduction of various RFID systems and...
We present the formalization of a recent electronic voting scheme using GSM mobile technology (GVS) in the applied pi calculus and analyze its privacy property. A refined threat model considering not only the attacks from outsiders but also from the insiders and the collusion between them, is defined to represent the hostile voting environment, in which the privacy property is analyzed.
Several vulnerability analysis techniques in web-based applications detect and report on different types of vulnerabilities. However, no single technique provides a generic technology-independent handling of Web-based vulnerabilities. In this paper we present our experience with and experimental exemplification of using the application vulnerability description language (AVDL) to realize a unified...
As digital resources increasingly growing and the economic benefit of digital intellectual property rights being increasingly important, people has been increasingly emphasis on information security issues brought by the data remnants in storage devices. They try their best to prevent the potential risks. In this paper, we survey comprehensively related technologies, standards and trends of erasure,...
User authentication is one of the important topics in information security. Traditional strong password schemes could provide with certain degree of security; however, the fact that strong passwords being difficult to memorize often leads their owners to write them down on papers or even save them in a computer file. As a result, security becomes greatly compromised. On the other hand, knowing that...
In this paper we introduce a new tool for controlling the knowledge transfer process in cryptographic protocol design. It is applied to solve a general class of problems which include most of the two-party cryptographic problems in the literature. Specifically, we show how two parties A and B can interactively generate a random integer N = p??q such that its secret, i.e., the prime factors (p, q),...
Alice disposes of some number of secrets. She is willing to disclose one of them to Bob. Although she agrees to let him choose which secret he wants, she is not willing to allow him to gain any information on more than one secret. On the other hand, Bob does not want Alice to know which secret he wishes. An all-or-nothing disclosure is one by which, as soon as Bob has gained any information whatsoever...
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.