Advances in Cryptology – CRYPTO 2018: 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19–23, 2018, Proceedings, Part II

前表紙
Hovav Shacham, Alexandra Boldyreva
Springer, 2018/08/11 - 833 ページ

The three volume-set, LNCS 10991, LNCS 10992, and LNCS 10993, constitutes the refereed proceedings of the 38th Annual International Cryptology Conference, CRYPTO 2018, held in Santa Barbara, CA, USA, in August 2018.
The 79 revised full papers presented were carefully reviewed and selected from 351 submissions. The papers are organized in the following topical sections: secure messaging; implementations and physical attacks prevention; authenticated and format-preserving encryption; cryptoanalysis; searchable encryption and differential privacy; secret sharing; encryption; symmetric cryptography; proofs of work and proofs of stake; proof tools; key exchange; symmetric cryptoanalysis; hashes and random oracles; trapdoor functions; round optimal MPC; foundations; lattices; lattice-based ZK; efficient MPC; quantum cryptography; MPC; garbling; information-theoretic MPC; oblivious transfer; non-malleable codes; zero knowledge; and obfuscation.

 

レビュー - レビューを書く

レビューが見つかりませんでした。

目次

Simplifying GameBased Definitions
3
The Algebraic Group Model and its Applications
33
Key Exchange
63
On Tightly Secure NonInteractive Key Exchange
64
Practical and TightlySecure Digital Signatures and Authenticated Key Exchange
95
Symmetric Cryptoanalysis
126
Fast Correlation Attack Revisited
127
A KeyRecovery Attack on 855round Trivium
160
On the Exact Round Complexity of Secure ThreeParty Computation
425
Promise Zero Knowledge and Its Applications to Round Optimal MPC
459
RoundOptimal Secure MultiParty Computation
488
Foundations
521
Yes There is an Oblivious RAM Lower Bound
522
Constrained PRFs for NC1 in Traditional Groups
543
Lattices
575
Proofs Attacks and Candidates
577

Improved Key Recovery Attacks on ReducedRound AES with Practical Data and Memory Complexities
185
Bernstein Bound on WCS is Tight
213
Hashes and Random Oracles
239
Correcting Subverted Random Oracles
241
Combiners for Backdoored Random Oracles
272
On Distributional Collision Resistant Hashing
303
Trapdoor Functions
328
Fast Distributed RSA Key Generation for Semihonest and Malicious Adversaries
331
Trapdoor Functions from the Computational DiffieHellman Assumption
362
Round Optimal MPC
392
RoundOptimal Secure Multiparty Computation with Honest Majority
395
Lower Bounds on Lattice Enumeration with Extreme Pruning
608
DissectionBKW
638
LatticeBased ZK
667
Sublinear LatticeBased ZeroKnowledge Arguments for Arithmetic Circuits
668
LatticeBased ZeroKnowledge Arguments for Integer Relations
700
MultiTheorem Preprocessing NIZKs from Lattices
733
Efficient MPC
766
Efficient MPC mod 2k for Dishonest Majority
767
Efficient MPC Over Arbitrary Rings
799
Author Index
830
著作権

他の版 - すべて表示

多く使われている語句

書誌情報