東華大學圖書館 |

Advances in cryptology - CRYPTO 2019 = 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019 : proceedings.. Part II /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Advances in cryptology - CRYPTO 2019/ edited by Alexandra Boldyreva, Daniele Micciancio.
其他題名:	39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019 : proceedings.
其他題名:	CRYPTO 2019
其他作者:	Boldyreva, Alexandra.
團體作者:	CRYPTO (Conference)
出版者:	Cham :Springer International Publishing : : 2019.,
面頁冊數:	xv, 861 p. :ill. (some col.), digital ;24 cm.
內容註:	MPC Communication Complexity -- The Communication Complexity of Threshold Private Set Intersection -- Adaptively Secure MPC with Sublinear Communication Complexity -- Communication Lower Bounds for Statistically Secure MPC, with or without Preprocessing -- Communication-Efficient Unconditional MPC with Guaranteed Output Delivery -- Symmetric Cryptanalysis -- Efficient Collision Attack Frameworks for RIPEMD-160 -- Improving Attacks on Round-Reduced Speck32/64 Using Deep Learning -- Correlation of Quadratic Boolean Functions: Cryptanalysis of All Versions of Full MORUS -- Low Memory Attacks against Two-Round Even-Mansour using the 3-XOR Problem -- (Post) Quantum Cryptography -- How to Record Quantum Queries, and Applications to Quantum Indifferentiability -- Quantum security proofs using semi-classical oracles -- Quantum Indistinguishability of Random Sponges -- Revisiting Post-Quantum Fiat-Shamir -- Security of the Fiat-Shamir Transformation in the Quantum Random-Oracle Model -- Leakage Resilience -- Unconditionally Secure Computation Against Low-Complexity Leakage -- Tight Leakage-Resilient CCA-Security from Quasi-Adaptive Hash Proof System -- Non-Malleable Secret Sharing in the Computational Setting: Adaptive Tampering, Noisy-Leakage Resilience, and Improved Rate -- Leakage Resilient Secret Sharing and Applications -- Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures -- Memory Hard Functions and Privacy Amplification -- Memory-Hard Functions from Cryptographic Primitives -- Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions -- Simultaneous Amplification: The Case of Non-Interactive Zero-Knowledge -- The Privacy Blanket of the Shuffle Model -- Attribute Based Encryption -- Realizing Chosen Ciphertext Security Generically in Attribute-Based Encryption and Predicate Encryption -- Match Me if You Can: Matchmaking Encryption and its Applications -- ABE for DFA from k-Lin -- Attribute Based Encryption (and more) for Nondeterministic Finite Automata from LWE -- Foundations -- The Distinction Between Fixed and Random Generators in Group-Based Assumptions -- Unifying computational entropies via Kullback-Leibler divergence.
Contained By:	Springer Nature eBook
標題:	Data encryption (Computer science) - Congresses. -
電子資源:	https://doi.org/10.1007/978-3-030-26951-7
ISBN:	9783030269517

Advances in cryptology - CRYPTO 2019 = 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019 : proceedings.. Part II /
Advances in cryptology - CRYPTO 201939th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019 : proceedings.Part II /[electronic resource] :CRYPTO 2019edited by Alexandra Boldyreva, Daniele Micciancio. - Cham :Springer International Publishing :2019. - xv, 861 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,116930302-9743 ;. - Lecture notes in computer science ;11693..

