The Bitcoin network of decentralized payment transactions has attracted a lot attention from both Internet users and researchers in recent years. utilizes peer-to-peer to issue anonymous between different users. In the currently used clients, full transaction history is available at each node prevent double spending without need for central authority, forming valuable source empirical research on structure, dynamics, implied anonymity challenges, as well guidance future evolution complex...

Over the past years, an enormous variety of different chaos-based image and video encryption algorithms have been proposed published. While any algorithm published undergoes some more or less strict experimental security analysis, many those schemes are being broken in subsequent publications. In this paper, we show that two main motivations for preferring over classical strong cryptographic encryption, namely computational effort benefits, highly questionable. We demonstrate several...

Human Desoxyribo-Nucleic Acid (DNA) sequences offer a wealth of information that reveal, among others, predisposition to various diseases and paternity relations. The breadth personalized nature this highlights the need for privacy-preserving protocols. In paper, we present new error-resilient string searching protocol is suitable running private DNA queries. This checks if short template (e.g., describes mutation leading disease), known one party, inside sequence owned by another accounting...

Secure multiparty computation enables a set of users to evaluate certain functionalities on their respective inputs while keeping these encrypted throughout the computation. In many applications, however, outsourcing computations an untrusted server is desirable, so that can perform behalf users. Unfortunately, existing solutions are either inefficient, rely heavily user interaction, or require be under same public key - drawbacks making employment in practice very limited. We propose novel...

The practical application of Secure Two-Party Computation is hindered by the difficulty to implement secure computation protocols. While recent work has proposed very simple programming languages which can be used specify computations, it still difficult for practitioners use them, and cumbersome translate existing source code into this format. Similarly, manual construction two-party protocols, in particular ones based on approach garbled circuits, labor intensive error-prone.

In classical encryption schemes, data is encrypted under a single key that associated with user or group. Ciphertext-Policy Attribute-Based Encryption(CP-ABE) keys are attributes of users, given to them by central trusted authority, and logical formula over these attributes. We extend this idea the case where an arbitrary number independent parties can be present maintain their corresponding secret keys. scheme for multi-authority CP-ABE, propose first two constructions fully implement...

Traditional software security patches often have the unfortunate side-effect of quickly alerting attackers that their attempts to exploit patched vulnerabilities failed. Attackers greatly benefit from this information; it expedites search for unpatched vulnerabilities, allows them reserve ultimate attack payloads successful attacks, and increases attacker confidence in stolen secrets or expected sabotage resulting attacks. To overcome disadvantage, a methodology is proposed reformulating...

This paper presents a new covert channel using smartphone magnetic sensors. We show that modern smartphones are capable to detect the field changes induced by different computer components during I/O operations. In particular, we able create between laptop and mobile device without any additional equipment, firmware modifications or privileged access on either of devices. present two encoding schemes for communication evaluate their effectiveness.

In a forensic watermarking architecture, buyer-seller protocol protects the watermark secrets from buyer and prevents false infringement accusations by seller. Existing protocols encrypt content with homomorphic public-key cipher perform embedding under encryption. When used for multimedia data, these create large computation bandwidth overhead. this correspondence, we show that same functionality can be achieved efficiently using recently proposed secure algorithms.