Titlebook: Security and Cryptography for Networks; 12th International C Clemente Galdi,Vladimir Kolesnikov Conference proceedings 2020 Springer Nature

Decimate

Conference proceedings 2020 in September 2020*..The 33 papers presented in this volume were carefully reviewed and selected from 87 submissions. They are organized in topical sections on blockchain; multiparty computation; oblivious RAM; primitives and constructions; signatures, encryption, and algebraic constructions; symmet

Pageant

Aggregatable Subvector Commitments for Stateless Cryptocurrenciesrency with very low communication and computation overheads. Specifically, our constant-sized, aggregatable proofs reduce each block’s proof overhead to a single group element, which is optimal. Furthermore, our subvector proofs speed up block verification and our smaller public parameters further reduce block size.

積習難改

Efficient 3-Party Distributed ORAMerest, we construct a 3-server distributed point function (DPF) with security against . colluding servers that is arguably simpler and has better concrete efficiency than prior work. We also show how to distribute the key-generation protocol of this DPF (in a black-box manner).

制定

分開如此和諧

0302-9743 fi, Italy, in September 2020*..The 33 papers presented in this volume were carefully reviewed and selected from 87 submissions. They are organized in topical sections on blockchain; multiparty computation; oblivious RAM; primitives and constructions; signatures, encryption, and algebraic constructio

BOLT

Account Management in Proof of Stake Ledgers the PoS consensus mechanism, the system’s security is at risk, so it is imperative to explore ways to both maximize the level of participation and minimize the effects of non-participation. One such option is stake representation, such that users can delegate their participation rights and, in the

FATAL

generic

Aggregatable Subvector Commitments for Stateless Cryptocurrenciesuction from constant-sized polynomial commitments. Our construction is unique in that it has linear-sized public parameters, it can compute all constant-sized proofs in quasilinear time, it updates proofs in constant time and it can aggregate multiple proofs into a constant-sized subvector proof. Fu

cleaver

Tight Verifiable Delay Functionsfficiently, in time essentially independent of .. In this work we study . VDFs, where the function can be evaluated in time not much more than the sequentiality bound ...On the negative side, we show the impossibility of a black-box construction from random oracles of a VDF that can be evaluated in

Endemic