國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Advances in cryptology - CRYPTO 2019...

(1998 :)

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

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Advances in cryptology - CRYPTO 2019edited by Alexandra Boldyreva, Daniele Micciancio.
其他題名:	39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019 : proceedings.
其他題名:	CRYPTO 2019
其他作者:	Boldyreva, Alexandra.
團體作者:
出版者:	Cham :Springer International Publishing :2019.
面頁冊數:	xxiii, 771 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Data encryption (Computer science)
電子資源:	https://doi.org/10.1007/978-3-030-26948-7
ISBN:	9783030269487$q(electronic bk.)

Advances in cryptology - CRYPTO 201939th 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] :CRYPTO 2019edited by Alexandra Boldyreva, Daniele Micciancio. - Cham :Springer International Publishing :2019. - xxiii, 771 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,116920302-9743 ;. - Lecture notes in computer science ;4891..

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 Renyi 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$q(electronic bk.)

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

184520
Data encryption (Computer science)

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

Dewey Class. No.: 005.82

Advances in cryptology - CRYPTO 201939th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019 : proceedings.Part I /
LDR:04318nmm a2200373 a 4500 001 586764
003 DE-He213
005 20200709181546.0
006 m d
007 cr nn 008maaau
008 210326s2019 sz s 0 eng d
020 $a 9783030269487$q(electronic bk.)
020 $a 9783030269470$q(paper)
024 7 $a 10.1007/978-3-030-26948-7 $2 doi
035 $a 978-3-030-26948-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 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
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 I / $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 xxiii, 771 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 11692
490 1 $a Security and cryptology
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 Renyi 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 184520
650 0 $a Computer security $v Congresses. $3 383239
650 1 4 $a Cryptology. $3 825728
650 2 4 $a Software Engineering/Programming and Operating Systems. $3 273711
650 2 4 $a Coding and Information Theory. $3 273763
650 2 4 $a Information Systems and Communication Service. $3 274025
650 2 4 $a Computers and Society. $3 273764
650 2 4 $a Artificial Intelligence. $3 212515
700 1 $a Boldyreva, Alexandra. $3 854476
700 1 $a Micciancio, Daniele. $3 485033
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
830 0 $a Security and cryptology. $3 822028
856 4 0 $u https://doi.org/10.1007/978-3-030-26948-7
950 $a Computer Science (SpringerNature-11645)