MPC Communication Complexity -- The Communication Complexity of Threshold Private Set Intersection -- Adaptively Secure MPC with Sublinear Communication Complexity -- Communication Lower Bounds for Statistically Secure MPC, with or without Preprocessing -- Communication-Efficient Unconditional MPC with Guaranteed Output Delivery -- Symmetric Cryptanalysis -- Efficient Collision Attack Frameworks for RIPEMD-160 -- Improving Attacks on Round-Reduced Speck32/64 Using Deep Learning -- Correlation of Quadratic Boolean Functions: Cryptanalysis of All Versions of Full MORUS -- Low Memory Attacks against Two-Round Even-Mansour using the 3-XOR Problem -- (Post) Quantum Cryptography -- How to Record Quantum Queries, and Applications to Quantum Indifferentiability -- Quantum security proofs using semi-classical oracles -- Quantum Indistinguishability of Random Sponges -- Revisiting Post-Quantum Fiat-Shamir -- Security of the Fiat-Shamir Transformation in the Quantum Random-Oracle Model -- Leakage Resilience -- Unconditionally Secure Computation Against Low-Complexity Leakage -- Tight Leakage-Resilient CCA-Security from Quasi-Adaptive Hash Proof System -- Non-Malleable Secret Sharing in the Computational Setting: Adaptive Tampering, Noisy-Leakage Resilience, and Improved Rate -- Leakage Resilient Secret Sharing and Applications -- Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures -- Memory Hard Functions and Privacy Amplification -- Memory-Hard Functions from Cryptographic Primitives -- Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions -- Simultaneous Amplification: The Case of Non-Interactive Zero-Knowledge -- The Privacy Blanket of the Shuffle Model -- Attribute Based Encryption -- Realizing Chosen Ciphertext Security Generically in Attribute-Based Encryption and Predicate Encryption -- Match Me if You Can: Matchmaking Encryption and its Applications -- ABE for DFA from k-Lin -- Attribute Based Encryption (and more) for Nondeterministic Finite Automata from LWE -- Foundations -- The Distinction Between Fixed and Random Generators in Group-Based Assumptions -- Unifying computational entropies via Kullback-Leibler divergence.

The three-volume set, LNCS 11692, LNCS 11693, and LNCS 11694, constitutes the refereed proceedings of the 39th Annual International Cryptology Conference, CRYPTO 2019, held in Santa Barbara, CA, USA, in August 2019. The 81 revised full papers presented were carefully reviewed and selected from 378 submissions. The papers are organized in the following topical sections: Part I: Award papers; lattice-based ZK; symmetric cryptography; mathematical cryptanalysis; proofs of storage; non-malleable codes; SNARKs and blockchains; homomorphic cryptography; leakage models and key reuse. Part II: MPC communication complexity; symmetric cryptanalysis; (post) quantum cryptography; leakage resilience; memory hard functions and privacy amplification; attribute based encryption; foundations. Part III: Trapdoor functions; zero knowledge I; signatures and messaging; obfuscation; watermarking; secure computation; various topics; zero knowledge II; key exchange and broadcast encryption.

ISBN: 9783030269517

Standard No.: 10.1007/978-3-030-26951-7doiSubjects--Topical Terms:

844473
Data encryption (Computer science)
--Congresses.

LC Class. No.: QA76.9.A25 / C79 2019

Dewey Class. No.: 005.82

