6,568 research outputs found

    Secure end-to-end browsing system with mobile composition

    Get PDF
    To fix the more and more serious leakage problem in remote access to confidential data, the paper designs and implements a secure end-to-end browsing system with mobile composition. It enables mobile-authenticated users to browse confidential files stored at server side using their personal computers securely. The authentication function is in real-time such that the system can stop the browsing function once it detects that the authenticated mobile is out of the communication range of user's personal computer. © 2011 IEEE.published_or_final_versio

    Efficient key integrity verification for quantum cryptography using combinatorial group testing

    Get PDF
    Quantum Information and Computation VIII 77020F (April 23, 2010)In quantum cryptography, the key can be directly distributed to the communicating parties through the communication channel. The security is guaranteed by the quantum properties of the channel. However, the transmitted key may contain errors due to the noise of the channel. Key integrity verification is an indispensable step in quantum cryptography and becomes an important problem in higher speed systems. Computing only one hash value for the key string does not provide an effective solution as it may lead to dropping all the bits once the hash values on both sides do not agree. In this paper, we introduce a new idea of using the technique of combinatorial group testing, which seems to be an unrelated topic, to design a scheme to identify the error bits to avoid dropping all the bits. Our scheme can precisely locate the error bits if the number of error bits is within the maximum set by the scheme while the overhead is insignificant based on our experiments (additional bits: 0.1% of the key; time for computing the hash values: 16ms; verification time: 22 ms). Also, even if the number of error bits is higher than the maximum set by the scheme, only some correct bits may be misclassified as error bits but not the vice versa. The results show that we can still keep the majority of the correct bits (e.g. the bits discarded due to misclassification is only 5% of the whole string even if the number of error bits is 10 times of the maximum). © 2010 SPIE.published_or_final_versionThe 2010 SPIE Conference on Defense, Security, and Sensing, Orlando, FL., 5 April 2010. In Proceedings of SPIE - The International Society for Optical Engineering, v. 7702, p. 77020F-1 - 77020F-

    Towards a better similarity measure for keyword profiling via clustering

    Get PDF
    Automatic profiling for users and postings can help law enforcement units cluster and classify users and postings effectively so that potential problematic users and postings can be identified easily. A core problem in this application is to come up with effective profiles and a good measure to compare the similarity of two profiles. In this paper, we investigate an existing keyword-based user profiling scheme and identify its limitations. Then, we propose an improved version of it and demonstrate that our proposed version is more consistent than the existing approach with respect to the observed replied rates of a user to a posting based on the similarity of the profiles. © 2013 IEEE.published_or_final_versio

    Investigating and analyzing the web-based contents on Chinese Shanzhai mobile phones

    Get PDF
    Chinese Shanzhai mobile phone has had a huge commercial market in China and overseas and was found to be involved in criminal cases. In this paper, a MTK-based Shanzhai phone with private web browser was investigated to extract user's web browsing data in the form of sites visited, received emails, attempted Internet searches and etc. Based on the findings, extracting Internet search conducted and web email received from the binary image was demonstrated. Besides, deleted browsing history can be recovered from snapshots in memory help reconstruct user's browsing activity and timeline analysis.postprintThe 7th International Workshop on Systematic Approaches to Digital Forensic Engineering (IEEE/SADFE 2012), Vancouver, BC., 26-28 September 2012, p. 1297-130

    A Simple and Efficient Way to Combine Microcontrollers with RSA Cryptography

    Get PDF
    Microcontroller can be easily adopted in various applications with a variety of peripherals due to its merits of small size, simple architecture and etc. However, the limited computing power restricts its application in cryptography. In this paper, we try to integrate microcontroller with different peripheral devices to support more powerful cryptography computation in a simple and efficient way. Based on the most popular open source microcontroller development platform, Arduino, we design and develop a cryptographic hardware device for a real-life application which provides data protection functions for authority and integrity with RSA cryptography supported. With the peripherals Java card, our Arduino-cored solution is able to efficiently generate digital signature of photos taken by smart phone using the asymmetric cryptographic algorithm, RSA, which has a poor performance if it is directly implemented on microcontroller. The experimental results show that the device can finish a RSA 1024-bit encryption in 82.2 microseconds, which is reasonable in real application scenario and illustrates the feasibility of implementing more complicated cryptographic system using microcontroller.published_or_final_versio

    A dual cube hashing scheme for solving LPP integrity problem

    Get PDF
    In digital forensics, data stored in a hard disk usually contains valuable evidence. Preserving the integrity of the data in the hard disk is a critical issue. A single hash value for the whole hard disk is not appropriate as the investigation may take a long time and latent sector errors (LSEs) (bad sectors due to media imperfection, for example) which cause a sector suddenly unreadable will make the hash value inconsistent. On the other hand, using a hash per sector may need to store a lot of hash values. Previous research has been conducted to use fewer hash values, but can resist some of LSEs to decrease the number of unverifiable sectors even if there are LSEs. This integrity problem is more complicated in the presence of Legal Professional Privileged (LPP) data inside a seized hard disk in digital forensic as the hard disk has to be cloned once seized and the original hard disk will be sealed after cloning. Hash values need to be computed during this cloning process. However, the cloned copy will be returned to the suspect for the deletion of LPP data before the investigator can work on the sanitized copy. Thus, the integrity of unmodified sectors has to be verified using the hash values computed based on the original hard disk. This paper found that existing schemes are not good enough to solve the integrity problem in the presence of both LSEs and deletion of LPP data. We then propose the idea of a "Dual Cube" hashing scheme to solve the problem. The experiments show the proposed scheme performs better than the previous schemes and fits easily into the digital forensic procedure. © 2011 IEEE.published_or_final_versionThe 6th International Workshop on Systematic Approaches to Digital Forensic Engineering In conjunction with the IEEE Security and Privacy Symposium (IEEE/SADFE 2011), Oakland, CA., 26 May 2011. In IEEE/SADFE Proceedings, 2011, p. 1-

    Electrospinning of poly(methyl methacrylate) nanofibers in a pump-free process

    Full text link
    The effects of processing parameters, including solution concentration, viscosity, nozzle diameter, voltage bias and the nozzle to collector distance, on the morpho logy and diameters of poly(methyl methacrylate) (PMMA) fibers have been systematically investigated, using a unique pump-free electrospinning method. For PMMA solution concentrations less than the critical entanglement concentration, c e, prolate spheroidshaped droplets or beads with fibers were formed, whereas at concentrations above c e, good quality beadfree fibers were formed. Quantitative analysis revealed a linear dependence between the solution viscosity and fiber diameter. Larger fiber diameters were achieved by increasing the nozzle diameter and voltage bias. Increasing the bias voltage has the additional effect of broadening the diameter distribution, as a result of splaying and splitting. By contrast, when the strength of the electrical field was reduced by increasing the distance between the nozzle and collector, the overall fiber dia meter was reduced

    Maintaining hard disk integrity with digital legal professional privilege (LPP) data

    Get PDF
    published_or_final_versio

    Generalized nonreciprocity in an optomechanical circuit via synthetic magnetism and reservoir engineering

    Get PDF
    Synthetic magnetism has been used to control charge neutral excitations for applications ranging from classical beam steering to quantum simulation. In optomechanics, radiation-pressure-induced parametric coupling between optical (photon) and mechanical (phonon) excitations may be used to break time-reversal symmetry, providing the prerequisite for synthetic magnetism. Here we design and fabricate a silicon optomechanical circuit with both optical and mechanical connectivity between two optomechanical cavities. Driving the two cavities with phase-correlated laser light results in a synthetic magnetic flux, which in combination with dissipative coupling to the mechanical bath, leads to nonreciprocal transport of photons with 35dB of isolation. Additionally, optical pumping with blue-detuned light manifests as a particle non-conserving interaction between photons and phonons, resulting in directional optical amplification of 12dB in the isolator through direction. These results indicate the feasibility of utilizing optomechanical circuits to create a more general class of nonreciprocal optical devices, and further, to enable novel topological phases for both light and sound on a microchip.Comment: 18 pages, 8 figures, 4 appendice
    corecore