國立虎尾科技大學 |

Advances in Cryptology – CRYPTO 2019 = 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019, Proceedings, Part I /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Advances in Cryptology – CRYPTO 2019/ edited by Alexandra Boldyreva, Daniele Micciancio.
Reminder of title:	39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019, Proceedings, Part I /
other author:	Boldyreva, Alexandra.
Description:	XXIII, 771 p. 1614 illus., 51 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Data encryption (Computer science). -
Online resource:	https://doi.org/10.1007/978-3-030-26948-7
ISBN:	9783030269487

Advances in Cryptology – CRYPTO 2019 = 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019, Proceedings, Part I /
Advances in Cryptology – CRYPTO 201939th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019, Proceedings, Part I /[electronic resource] :edited by Alexandra Boldyreva, Daniele Micciancio. - 1st ed. 2019. - XXIII, 771 p. 1614 illus., 51 illus. in color.online resource. - Security and Cryptology ;11692. - Security and Cryptology ;9241.

Award Papers -- Cryptanalysis of OCB2: Attacks on Authenticity and Confidentiality -- Quantum cryptanalysis in the RAM model: Claw-finding attacks on SIKE -- Fully Secure Attribute-Based Encryption for t-CNF from LWE -- Lattice-Based ZK -- Noninteractive Zero Knowledge for NP from (Plain) Learning With Errors -- Lattice-Based Zero-Knowledge Proofs: New Techniques for Shorter and Faster Constructions and Applications -- Efficient Lattice-Based Zero-Knowledge Arguments with Standard Soundness: Construction and Applications -- Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs -- Symmetric Cryptography -- Seedless Fruit is the Sweetest: Random Number Generation, Revisited -- Nonces are Noticed: AEAD Revisited -- How to Build Pseudorandom Functions From Public Random Permutations -- Mathematical Cryptanalysis -- New Results on Modular Inversion Hidden Number Problem and Inversive Congruential Generator -- On the Shortness of Vectors to be found by the Ideal-SVP Quantum Algorithm -- Proofs of Storage -- Proofs of Replicated Storage Without Timing Assumptions -- Simple Proofs of Space-Time and Rational Proofs of Storage -- Non-Malleable Codes -- Non-Malleable Codes for Decision Trees -- Explicit Rate-1 Non-malleable Codes for Local Tampering -- Continuous Space-Bounded Non-Malleable Codes from Stronger Proofs-of-Space -- SNARKs and Blockchains -- Synchronous, with a Chance of Partition Tolerance -- Subvector Commitments with Application to Succinct Arguments -- Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains -- Homomorphic Cryptography -- On the Plausibility of Fully Homomorphic Encryption for RAMs -- Homomorphic Time-Lock Puzzles and Applications -- Symmetric Primitives with Structured Secrets -- Leakage Models and Key Reuse -- Unifying Leakage Models on a Rényi Day -- Leakage Certification Revisited: Bounding Model Errors in Side-Channel Security Evaluations -- Security in the Presence of Key Reuse: Context-Separable Interfaces and their Applications.

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: 9783030269487

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

1051084
Data encryption (Computer science).

LC Class. No.: QA76.9.D335

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 I /
LDR:04567nam a22004215i 4500 001 1009497
003 DE-He213
005 20200709181546.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030269487 $9 978-3-030-26948-7
024 7 $a 10.1007/978-3-030-26948-7 $2 doi
035 $a 978-3-030-26948-7
050 4 $a QA76.9.D335
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
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, Part I / $c edited by Alexandra Boldyreva, Daniele Micciancio.
250 $a 1st ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a XXIII, 771 p. 1614 illus., 51 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Security and Cryptology ; $v 11692
505 0 $a Award Papers -- Cryptanalysis of OCB2: Attacks on Authenticity and Confidentiality -- Quantum cryptanalysis in the RAM model: Claw-finding attacks on SIKE -- Fully Secure Attribute-Based Encryption for t-CNF from LWE -- Lattice-Based ZK -- Noninteractive Zero Knowledge for NP from (Plain) Learning With Errors -- Lattice-Based Zero-Knowledge Proofs: New Techniques for Shorter and Faster Constructions and Applications -- Efficient Lattice-Based Zero-Knowledge Arguments with Standard Soundness: Construction and Applications -- Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs -- Symmetric Cryptography -- Seedless Fruit is the Sweetest: Random Number Generation, Revisited -- Nonces are Noticed: AEAD Revisited -- How to Build Pseudorandom Functions From Public Random Permutations -- Mathematical Cryptanalysis -- New Results on Modular Inversion Hidden Number Problem and Inversive Congruential Generator -- On the Shortness of Vectors to be found by the Ideal-SVP Quantum Algorithm -- Proofs of Storage -- Proofs of Replicated Storage Without Timing Assumptions -- Simple Proofs of Space-Time and Rational Proofs of Storage -- Non-Malleable Codes -- Non-Malleable Codes for Decision Trees -- Explicit Rate-1 Non-malleable Codes for Local Tampering -- Continuous Space-Bounded Non-Malleable Codes from Stronger Proofs-of-Space -- SNARKs and Blockchains -- Synchronous, with a Chance of Partition Tolerance -- Subvector Commitments with Application to Succinct Arguments -- Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains -- Homomorphic Cryptography -- On the Plausibility of Fully Homomorphic Encryption for RAMs -- Homomorphic Time-Lock Puzzles and Applications -- Symmetric Primitives with Structured Secrets -- Leakage Models and Key Reuse -- Unifying Leakage Models on a Rényi Day -- Leakage Certification Revisited: Bounding Model Errors in Side-Channel Security Evaluations -- Security in the Presence of Key Reuse: Context-Separable Interfaces and their Applications.
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). $3 1051084
650 0 $a Software engineering. $3 562952
650 0 $a Coding theory. $3 561460
650 0 $a Information theory. $3 595305
650 0 $a Computers. $3 565115
650 0 $a Computers and civilization. $3 556557
650 0 $a Artificial intelligence. $3 559380
650 1 4 $a Cryptology. $3 1211076
650 2 4 $a Software Engineering/Programming and Operating Systems. $3 669780
650 2 4 $a Coding and Information Theory. $3 669784
650 2 4 $a Information Systems and Communication Service. $3 669203
650 2 4 $a Computers and Society. $3 669900
650 2 4 $a Artificial Intelligence. $3 646849
700 1 $a Boldyreva, Alexandra. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1281550
700 1 $a Micciancio, Daniele. $e editor. $1 https://orcid.org/0000-0003-3323-9985 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1299232
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030269470
776 0 8 $i Printed edition: $z 9783030269494
830 0 $a Security and Cryptology ; $v 9241 $3 1254069
856 4 0 $u https://doi.org/10.1007/978-3-030-26948-7
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)