1000 resultados para "lattice" site
Resumo:
We construct an efficient identity based encryption system based on the standard learning with errors (LWE) problem. Our security proof holds in the standard model. The key step in the construction is a family of lattices for which there are two distinct trapdoors for finding short vectors. One trapdoor enables the real system to generate short vectors in all lattices in the family. The other trapdoor enables the simulator to generate short vectors for all lattices in the family except for one. We extend this basic technique to an adaptively-secure IBE and a Hierarchical IBE.
Resumo:
We propose a framework for adaptive security from hard random lattices in the standard model. Our approach borrows from the recent Agrawal-Boneh-Boyen families of lattices, which can admit reliable and punctured trapdoors, respectively used in reality and in simulation. We extend this idea to make the simulation trapdoors cancel not for a specific forgery but on a non-negligible subset of the possible challenges. Conceptually, we build a compactly representable, large family of input-dependent “mixture” lattices, set up with trapdoors that “vanish” for a secret subset which we hope the forger will target. Technically, we tweak the lattice structure to achieve “naturally nice” distributions for arbitrary choices of subset size. The framework is very general. Here we obtain fully secure signatures, and also IBE, that are compact, simple, and elegant.
Resumo:
We propose a new kind of asymmetric mutual authentication from passwords with stronger privacy against malicious servers, lest they be tempted to engage in “cross-site user impersonation” to each other. It enables a person to authenticate (with) arbitrarily many independent servers, over adversarial channels, using a memorable and reusable single short password. Beside the usual PAKE security guarantees, our framework goes to lengths to secure the password against brute-force cracking from privileged server information.
Resumo:
The notion of certificateless public-key encryption (CL-PKE) was introduced by Al-Riyami and Paterson in 2003 that avoids the drawbacks of both traditional PKI-based public-key encryption (i.e., establishing public-key infrastructure) and identity-based encryption (i.e., key escrow). So CL-PKE like identity-based encryption is certificate-free, and unlike identity-based encryption is key escrow-free. In this paper, we introduce simple and efficient CCA-secure CL-PKE based on (hierarchical) identity-based encryption. Our construction has both theoretical and practical interests. First, our generic transformation gives a new way of constructing CCA-secure CL-PKE. Second, instantiating our transformation using lattice-based primitives results in a more efficient CCA-secure CL-PKE than its counterpart introduced by Dent in 2008.
Resumo:
An encryption scheme is non-malleable if giving an encryption of a message to an adversary does not increase its chances of producing an encryption of a related message (under a given public key). Fischlin introduced a stronger notion, known as complete non-malleability, which requires attackers to have negligible advantage, even if they are allowed to transform the public key under which the related message is encrypted. Ventre and Visconti later proposed a comparison-based definition of this security notion, which is more in line with the well-studied definitions proposed by Bellare et al. The authors also provide additional feasibility results by proposing two constructions of completely non-malleable schemes, one in the common reference string model using non-interactive zero-knowledge proofs, and another using interactive encryption schemes. Therefore, the only previously known completely non-malleable (and non-interactive) scheme in the standard model, is quite inefficient as it relies on generic NIZK approach. They left the existence of efficient schemes in the common reference string model as an open problem. Recently, two efficient public-key encryption schemes have been proposed by Libert and Yung, and Barbosa and Farshim, both of them are based on pairing identity-based encryption. At ACISP 2011, Sepahi et al. proposed a method to achieve completely non-malleable encryption in the public-key setting using lattices but there is no security proof for the proposed scheme. In this paper we review the mentioned scheme and provide its security proof in the standard model. Our study shows that Sepahi’s scheme will remain secure even for post-quantum world since there are currently no known quantum algorithms for solving lattice problems that perform significantly better than the best known classical (i.e., non-quantum) algorithms.
Resumo:
We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between the dealer and the shareholders. Previous solutions to this problem require one to start off with a nonstandard scheme designed specifically for this purpose, or to have communication between shareholders. In contrast, we show how to increase the threshold parameter of the standard Shamir secret-sharing scheme without communication between the shareholders. Our technique can thus be applied to existing Shamir schemes even if they were set up without consideration to future threshold increases. Our method is a new positive cryptographic application for lattice reduction algorithms, inspired by recent work on lattice-based list decoding of Reed-Solomon codes with noise bounded in the Lee norm. We use fundamental results from the theory of lattices (geometry of numbers) to prove quantitative statements about the information-theoretic security of our construction. These lattice-based security proof techniques may be of independent interest.
Resumo:
The invention of asymmetric encryption back in the seventies was a conceptual leap that vastly increased the expressive power of encryption of the times. For the first time, it allowed the sender of a message to designate the intended recipient in an cryptographic way, expressed as a “public key” that was related to but distinct from the “private key” that, alone, embodied the ability to decrypt. This made large-scale encryption a practical and scalable endeavour, and more than anything else—save the internet itself—led to the advent of electronic commerce as we know and practice it today.
Resumo:
Nick Shackleton’s research on piston cores from the Iberian margin highlighted the importance of this region for providing high-fidelity records of millennial-scale climate variability, and for correlating climate events from the marine environment to polar ice cores and European terrestrial sequences. During the Integrated Ocean Drilling Program (IODP) Expedition 339, we sought to extend the Iberian margin sediment record by drilling with the D/V JOIDES Resolution. Five holes were cored at Site U1385 using the advanced piston corer (APC) system to a maximum depth of ∼ 155.9 m below sea floor (m b.s.f.). Immediately after the expedition, cores from all holes were analyzed by core scanning X-ray fluorescence (XRF) at 1 cm spatial resolution. Ca/Ti data were used to accurately correlate from hole-to-hole and construct a composite spliced section, containing no gaps or disturbed intervals to 166.5 m composite depth (mcd). A low-resolution (20 cm sample spacing) oxygen isotope record confirms that Site U1385 contains a continuous record of hemipelagic sedimentation from the Holocene to 1.43 Ma (Marine Isotope Stage 46). The sediment profile at Site U1385 extends across the middle Pleistocene transition (MPT) with sedimentation rates averaging ∼ 10 cm kyr−1. Strongprecession cycles in colour and elemental XRF signals provide a powerful tool for developing an orbitally tuned reference timescale. Site U1385 is likely to become an important type section for marine–ice–terrestrial core correlations and the study of orbital- and millennial-scale climate variability.
Resumo:
This paper presents ongoing work toward constructing efficient completely non-malleable public-key encryption scheme based on lattices in the standard (common reference string) model. An encryption scheme is completely non-malleable if it requires attackers to have negligible advantage, even if they are allowed to transform the public key under which the related message is encrypted. Ventre and Visconti proposed two inefficient constructions of completely non-malleable schemes, one in the common reference string model using non-interactive zero-knowledge proofs, and another using interactive encryption schemes. Recently, two efficient public-key encryption schemes have been proposed, both of them are based on pairing identity-based encryption.
Resumo:
The selection of cytochrome P450 enzymes from large variant libraries, and the subsequent use of these enzymes in preparative scale biotransformations, remains a formidable challenge due to the complexities of the associated electron transport systems. Here, a powerful approach for the generation and screening of P450cam libraries for new function is presented that is both flexible and robust. A targeted library was generated wherein only the P450cam active-site amino acids Y96 and F98 were fully randomized and biotransformations, using a novel P450cam whole-cell system, were screened by GC–MS for the hydroxylation of diphenylmethane. One in 50 of the reactions screened, including 16 different variants, produced 4-hydroxydiphenylmethane with up to 92% conversion observed in the case of the Y96A variant. These results demonstrate a primary example of the screening of P450cam libraries in a format that is compatible with extension to preparative scale reactions.
Resumo:
This practice-led research project explores the possibilities for restaging and reconfiguring contemporary art installations in multiple and different locations. By exploring ideas and art that demonstrate a kaleidoscopic approach to creative practice, this project examines how analysing artists' particular processes can achieve new understandings and experiences of installation art. This project achieves this through reflection on, and analysis of creative works made throughout the research, and a critical examination of contemporary art practices.
Resumo:
To harness safe operation of Web-based systems in Web environments, we propose an SSPA (Server-based SHA-1 Page-digest Algorithm) to verify the integrity of Web contents before the server issues an HTTP response to a user request. In addition to standard security measures, our Java implementation of the SSPA, which is called the Dynamic Security Surveillance Agent (DSSA), provides further security in terms of content integrity to Web-based systems. Its function is to prevent the display of Web contents that have been altered through the malicious acts of attackers and intruders on client machines. This is to protect the reputation of organisations from cyber-attacks and to ensure the safe operation of Web systems by dynamically monitoring the integrity of a Web site's content on demand. We discuss our findings in terms of the applicability and practicality of the proposed system. We also discuss its time metrics, specifically in relation to its computational overhead at the Web server, as well as the overall latency from the clients' point of view, using different Internet access methods. The SSPA, our DSSA implementation, some experimental results and related work are all discussed
Resumo:
We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between the dealer and the shareholders. Previous solutions to this problem require one to start off with a non-standard scheme designed specifically for this purpose, or to have secure channels between shareholders. In contrast, we show how to increase the threshold parameter of the standard CRT secret-sharing scheme without secure channels between the shareholders. Our method can thus be applied to existing CRT schemes even if they were set up without consideration to future threshold increases. Our method is a positive cryptographic application for lattice reduction algorithms, and we also use techniques from lattice theory (geometry of numbers) to prove statements about the correctness and information-theoretic security of our constructions.
Resumo:
We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between the dealer and the shareholders. Previous solutions to this problem require one to start off with a non-standard scheme designed specifically for this purpose, or to have communication between shareholders. In contrast, we show how to increase the threshold parameter of the standard Shamir secret-sharing scheme without communication between the shareholders. Our technique can thus be applied to existing Shamir schemes even if they were set up without consideration to future threshold increases. Our method is a new positive cryptographic application for lattice reduction algorithms, inspired by recent work on lattice-based list decoding of Reed-Solomon codes with noise bounded in the Lee norm. We use fundamental results from the theory of lattices (Geometry of Numbers) to prove quantitative statements about the information-theoretic security of our construction. These lattice-based security proof techniques may be of independent interest.
Resumo:
Marine sediments around volcanic islands contain an archive of volcaniclastic deposits, which can be used to reconstruct the volcanic history of an area. Such records hold many advantages over often incomplete terrestrial datasets. This includes the potential for precise and continuous dating of intervening sediment packages, which allow a correlatable and temporally-constrained stratigraphic framework to be constructed across multiple marine sediment cores. Here, we discuss a marine record of eruptive and mass-wasting events spanning ~250 ka offshore of Montserrat, using new data from IODP Expedition 340, as well as previously collected cores. By using a combination of high-resolution oxygen isotope stratigraphy, AMS radiocarbon dating, biostratigraphy of foraminifera and calcareous nannofossils and clast componentry, we identify five major events at Soufriere Hills volcano since 250 ka. Lateral correlation of these events across sediment cores collected offshore of the south and south west of Montserrat, have improved our understanding of the timing, extent and associations between events in this area. Correlations reveal that powerful and potentially erosive density-currents travelled at least 33 km offshore, and demonstrate that marine deposits, produced by eruption-fed and mass-wasting events on volcanic islands, are heterogeneous in their spatial distribution. Thus, multiple drilling/coring sites are needed to reconstruct the full chronostratigraphy of volcanic islands. This multidisciplinary study will be vital to interpreting the chaotic records of submarine landslides at other sites drilled during Expedition 340 and provides a framework that can be applied to the stratigraphic analysis of sediments surrounding other volcanic islands.