Franklin

Advances in Cryptology -- CRYPTO 2010 [electronic resource] : 30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15-19, 2010, Proceedings / edited by Tal Rabin.

Edition:
1st ed. 2010.
Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010.
Series:
Computer Science (Springer-11645)
LNCS sublibrary. Security and cryptology SL 4, 6223
Security and Cryptology ; 6223
Format/Description:
Book
1 online resource (XIV, 744 pages) : 63 illustrations
Subjects:
Data encryption (Computer science)
Management information systems.
Computer science.
Computer networks.
Computer security.
Computers and civilization.
Computer science-Mathematics.
Local subjects:
Cryptology.
Management of Computing and Information Systems.
Computer Communication Networks.
Systems and Data Security.
Computers and Society.
Discrete Mathematics in Computer Science.
System Details:
text file PDF
Contents:
Leakage
Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
Leakage-Resilient Pseudorandom Functions and Side-Channel Attacks on Feistel Networks
Protecting Cryptographic Keys against Continual Leakage
Securing Computation against Continuous Leakage
Lattice
An Efficient and Parallel Gaussian Sampler for Lattices
Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
Homomorphic Encryption
Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
Additively Homomorphic Encryption with d-Operand Multiplications
i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
Theory and Applications
Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography
Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
Structure-Preserving Signatures and Commitments to Group Elements
Efficient Indifferentiable Hashing into Ordinary Elliptic Curves
Key Exchange, OAEP/RSA, CCA
Credential Authenticated Identification and Key Exchange
Password-Authenticated Session-Key Generation on the Internet in the Plain Model
Instantiability of RSA-OAEP under Chosen-Plaintext Attack
Efficient Chosen-Ciphertext Security via Extractable Hash Proofs
Attacks
Factorization of a 768-Bit RSA Modulus
Correcting Errors in RSA Private Keys
Improved Differential Attacks for ECHO and Grøstl
A Practical-Time Related-Key Attack on the KASUMI Cryptosystem Used in GSM and 3G Telephony
Composition
Universally Composable Incoercibility
Concurrent Non-Malleable Zero Knowledge Proofs
Equivalence of Uniform Key Agreement and Composition Insecurity
Computation Delegation and Obfuscation
Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
Improved Delegation of Computation Using Fully Homomorphic Encryption
Oblivious RAM Revisited
On Strong Simulation and Composable Point Obfuscation
Multiparty Computation
Protocols for Multiparty Coin Toss with Dishonest Majority
Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost
Secure Multiparty Computation with Minimal Interaction
A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security
Pseudorandomness
On Generalized Feistel Networks
Cryptographic Extraction and Key Derivation: The HKDF Scheme
Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks
Quantum
Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Sampling in a Quantum Population, and Applications.
Contributor:
Rabin, Tal. editor., Editor,
SpringerLink (Online service)
Contained In:
Springer eBooks
Other format:
Printed edition:
Printed edition:
ISBN:
978-3-642-14623-7
9783642146237
Publisher Number:
10.1007/978-3-642-14623-7 doi
Access Restriction:
Restricted for use by site license.
Loading...
Location Notes Your Loan Policy
Description Status Barcode Your Loan Policy