000 05971nam a22005535i 4500
001 u374390
003 SIRSI
005 20160812084232.0
007 cr nn 008mamaa
008 100514s2010 gw | s |||| 0|eng d
020 _a9783642130137
_9978-3-642-13013-7
040 _cMX-MeUAM
050 4 _aTK5105.5-5105.9
082 0 4 _a004.6
_223
100 1 _aNguyen, Phong Q.
_eeditor.
245 1 0 _aPublic Key Cryptography – PKC 2010
_h[recurso electrónico] :
_b13th International Conference on Practice and Theory in Public Key Cryptography, Paris, France, May 26-28, 2010. Proceedings /
_cedited by Phong Q. Nguyen, David Pointcheval.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
300 _aXIII, 519p. 34 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6056
505 0 _aEncryption I -- Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model -- Constant Size Ciphertexts in Threshold Attribute-Based Encryption -- Cryptanalysis -- Algebraic Cryptanalysis of the PKC’2009 Algebraic Surface Cryptosystem -- Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA -- Implicit Factoring with Shared Most Significant and Middle Bits -- Protocols I -- On the Feasibility of Consistent Computations -- Multi-query Computationally-Private Information Retrieval with Constant Communication Rate -- Further Observations on Optimistic Fair Exchange Protocols in the Multi-user Setting -- Network Coding -- Secure Network Coding over the Integers -- Preventing Pollution Attacks in Multi-source Network Coding -- Tools -- Groth–Sahai Proofs Revisited -- Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments -- Elliptic Curves -- Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions -- Faster Pairing Computations on Curves with High-Degree Twists -- Efficient Arithmetic on Hessian Curves -- Lossy Trapdoor Functions -- CCA Proxy Re-Encryption without Bilinear Maps in the Standard Model -- More Constructions of Lossy and Correlation-Secure Trapdoor Functions -- Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions -- Protocols II -- Efficient Set Operations in the Presence of Malicious Adversaries -- Text Search Protocols with Simulation Based Security -- Discrete Logarithm -- Solving a 676-Bit Discrete Logarithm Problem in GF(36n ) -- Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval -- Encryption II -- Functional Encryption for Inner Product: Achieving Constant-Size Ciphertexts with Adaptive Security or Support for Negation -- Security of Encryption Schemes in Weakened Random Oracle Models -- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes -- Signatures -- Unlinkability of Sanitizable Signatures -- Confidential Signatures and Deterministic Signcryption -- Identity-Based Aggregate and Multi-Signature Schemes Based on RSA -- Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More.
520 _aThe 13th International Conference on Practice and Theory in Public Key Cryp- ´ tography(PKC2010)washeldMay26–28,2010,attheEcoleNormaleSup´ erieure (ENS) in Paris, France. PKC 2010 was sponsored by the International Associ- ´ ation for Cryptologic Research (IACR), in cooperation with the Ecole Normale Sup´ erieure (ENS) and the Institut National de Recherche en Informatique et en Automatique (INRIA). The General Chairs of the conference were Michel Abdalla and Pierre-Alain Fouque. The conference received a record number of 145 submissions and each s- missionwas assignedto at least 3 committee members. Submissions co-authored by members of the Program Committee were assigned to at least ?ve comm- tee members. Due to the large number of high-quality submissions, the review process was challenging and we are deeply grateful to the 34 committee m- bers and the 163 external reviewers for their outstanding work. After extensive discussions, the Program Committee selected 29 submissions for presentation during the conference and these are the articles that are included in this v- ume. The best paper was awardedto Petros Mol and Scott Yilek for their paper “Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions. ” The - view process was run using the iChair software, written by Thomas Baign` eres and Matthieu Finiasz from EPFL, LASEC, Switzerland, and we are indebted to them for letting us use their software. The program also included two invited talks: it was a great honor to have Daniele Micciancio and Jacques Stern as invited speakers.
650 0 _aComputer science.
650 0 _aComputer Communication Networks.
650 0 _aData protection.
650 0 _aData encryption (Computer science).
650 0 _aComputer software.
650 0 _aComputational complexity.
650 0 _aInformation Systems.
650 1 4 _aComputer Science.
650 2 4 _aComputer Communication Networks.
650 2 4 _aData Encryption.
650 2 4 _aManagement of Computing and Information Systems.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aSystems and Data Security.
650 2 4 _aDiscrete Mathematics in Computer Science.
700 1 _aPointcheval, David.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642130120
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6056
856 4 0 _zLibro electrónico
_uhttp://148.231.10.114:2048/login?url=http://link.springer.com/book/10.1007/978-3-642-13013-7
596 _a19
942 _cLIBRO_ELEC
999 _c202270
_d202270