Public Key Cryptography – PKC 2010 13th International Conference on Practice and Theory in Public Key Cryptography, Paris, France, May 26-28, 2010. Proceedings /

Corporate Author: SpringerLink (Online service)
Other Authors: Nguyen, Phong Q., Pointcheval, David.
Format: Electronic
Language: English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
Series: Lecture Notes in Computer Science, 6056
Subjects:
Online Access: http://dx.doi.org/10.1007/978-3-642-13013-7
Tags: Add Tag
No Tags, Be the first to tag this record!
LEADER 04424nam a22005655i 4500
001 978-3-642-13013-7
003 DE-He213
005 20170324004131.0
007 cr nn 008mamaa
008 100514s2010 gw | s |||| 0|eng d
020 |a 9783642130137  |9 978-3-642-13013-7 
024 7 |a 10.1007/978-3-642-13013-7  |2 doi 
050 4 |a TK5105.5-5105.9 
072 7 |a UKN  |2 bicssc 
072 7 |a COM075000  |2 bisacsh 
082 0 4 |a 004.6  |2 23 
245 1 0 |a Public Key Cryptography – PKC 2010  |h [electronic resource] :  |b 13th International Conference on Practice and Theory in Public Key Cryptography, Paris, France, May 26-28, 2010. Proceedings /  |c edited by Phong Q. Nguyen, David Pointcheval. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2010. 
300 |a XIII, 519 p. 34 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 6056 
505 0 |a Encryption 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. 
650 0 |a Computer science. 
650 0 |a Computer communication systems. 
650 0 |a Computer security. 
650 0 |a Data encryption (Computer science). 
650 0 |a Algorithms. 
650 0 |a Computer science  |x Mathematics. 
650 0 |a Management information systems. 
650 1 4 |a Computer Science. 
650 2 4 |a Computer Communication Networks. 
650 2 4 |a Data Encryption. 
650 2 4 |a Management of Computing and Information Systems. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Systems and Data Security. 
650 2 4 |a Discrete Mathematics in Computer Science. 
700 1 |a Nguyen, Phong Q.  |e editor. 
700 1 |a Pointcheval, David.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783642130120 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 6056 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-13013-7 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645) 
999 |c 45312  |d 45312