國立虎尾科技大學 |

Theory of Cryptography = 17th International Conference, TCC 2019, Nuremberg, Germany, December 1–5, 2019, Proceedings, Part II /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Theory of Cryptography/ edited by Dennis Hofheinz, Alon Rosen.
其他題名:	17th International Conference, TCC 2019, Nuremberg, Germany, December 1–5, 2019, Proceedings, Part II /
其他作者:	Hofheinz, Dennis.
面頁冊數:	XIV, 578 p. 565 illus., 7 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Data encryption (Computer science). -
電子資源:	https://doi.org/10.1007/978-3-030-36033-7
ISBN:	9783030360337

Theory of Cryptography = 17th International Conference, TCC 2019, Nuremberg, Germany, December 1–5, 2019, Proceedings, Part II /
Theory of Cryptography17th International Conference, TCC 2019, Nuremberg, Germany, December 1–5, 2019, Proceedings, Part II /[electronic resource] :edited by Dennis Hofheinz, Alon Rosen. - 1st ed. 2019. - XIV, 578 p. 565 illus., 7 illus. in color.online resource. - Security and Cryptology ;11892. - Security and Cryptology ;9241.

Succinct Arguments in the Quantum Random Oracle Model -- Delegating Quantum Computation in the Quantum Random Oracle Model -- Tighter proofs of CCA security in the quantum random oracle model -- Attribute Based Encryption for Deterministic Finite Automata from DLIN -- CPA-to-CCA Transformation for KDM Security -- New Approaches to Traitor Tracing with Embedded Identities -- A Unified and Composable Take on Ratcheting -- Continuously Non-Malleable Secret Sharing for General Access Structures -- Interactive Non-Malleable Codes -- Stronger Lower Bounds for Online ORAM -- Adaptively Secure Garbling Schemes for Parallel Computations -- Statistical Difference Beyond the Polarizing Regime -- Estimating Gaps in Martingales and Applications to Coin-Tossing: Constructions & Hardness -- Fully Homomorphic NIZK and NIWI Proofs -- Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND -- Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles -- Compressible FHE with Applications to PIR -- Permuted Puzzles and Cryptographic Hardness -- Linear-Size Constant-Query IOPs for Delegating Computation -- On the (In)security of Kilian-Based SNARGs -- Incrementally Verifiable Computation via Incremental PCPs.

The two-volume set LNCS 11891 and 11892 constitutes the proceedings of the 17th International Conference on Theory of Cryptography, TCC 2019, held in Nuremberg, Germany, in December 2019. The 43 full papers presented were carefully reviewed and selected from 147 submissions. The Theory of Cryptography Conference deals with the paradigms, approaches, and techniques used to conceptualize natural cryptographic problems and provide algorithmic solutions to them and much more.

ISBN: 9783030360337

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

1051084
Data encryption (Computer science).

LC Class. No.: QA76.9.D335

Dewey Class. No.: 005.82

Theory of Cryptography = 17th International Conference, TCC 2019, Nuremberg, Germany, December 1–5, 2019, Proceedings, Part II /
LDR:03234nam a22004215i 4500 001 1004960
003 DE-He213
005 20200701050026.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030360337 $9 978-3-030-36033-7
024 7 $a 10.1007/978-3-030-36033-7 $2 doi
035 $a 978-3-030-36033-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 Theory of Cryptography $h [electronic resource] : $b 17th International Conference, TCC 2019, Nuremberg, Germany, December 1–5, 2019, Proceedings, Part II / $c edited by Dennis Hofheinz, Alon Rosen.
250 $a 1st ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a XIV, 578 p. 565 illus., 7 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 11892
505 0 $a Succinct Arguments in the Quantum Random Oracle Model -- Delegating Quantum Computation in the Quantum Random Oracle Model -- Tighter proofs of CCA security in the quantum random oracle model -- Attribute Based Encryption for Deterministic Finite Automata from DLIN -- CPA-to-CCA Transformation for KDM Security -- New Approaches to Traitor Tracing with Embedded Identities -- A Unified and Composable Take on Ratcheting -- Continuously Non-Malleable Secret Sharing for General Access Structures -- Interactive Non-Malleable Codes -- Stronger Lower Bounds for Online ORAM -- Adaptively Secure Garbling Schemes for Parallel Computations -- Statistical Difference Beyond the Polarizing Regime -- Estimating Gaps in Martingales and Applications to Coin-Tossing: Constructions & Hardness -- Fully Homomorphic NIZK and NIWI Proofs -- Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND -- Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles -- Compressible FHE with Applications to PIR -- Permuted Puzzles and Cryptographic Hardness -- Linear-Size Constant-Query IOPs for Delegating Computation -- On the (In)security of Kilian-Based SNARGs -- Incrementally Verifiable Computation via Incremental PCPs.
520 $a The two-volume set LNCS 11891 and 11892 constitutes the proceedings of the 17th International Conference on Theory of Cryptography, TCC 2019, held in Nuremberg, Germany, in December 2019. The 43 full papers presented were carefully reviewed and selected from 147 submissions. The Theory of Cryptography Conference deals with the paradigms, approaches, and techniques used to conceptualize natural cryptographic problems and provide algorithmic solutions to them and much more.
650 0 $a Data encryption (Computer science). $3 1051084
650 0 $a Computer communication systems. $3 1115394
650 0 $a Application software. $3 528147
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Computer security. $3 557122
650 0 $a Computers. $3 565115
650 1 4 $a Cryptology. $3 1211076
650 2 4 $a Computer Communication Networks. $3 669310
650 2 4 $a Information Systems Applications (incl. Internet). $3 881699
650 2 4 $a Data Structures and Information Theory. $3 1211601
650 2 4 $a Systems and Data Security. $3 677062
650 2 4 $a Computing Milieux. $3 669921
700 1 $a Hofheinz, Dennis. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1298466
700 1 $a Rosen, Alon. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1298467
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030360320
776 0 8 $i Printed edition: $z 9783030360344
830 0 $a Security and Cryptology ; $v 9241 $3 1254069
856 4 0 $u https://doi.org/10.1007/978-3-030-36033-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)