Asymptotically quasi-optimal cryptography (Q2170004)

From MaRDI portal

Revision as of 00:01, 30 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Asymptotically quasi-optimal cryptography	scientific article

Statements

scholarly article

0 references

Asymptotically quasi-optimal cryptography (English)

0 references

0 references

0 references

0 references

Vinod Vaikuntanathan

0 references

Muthu Venkitasubramaniam

0 references

publication date

30 August 2022

0 references

describes a project that uses

0 references

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-031-06944-4_11

0 references

0 references

On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\)

0 references

0 references

Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE

0 references

Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits

0 references

Scalable zero knowledge with no trusted setup

0 references

Linear-time zero-knowledge proofs for arithmetic circuit satisfiability

0 references

Efficient pseudorandom correlation generators from ring-LPN

0 references

On the concrete efficiency of probabilistically-checkable proofs

0 references

Succinct Non-interactive Arguments via Linear Interactive Proofs

0 references

Aurora: transparent succinct arguments for R1CS

0 references

Interactive Oracle Proofs

0 references

Two-message statistically sender-private OT from LWE

0 references

Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles

0 references

Semi-homomorphic Encryption and Multiparty Computation

0 references

Efficient protocols for oblivious linear function evaluation from ring-LWE

0 references

Two-message witness indistinguishability and secure computation in the plain model from new assumptions

0 references

Secure computation using leaky correlations (asymptotically optimal constructions)

0 references

(Leveled) fully homomorphic encryption without bootstrapping

0 references

On linear-size pseudorandom generators and hardcore functions

0 references

Exploring crypto dark matter: new simple PRF candidates and their applications

0 references

Quasi-optimal SNARGs via linear multi-prover interactive proofs

0 references

Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings

0 references

A non-PCP approach to succinct quantum-safe zero-knowledge

0 references

Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs

0 references

Secure computation with constant communication overhead using multiplication embeddings

0 references

FHE Circuit Privacy Almost for Free

0 references

Short PCPs with Polylog Query Complexity

0 references

Efficient Fully Homomorphic Encryption from (Standard) LWE

0 references

Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages

0 references

Amortized complexity of information-theoretically secure MPC revisited

0 references

Reusable non-interactive secure computation

0 references

Subquadratic SNARGs in the random oracle model

0 references

0 references

Trapdoor hash functions and their applications

0 references

Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography

0 references

Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data

0 references

0 references

Sanitization of FHE Ciphertexts

0 references

A public key cryptosystem and a signature scheme based on discrete logarithms

0 references

Fully homomorphic encryption using ideal lattices

0 references

Quadratic Span Programs and Succinct NIZKs without PCPs

0 references

Compressible FHE with applications to PIR

0 references

A generic approach to constructing and proving verifiable random functions

0 references

Fully Homomorphic Encryption with Polylog Overhead

0 references

i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits

0 references

Circuits resilient to additive attacks with applications to secure computation

0 references

Candidate One-Way Functions Based on Expander Graphs

0 references

Foundations of Cryptography

0 references

Short Pairing-Based Non-interactive Zero-Knowledge Arguments

0 references

Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose

0 references

Lapin: An Efficient Authentication Protocol Based on Ring-LPN

0 references

Constant-Rate Oblivious Transfer from Noisy Channels

0 references

0 references

0 references

Extracting Correlations

0 references

Zero-Knowledge Proofs from Secure Multiparty Computation

0 references

Founding Cryptography on Oblivious Transfer – Efficiently

0 references

Probabilistically Checkable Proofs of Proximity with Zero-Knowledge

0 references

Fast cut-and-choose-based protocols for malicious and covert adversaries

0 references

Generalized Compact Knapsacks Are Collision Resistant

0 references

On Ideal Lattices and Learning with Errors over Rings

0 references

A Toolkit for Ring-LWE Cryptography

0 references

Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries

0 references

Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs

0 references

Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

0 references

Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers

0 references

Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs

0 references

0 references

Theory of Cryptography

0 references

A Framework for Efficient and Composable Oblivious Transfer

0 references

Optimization, approximation, and complexity classes

0 references

On lattices, learning with errors, random linear codes, and cryptography

0 references

Oblivious Transfer Is Symmetric

0 references

Libra: succinct zero-knowledge proofs with optimal prover computation

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-031-06944-4_11

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2170004

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2170004&oldid=36848540"