Language:
English
繁體中文
Help
圖資館首頁
Login
Back
Switch To:
Labeled
|
MARC Mode
|
ISBD
Theory of cryptography17th Internati...
~
(1998 :)
Theory of cryptography17th International Conference, TCC 2019, Nuremberg, Germany, December 1-5, 2019 : proceedings.Part II /
Record Type:
Electronic resources : Monograph/item
Title/Author:
Theory of cryptographyedited by Dennis Hofheinz, Alon Rosen.
Reminder of title:
17th International Conference, TCC 2019, Nuremberg, Germany, December 1-5, 2019 : proceedings.
remainder title:
TCC 2019
other author:
Hofheinz, Dennis.
corporate name:
Published:
Cham :Springer International Publishing :2019.
Description:
xiv, 578 p. :ill., digital ;24 cm.
Contained By:
Springer eBooks
Subject:
Data encryption (Computer science)
Online resource:
https://doi.org/10.1007/978-3-030-36033-7
ISBN:
9783030360337$q(electronic bk.)
Theory of cryptography17th International Conference, TCC 2019, Nuremberg, Germany, December 1-5, 2019 : proceedings.Part II /
Theory of cryptography
17th International Conference, TCC 2019, Nuremberg, Germany, December 1-5, 2019 : proceedings.Part II /[electronic resource] :TCC 2019edited by Dennis Hofheinz, Alon Rosen. - Cham :Springer International Publishing :2019. - xiv, 578 p. :ill., digital ;24 cm. - Lecture notes in computer science,118920302-9743 ;. - Lecture notes in computer science ;4891..
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$q(electronic bk.)
Standard No.: 10.1007/978-3-030-36033-7doiSubjects--Topical Terms:
184520
Data encryption (Computer science)
LC Class. No.: QA76.9.A25 / T44 2019
Dewey Class. No.: 005.824
Theory of cryptography17th International Conference, TCC 2019, Nuremberg, Germany, December 1-5, 2019 : proceedings.Part II /
LDR
:02964nmm a2200373 a 4500
001
569391
003
DE-He213
005
20191122212459.0
006
m d
007
cr nn 008maaau
008
200723s2019 gw s 0 eng d
020
$a
9783030360337$q(electronic bk.)
020
$a
9783030360320$q(paper)
024
7
$a
10.1007/978-3-030-36033-7
$2
doi
035
$a
978-3-030-36033-7
040
$a
GP
$c
GP
041
0
$a
eng
050
4
$a
QA76.9.A25
$b
T44 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.824
$2
23
090
$a
QA76.9.A25
$b
T396 2019
111
2
$n
(3rd :
$d
1998 :
$c
Amsterdam, Netherlands)
$3
194767
245
1 0
$a
Theory of cryptography
$h
[electronic resource] :
$b
17th International Conference, TCC 2019, Nuremberg, Germany, December 1-5, 2019 : proceedings.
$n
Part II /
$c
edited by Dennis Hofheinz, Alon Rosen.
246
3
$a
TCC 2019
260
$a
Cham :
$b
Springer International Publishing :
$b
Imprint: Springer,
$c
2019.
300
$a
xiv, 578 p. :
$b
ill., digital ;
$c
24 cm.
490
1
$a
Lecture notes in computer science,
$x
0302-9743 ;
$v
11892
490
1
$a
Security and cryptology
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
184520
650
1 4
$a
Cryptology.
$3
825728
650
2 4
$a
Computer Communication Networks.
$3
218087
650
2 4
$a
Information Systems Applications (incl. Internet)
$3
530743
650
2 4
$a
Data Structures and Information Theory.
$3
825714
650
2 4
$a
Systems and Data Security.
$3
274481
650
2 4
$a
Computing Milieux.
$3
275270
700
1
$a
Hofheinz, Dennis.
$3
855352
700
1
$a
Rosen, Alon.
$3
278442
710
2
$a
SpringerLink (Online service)
$3
273601
773
0
$t
Springer eBooks
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-36033-7
950
$a
Computer Science (Springer-11645)
based on 0 review(s)
ALL
電子館藏
Items
1 records • Pages 1 •
1
Inventory Number
Location Name
Item Class
Material type
Call number
Usage Class
Loan Status
No. of reservations
Opac note
Attachments
000000177452
電子館藏
1圖書
電子書
EB QA76.9.A25 T396 2019 2019
一般使用(Normal)
On shelf
0
1 records • Pages 1 •
1
Multimedia
Multimedia file
https://doi.org/10.1007/978-3-030-36033-7
Reviews
Add a review
and share your thoughts with other readers
Export
pickup library
Processing
...
Change password
Login