A decade of lattice cryptography
C Peikert - Foundations and trends® in theoretical computer …, 2016 - nowpublishers.com
Lattice-based cryptography is the use of conjectured hard problems on point lattices in Rn
as the foundation for secure cryptographic systems. Attractive features of lattice cryptography …
as the foundation for secure cryptographic systems. Attractive features of lattice cryptography …
Computational complexity: a conceptual perspective
This book is rooted in the thesis that complexity theory is extremely rich in conceptual
content, and that this contents should be explicitly communicated in expositions and courses …
content, and that this contents should be explicitly communicated in expositions and courses …
Undetectable watermarks for language models
Recent advances in the capabilities of large language models such as GPT-4 have spurred
increasing concern about our ability to detect AI-generated text. Prior works have suggested …
increasing concern about our ability to detect AI-generated text. Prior works have suggested …
Does learning require memorization? a short tale about a long tail
State-of-the-art results on image recognition tasks are achieved using over-parameterized
learning algorithms that (nearly) perfectly fit the training set and are known to fit well even …
learning algorithms that (nearly) perfectly fit the training set and are known to fit well even …
Multicalibration: Calibration for the (computationally-identifiable) masses
We develop and study multicalibration as a new measure of fairness in machine learning
that aims to mitigate inadvertent or malicious discrimination that is introduced at training time …
that aims to mitigate inadvertent or malicious discrimination that is introduced at training time …
Forward and backward private searchable encryption from constrained cryptographic primitives
Using dynamic Searchable Symmetric Encryption, a user with limited storage resources can
securely outsource a database to an untrusted server, in such a way that the database can …
securely outsource a database to an untrusted server, in such a way that the database can …
Learning quantum states and unitaries of bounded gate complexity
While quantum state tomography is notoriously hard, most states hold little interest to
practically minded tomographers. Given that states and unitaries appearing in nature are of …
practically minded tomographers. Given that states and unitaries appearing in nature are of …
Wolverine: fast, scalable, and communication-efficient zero-knowledge proofs for boolean and arithmetic circuits
Efficient zero-knowledge (ZK) proofs for arbitrary boolean or arithmetic circuits have recently
attracted much attention. Existing solutions suffer from either significant prover overhead (ie …
attracted much attention. Existing solutions suffer from either significant prover overhead (ie …
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 …
voter rolls are purged; financial aid decisions are made; taxpayers are chosen for audits; air …
Privacy-preserving and efficient data sharing for blockchain-based intelligent transportation systems
Recent years have witnessed the development and adoption of blockchain technology in
intelligent transportation systems (ITS) because of its authenticity and traceability. However …
intelligent transportation systems (ITS) because of its authenticity and traceability. However …