|
|
|
|
| LEADER |
03855nmm a2200433 u 4500 |
| 001 |
EB000384411 |
| 003 |
EBX01000000000000000237463 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
130626 ||| eng |
| 020 |
|
|
|a 9783642130137
|
| 100 |
1 |
|
|a Nguyen, Phong Q.
|e [editor]
|
| 245 |
0 |
0 |
|a Public Key Cryptography - PKC 2010
|h Elektronische Ressource
|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
|
| 250 |
|
|
|a 1st ed. 2010
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2010, 2010
|
| 300 |
|
|
|a XIII, 519 p. 34 illus
|b online resource
|
| 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 --
|
| 505 |
0 |
|
|a 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 Securityor Support for Negation -- Security of Encryption Schemes in Weakened Random Oracle Models --
|
| 505 |
0 |
|
|a 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
|
| 653 |
|
|
|a Computer Communication Networks
|
| 653 |
|
|
|a Computer science / Mathematics
|
| 653 |
|
|
|a Discrete Mathematics in Computer Science
|
| 653 |
|
|
|a Cryptography
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Electronic data processing / Management
|
| 653 |
|
|
|a Computer networks
|
| 653 |
|
|
|a Data protection
|
| 653 |
|
|
|a Data encryption (Computer science)
|
| 653 |
|
|
|a Cryptology
|
| 653 |
|
|
|a Discrete mathematics
|
| 653 |
|
|
|a Data and Information Security
|
| 653 |
|
|
|a IT Operations
|
| 700 |
1 |
|
|a Pointcheval, David
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
| 490 |
0 |
|
|a Security and Cryptology
|
| 028 |
5 |
0 |
|a 10.1007/978-3-642-13013-7
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-642-13013-7?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.6
|