Check nearby libraries
Buy this book
![Loading indicator](/images/ajax-loader-bar.gif)
This book constitutes the refereed proceedings of the 18th International Conference on the Theory and Application of Cryptology and Information Security, Asiacrypt 2012, held in Beijing, China, in December 2012.
The 43 full papers presented were carefully reviewed and selected from 241 submissions. They are organized in topical sections named: public-key cryptography, foundation, symmetric cipher, security proof, lattice-based cryptography and number theory, hash function, cryptographic protocol, and implementation issues.
Publish Date
2012
Publisher
Springer Berlin Heidelberg,
Imprint: Springer
Language
English
Pages
778
Check nearby libraries
Buy this book
![Loading indicator](/images/ajax-loader-bar.gif)
Previews available in: English
Subjects
Computational complexity, Information Systems, Discrete Mathematics in Computer Science, Systems and Data Security, Computer science, Algorithm Analysis and Problem Complexity, Applications of Mathematics, Data Encryption, Data protection, Management of Computing and Information Systems, Mathematics, Computer software, Data encryption (Computer science), Cryptography, Congresses, Computer securityShowing 1 featured edition. View all 1 editions?
Edition | Availability |
---|---|
1
Advances in Cryptology – ASIACRYPT 2012: 18th International Conference on the Theory and Application of Cryptology and Information Security, Beijing, China, December 2-6, 2012. Proceedings
2012, Springer Berlin Heidelberg, Imprint: Springer
electronic resource :
in English
3642349617 9783642349614
|
aaaa
Libraries near you:
WorldCat
|
Book Details
Table of Contents
Pairing-Based Cryptography
Past, Present, and Future
Some Mathematical Mysteries in Lattices
Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions
Dual Form Signatures: An Approach for Proving Security from Static Assumptions
Breaking Pairing-Based Cryptosystems Using ηT Pairing over GF(397)
On the (Im)possibility of Projecting Property in Prime-Order Setting
Optimal Reductions of Some Decisional Problems to the Rank Problem
Signature Schemes Secure against Hard-to-Invert Leakage
Completeness for Symmetric Two-Party Functionalities - Revisited
Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
The Generalized Randomized Iterate and Its Application to New Efficient Constructions of UOWHFs from Regular One-Way Functions
Symmetric Cipher Perfect Algebraic Immune Functions
Differential Analysis of the LED Block Cipher
^
PRINCE – A Low-Latency Block Cipher for Pervasive Computing Applications: Extended Abstract
Analysis of Differential Attacks in ARX Constructions
Integral and Multidimensional Linear Distinguishers with Correlation Zero
Differential Attacks against Stream Cipher ZUC
An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher
3kf9: Enhancing 3GPP-MAC beyond the Birthday Bound
Understanding Adaptivity: Random Systems Revisited
RKA Security beyond the Linear Barrier: IBE, Encryption and Signatures
Fully Secure Unbounded Inner-Product and Attribute-Based Encryption
Computing on Authenticated Data: New Privacy Definitions and Constructions
A Coding-Theoretic Approach to Recovering Noisy RSA Keys
Certifying RSA
Lattice-Based Cryptography and Number Theory Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic
Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures
^
^^
On Polynomial Systems Arising from a Weil Descent
ECM at Work
IND-CCA Secure Cryptography Based on a Variant of the LPN Problem
Provable Security of the Knudsen-Preneel Compression Functions
Optimal Collision Security in Double Block Length Hashing with Single Length Key
Bicliques for Permutations: Collision and Preimage Attacks in Stronger Settings
Investigating Fundamental Security Requirements on Whirlpool: Improved Preimage and Collision Attacks
Generic Related-Key Attacks for HMAC
The Five-Card Trick Can Be Done with Four Cards
A Mix-Net from Any CCA2 Secure Cryptosystem
How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios
Sequential Aggregate Signatureswith Lazy Verification from Trapdoor Permutations (Extended Abstract)
Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
Calling Out Cheaters: Covert Security with Public Verifiability
^
^^
A Unified Framework for UC from Only OT
Four-Dimensional Gallant-Lambert-Vanstone Scalar Multiplication
Shuffling against Side-Channel Attacks: A Comprehensive Study with Cautionary Note
Theory and Practice of a Leakage Resilient Masking Scheme.
^^
Edition Notes
Classifications
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?November 13, 2020 | Edited by MARC Bot | import existing book |
June 28, 2019 | Created by MARC Bot | import new book |