Advances in cryptology - CRYPTO 2019 = 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019 : proceedings.. Part II /
LDR:04496nmm a2200373 a 4500 001 2242751
003 DE-He213
005 20200708143420.0
006 m d
007 cr nn 008maaau
008 211207s2019 sz s 0 eng d
020 $a 9783030269517 $q (electronic bk.)
020 $a 9783030269500 $q (paper)
024 7 $a 10.1007/978-3-030-26951-7 $2 doi
035 $a 978-3-030-26951-7
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A25 $b C79 2019
072 7 $a GPJ $2 bicssc
072 7 $a COM053000 $2 bisacsh
072 7 $a GPJ $2 thema
072 7 $a URY $2 thema
082 0 4 $a 005.82 $2 23
090 $a QA76.9.A25 $b C957 2019
111 2 $a CRYPTO (Conference) $n (39th : $d 2019 : $c Santa Barbara, Calif.) $3 3502222
245 1 0 $a Advances in cryptology - CRYPTO 2019 $h [electronic resource] : $b 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019 : proceedings. $n Part II / $c edited by Alexandra Boldyreva, Daniele Micciancio.
246 3 $a CRYPTO 2019
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a xv, 861 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 11693
490 1 $a Security and cryptology
505 0 $a MPC Communication Complexity -- The Communication Complexity of Threshold Private Set Intersection -- Adaptively Secure MPC with Sublinear Communication Complexity -- Communication Lower Bounds for Statistically Secure MPC, with or without Preprocessing -- Communication-Efficient Unconditional MPC with Guaranteed Output Delivery -- Symmetric Cryptanalysis -- Efficient Collision Attack Frameworks for RIPEMD-160 -- Improving Attacks on Round-Reduced Speck32/64 Using Deep Learning -- Correlation of Quadratic Boolean Functions: Cryptanalysis of All Versions of Full MORUS -- Low Memory Attacks against Two-Round Even-Mansour using the 3-XOR Problem -- (Post) Quantum Cryptography -- How to Record Quantum Queries, and Applications to Quantum Indifferentiability -- Quantum security proofs using semi-classical oracles -- Quantum Indistinguishability of Random Sponges -- Revisiting Post-Quantum Fiat-Shamir -- Security of the Fiat-Shamir Transformation in the Quantum Random-Oracle Model -- Leakage Resilience -- Unconditionally Secure Computation Against Low-Complexity Leakage -- Tight Leakage-Resilient CCA-Security from Quasi-Adaptive Hash Proof System -- Non-Malleable Secret Sharing in the Computational Setting: Adaptive Tampering, Noisy-Leakage Resilience, and Improved Rate -- Leakage Resilient Secret Sharing and Applications -- Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures -- Memory Hard Functions and Privacy Amplification -- Memory-Hard Functions from Cryptographic Primitives -- Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions -- Simultaneous Amplification: The Case of Non-Interactive Zero-Knowledge -- The Privacy Blanket of the Shuffle Model -- Attribute Based Encryption -- Realizing Chosen Ciphertext Security Generically in Attribute-Based Encryption and Predicate Encryption -- Match Me if You Can: Matchmaking Encryption and its Applications -- ABE for DFA from k-Lin -- Attribute Based Encryption (and more) for Nondeterministic Finite Automata from LWE -- Foundations -- The Distinction Between Fixed and Random Generators in Group-Based Assumptions -- Unifying computational entropies via Kullback-Leibler divergence.
520 $a The three-volume set, LNCS 11692, LNCS 11693, and LNCS 11694, constitutes the refereed proceedings of the 39th Annual International Cryptology Conference, CRYPTO 2019, held in Santa Barbara, CA, USA, in August 2019. The 81 revised full papers presented were carefully reviewed and selected from 378 submissions. The papers are organized in the following topical sections: Part I: Award papers; lattice-based ZK; symmetric cryptography; mathematical cryptanalysis; proofs of storage; non-malleable codes; SNARKs and blockchains; homomorphic cryptography; leakage models and key reuse. Part II: MPC communication complexity; symmetric cryptanalysis; (post) quantum cryptography; leakage resilience; memory hard functions and privacy amplification; attribute based encryption; foundations. Part III: Trapdoor functions; zero knowledge I; signatures and messaging; obfuscation; watermarking; secure computation; various topics; zero knowledge II; key exchange and broadcast encryption.
650 0 $a Data encryption (Computer science) $v Congresses. $3 844473
650 0 $a Computer security $v Congresses. $3 622818
650 1 4 $a Cryptology. $3 3382308
650 2 4 $a Software Engineering/Programming and Operating Systems. $3 891214
650 2 4 $a Coding and Information Theory. $3 891252
650 2 4 $a Information Systems and Communication Service. $3 891044
650 2 4 $a Computers and Society. $3 891253
650 2 4 $a Artificial Intelligence. $3 769149
700 1 $a Boldyreva, Alexandra. $3 3502223
700 1 $a Micciancio, Daniele. $3 1085737
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 11693. $3 3502224
830 0 $a Security and cryptology. $3 3382517
856 4 0 $u https://doi.org/10.1007/978-3-030-26951-7
950 $a Computer Science (SpringerNature-11645)