컨텐츠로 이동
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.
판/형식:   전자도서 : 문서 : 컨퍼런스 간행물 : 영어모든 판과 형식 보기
데이터베이스: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
자료 유형: 컨퍼런스 간행물, 문서, 인터넷 자료
문서 형식: 인터넷 자원, 컴퓨터 파일
모든 저자 / 참여자: Xiaoyun Wang; Kazue Sako, (Innovation Producer)
ISBN: 3642349617 9783642349614
OCLC 번호: 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
owl:sameAs<info:oclcnum/821020978>
rdf:typeschema:Book
schema:about
schema:about
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:genre"Conference proceedings"
schema:inLanguage"en"
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:publisher
schema:url<http://site.ebrary.com/id/10634829>
schema:url
schema:url<http://dx.doi.org/10.1007/978-3-642-34961-4>
schema:workExample

Content-negotiable representations

윈도우 닫기

WorldCat에 로그인 하십시오 

계정이 없으세요? 아주 간단한 절차를 통하여 무료 계정을 만드실 수 있습니다.