コンテンツへ移動
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 資料のプレビュー
閉じる資料のプレビュー
確認中…

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

著者: Xiaoyun Wang; Kazue Sako, (Innovation Producer)
出版: Heidelberg ; New York : Springer, ©2012
シリーズ: Lecture notes in computer science, 7658.
エディション/フォーマット:   電子書籍 : Document : Conference publication : Englishすべてのエディションとフォーマットを見る
データベース:WorldCat
概要:
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,  続きを読む
評価:

(まだ評価がありません) 0 件のレビュー - 是非あなたから!

件名:
関連情報:

 

オンラインで入手

この資料へのリンク

オフラインで入手

&AllPage.SpinnerRetrieving; この資料の所蔵館を検索中…

詳細

ジャンル/形式: Conference proceedings
Congresses
資料の種類: Conference publication, Document, インターネット資料
ドキュメントの種類: インターネットリソース, コンピューターファイル
すべての著者/寄与者: Xiaoyun Wang; Kazue Sako, (Innovation Producer)
ISBN: 3642349617 9783642349614
OCLC No.: 821020978
物理形態: 1 online resource (xv, 778 p.)
コンテンツ: 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 [eta]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.
シリーズタイトル: Lecture notes in computer science, 7658.
責任者: Xiaoyun Wang, Kazue Sako, eds.
その他の情報:

概要:

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.

レビュー

ユーザーレビュー
GoodReadsのレビューを取得中…
DOGObooksのレビューを取得中…

タグ

まずはあなたから!
リクエストの確認

あなたは既にこの資料をリクエストしている可能性があります。このリクエストを続行してよろしければ、OK を選択してください。

リンクデータ


<http://www.worldcat.org/oclc/821020978>
library:oclcnum"821020978"
library:placeOfPublication
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:MediaObject
rdf:typeschema:Book
rdf:valueUnknown value: cnp
rdf:valueUnknown value: dct
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:bookFormatschema:EBook
schema:contributor
schema:contributor
schema:copyrightYear"2012"
schema:creator
schema:datePublished"2012"
schema:description"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."
schema:description"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 [eta]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."
schema:exampleOfWork<http://worldcat.org/entity/work/id/1203208432>
schema:genre"Conference proceedings"
schema:inLanguage"en"
schema:isPartOf
schema:name"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"
schema:numberOfPages"778"
schema:publication
schema:publisher
schema:url<http://site.ebrary.com/id/10634829>
schema:url
schema:workExample
schema:workExample
wdrs:describedby

Content-negotiable representations

ウインドウを閉じる

WorldCatにログインしてください 

アカウントをお持ちではないですか?簡単に 無料アカウントを作成することができます。.