Vector Commitments over Rings and Compressed Σ -Protocols

Compressed Sigma -Protocol Theory (CRYPTO 2020) presents an “alternative” to Bulletproofs that achieves the same communication complexity while adhering more elegantly to existing Sigma -protocol theory, which enables their techniques to be directly applicable to other widely used settings in the context of “plug & play” algorithmics....

Brief Announcement: Malicious Security Comes for Free in Consensus with Leaders

We consider consensus protocols in the model that is most commonly considered for use in state machine replication, as initiated by Dwork-Lynch-Stockmeyer, then by Castro-Liskov in 1999 with “PBFT”. Such protocols guarantee, assuming n players out of which t < n/3 are maliciously corrupted, that the honest players output the same valid value...

Efficient Protocols for Perfectly Secure Message Transmission with Applications to Secure Network Coding

Secure comparison protocols in the semi-honest model

Due to high complexity, comparison protocols with secret inputs have been a bottleneck in the design of privacy-preserving cryptographic protocols. Different solutions based on homomorphic encryption, garbled circuits and secret sharing techniques have been proposed over the last few years, each claiming high efficiency. Unfortunately, a fair...

Linear round bit-decomposition of secret-shared values

In the field of signal processing in the encrypted domain, linear operations are usually easy to perform, whereas multiplications, and bitwise operations like comparison, are more costly in terms of computation and communication. These bitwise operations frequently require a decomposition of the secret value into bits. To minimize the...