Privacy-preserving solutions for blockchain: Review and challenges

JB Bernabe, JL Canovas, JL Hernandez-Ramos… - Ieee …, 2019 - ieeexplore.ieee.org
Blockchains offer a decentralized, immutable and verifiable ledger that can record
transactions of digital assets, provoking a radical change in several innovative scenarios …

A Survey of Self‐Sovereign Identity Ecosystem

R Soltani, UT Nguyen, A An - Security and Communication …, 2021 - Wiley Online Library
Self‐sovereign identity is the next evolution of identity management models. This survey
takes a journey through the origin of identity, defining digital identity and progressive …

[BOOK][B] Handbook of applied cryptography

AJ Menezes, PC Van Oorschot, SA Vanstone - 2018 - taylorfrancis.com
Cryptography, in particular public-key cryptography, has emerged in the last 20 years as an
important discipline that is not only the subject of an enormous amount of research, but …

Random oracles are practical: A paradigm for designing efficient protocols

M Bellare, P Rogaway - Proceedings of the 1st ACM Conference on …, 1993 - dl.acm.org
We argue that the random oracle model—where all parties have access to a public random
oracle—provides a bridge between cryptographic theory and cryptographic practice. In the …

[BOOK][B] Foundations of cryptography: volume 2, basic applications

O Goldreich - 2001 - books.google.com
Cryptography is concerned with the conceptualization, definition, and construction of
computing systems that address security concerns. The design of cryptographic systems …

Turning your weakness into a strength: Watermarking deep neural networks by backdooring

Y Adi, C Baum, M Cisse, B Pinkas… - 27th USENIX security …, 2018 - usenix.org
Deep Neural Networks have recently gained lots of success after enabling several
breakthroughs in notoriously challenging problems. Training these networks is …

[BOOK][B] Computational complexity: a modern approach

S Arora, B Barak - 2009 - books.google.com
This beginning graduate textbook describes both recent achievements and classical results
of computational complexity theory. Requiring essentially no background apart from …

Non-interactive and information-theoretic secure verifiable secret sharing

TP Pedersen - Annual international cryptology conference, 1991 - Springer
It is shown how to distribute a secret to n persons such that each person can verify that he
has received correct information about the secret without talking with other persons. Any k of …

Accountable algorithms

JA Kroll - 2015 - search.proquest.com
Important decisions about people are increasingly made by algorithms: Votes are counted;
voter rolls are purged; financial aid decisions are made; taxpayers are chosen for audits; air …

Universally composable security: A new paradigm for cryptographic protocols

R Canetti - Proceedings 42nd IEEE Symposium on Foundations …, 2001 - ieeexplore.ieee.org
We propose a novel paradigm for defining security of cryptographic protocols, called
universally composable security. The salient property of universally composable definitions …