Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597): Difference between revisions

Latest revision as of 19:41, 26 July 2024

scientific article

Language	Label	Description	Also known as
English	Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification	scientific article

Statements

instance of

scholarly article

0 references

title

Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (English)

0 references

DOI

10.1016/j.tcs.2021.07.022

0 references

0 references

0 references

0 references

Theoretical Computer Science

0 references

publication date

6 October 2021

0 references

full work available at URL

https://arxiv.org/abs/2011.14804

0 references

Mathematics Subject Classification ID

0 references

0 references

learning with errors

0 references

secret sharing

0 references

hidden access structures

0 references

PRIM-LWE

0 references

extremal set theory

0 references

describes a project that uses

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

OpenAlex ID

W3108103136

0 references

cites work

How to share a secret

0 references

Q5581642

0 references

Rational secret sharing and multiparty computation

0 references

Security of Ramp Schemes

0 references

How to Share a Secret, Infinitely

0 references

Q4343446

0 references

Q3792623

0 references

Evolving ramp secret sharing with a small gap

0 references

Security in Locally Repairable Storage

0 references

On the local leakage resilience of linear secret sharing schemes

0 references

Non-malleable secret sharing

0 references

Quantum secret sharing

0 references

Verifiable threshold quantum secret sharing with sequential communication

0 references

A verifiable framework of entanglement-free quantum secret sharing with information-theoretical security

0 references

Implementation of quantum secret sharing and quantum binary voting protocol in the IBM quantum computer

0 references

Efficient quantum secret sharing without a trusted player

0 references

Q4035739

0 references

How to share a function securely

0 references

Q4249323

0 references

Q3374918

0 references

Secure Multiparty Computation and Secret Sharing

0 references

Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)

0 references

Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields

0 references

Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization

0 references

Key-Policy Attribute-Based Encryption for General Boolean Circuits from Secret Sharing and Multi-linear Maps

0 references

Generalized oblivious transfer by secret sharing

0 references

Alternative Protocols for Generalized Oblivious Transfer

0 references

Perfectly secure message transmission

0 references

Secure message transmission in asynchronous networks

0 references

Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures

0 references

General Perfectly Secure Message Transmission Using Linear Codes

0 references

Cutting-edge cryptography through the lens of secret sharing

0 references

Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases

0 references

Advances in Cryptology - CRYPTO 2003

0 references

How to Compute under $${\mathcal {\varvec{AC}}}^\mathbf{0}$$ Leakage without Secure Hardware

0 references

Q4941853

0 references

Financial Cryptography

0 references

General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting

0 references

Secure Multiparty Computation Goes Live

0 references

Access structure hiding secret sharing from novel set systems and vector families

0 references

Lattice-Based Threshold Changeability for Standard Shamir Secret-Sharing Schemes

0 references

An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience

0 references

Fast asynchronous Byzantine agreement with optimal resilience

0 references

On Expected Constant-Round Protocols for Byzantine Agreement

0 references

Asynchronous Byzantine agreement with optimal resilience

0 references

How to share a secret with cheaters

0 references

Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

0 references

Q4035712

0 references

Simplified VSS and fast-track multiparty computations with applications to threshold cryptography

0 references

Constant-Size Commitments to Polynomials and Their Applications

0 references

Asynchronous Computational VSS with Reduced Communication Complexity

0 references

Publicly Verifiable Secret Sharing

0 references

The Byzantine Generals Problem

0 references

Providing anonymity in unconditionally secure secret sharing schemes

0 references

Strongly ideal secret sharing schemes

0 references

Anonymous secret sharing schemes

0 references

On the bound for anonymous secret sharing schemes

0 references

Constructions for anonymous secret sharing schemes using combinatorial designs

0 references

Steiner Triple Systems without Parallel Classes

0 references

Some new 2-resolvable Steiner quadruple systems

0 references

Transitive Steiner and Kirkman Triple Systems of Order 27

0 references

Almost all Steiner triple systems have perfect matchings

0 references

Asymptotic behavior of the chromatic index for hypergraphs

0 references

Q5661892

0 references

Almost all Steiner triple systems are almost resolvable

0 references

Proper S(t, K,v)'s for t ≥ 3,v ≤ 16, |K| > 1 and Their Extensions

0 references

Extending AG(4, 2) to S(4, {5, 6}, 17)

0 references

Q4529517

0 references

There exists no Steiner system $S(4,5,17)$

0 references

Q4256358

0 references

Q4474199

0 references

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

0 references

Q4343413

0 references

Almost Optimum t-Cheater Identifiable Secret Sharing Schemes

0 references

Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution

0 references

Identifying Cheaters without an Honest Majority

0 references

Q4204100

0 references

Breaking the circuit-size barrier in secret sharing

0 references

Towards breaking the exponential barrier for general secret sharing

0 references

Better secret sharing via robust conditional disclosure of secrets

0 references

Secret-sharing schemes for general and uniform access structures

0 references

On the size of shares for secret sharing schemes

0 references

Q4370857

0 references

The size of a share must be large

0 references

On the information rate of perfect secret sharing schemes

0 references

Secret-Sharing Schemes: A Survey

0 references

Q4341739

0 references

Secret-Sharing for NP

0 references

Probabilistic encryption

0 references

How to Generate Cryptographically Strong Sequences of Pseudorandom Bits

0 references

A Pseudorandom Generator from any One-way Function

0 references

Pseudorandom bits for constant depth circuits

0 references

Hardness vs randomness

0 references

Pseudorandom generators for space-bounded computation

0 references

Pseudorandomness for network algorithms

0 references

INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

0 references

Invitation to intersection problems for finite sets

0 references

Extremal problems in hypergraph colourings

0 references

Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs

0 references

Matching Vector Codes

0 references

On the Cryptographic Complexity of the Worst Functions

0 references

2-Server PIR with Sub-Polynomial Communication

0 references

3-query locally decodable codes of subexponential length

0 references

Towards 3-query locally decodable codes of subexponential length

0 references

Conditional disclosure of secrets via non-linear reconstruction

0 references

0 references

0 references

0 references

0 references

On Ideal Lattices and Learning with Errors over Rings

0 references

Worst-case to average-case reductions for module lattices

0 references

Middle-product Learning with Errors

0 references

Structural Lattice Reduction: Generalized Worst-Case to Average-Case Reductions and Homomorphic Cryptosystems

0 references

Obfuscating Conjunctions under Entropic Ring LWE

0 references

Efficient Public Key Encryption Based on Ideal Lattices

0 references

Towards attribute-based encryption for RAMs from LWE: sub-linear decryption, and more

0 references

FE for inner products and its application to decentralized ABE

0 references

Trapdoors for hard lattices and new cryptographic constructions

0 references

Simultaneous Hardcore Bits and Cryptography against Memory Attacks

0 references

Functional Encryption for Inner Product Predicates from Learning with Errors

0 references

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

0 references

Reusable garbled circuits and succinct functional encryption

0 references

Saber: module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM

0 references

Round5: compact and fast post-quantum public-key encryption

0 references

(Leveled) Fully Homomorphic Encryption without Bootstrapping

0 references

Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme

0 references

On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption

0 references

A Framework for Efficient and Composable Oblivious Transfer

0 references

Two-message statistically sender-private OT from LWE

0 references

UC-secure OT from LWE, revisited

0 references

Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures

0 references

Lattice-Based Blind Signatures

0 references

Lattice Signatures without Trapdoors

0 references

The lattice-based digital signature scheme qTESLA

0 references

Pseudorandom Functions and Lattices

0 references

Key Homomorphic PRFs and Their Applications

0 references

New and Improved Key-Homomorphic Pseudorandom Functions

0 references

Key-Homomorphic Constrained Pseudorandom Functions

0 references

Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions

0 references

Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption

0 references

Private Puncturable PRFs from Standard Lattice Assumptions

0 references

Private constrained PRFs (and more) from LWE

0 references

Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE

0 references

Watermarking cryptographic functionalities from standard lattice assumptions

0 references

Watermarking PRFs from lattices: stronger security via extractable PRFs

0 references

Watermarking PRFs under standard assumptions: public marking and security with extraction queries

0 references

Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices

0 references

Theory of Cryptography

0 references

Efficient Secure Matrix Multiplication Over LWE-Based Homomorphic Encryption

0 references

A new secure matrix multiplication from ring-LWE

0 references

Noninteractive zero knowledge for NP from (Plain) Learning With Errors

0 references

Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes

0 references

Graph-Induced Multilinear Maps from Lattices

0 references

Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification

0 references

Candidate Multilinear Maps from Ideal Lattices

0 references

Identity-Based (Lossy) Trapdoor Functions and Applications

0 references

Lossy trapdoor functions and their applications

0 references

Dual Projective Hashing and Its Applications — Lossy Trapdoor Functions and More

0 references

A Decade of Lattice Cryptography

0 references

Public-key cryptosystems from the worst-case shortest vector problem

0 references

Classical hardness of learning with errors

0 references

Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems

0 references

Hardness of SIS and LWE with Small Parameters

0 references

A sieve algorithm for the shortest lattice vector problem

0 references

Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis

0 references

Rankin’s Constant and Blockwise Lattice Reduction

0 references

Q3549702

0 references

Lattice Enumeration Using Extreme Pruning

0 references

Factoring polynomials with rational coefficients

0 references

The LLL algorithm. Survey and applications

0 references

Sieve algorithms for the shortest vector problem are practical

0 references

Q5417723

0 references

A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations

0 references

On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications

0 references

A hierarchy of polynomial time lattice basis reduction algorithms

0 references

Lattice basis reduction: Improved practical algorithms and solving subset sum problems

0 references

Q2757225

0 references

An LLL Algorithm with Quadratic Complexity

0 references

Q4938616

0 references

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

0 references

Approximate trapdoors for lattices and smaller hash-and-sign signatures

0 references

All-but-many lossy trapdoor functions from lattices and applications

0 references

All-But-Many Lossy Trapdoor Functions

0 references

Simple Lattice Trapdoor Sampling from a Broad Class of Distributions

0 references

On secret sharing systems

0 references

On Linear Secret Sharing for Connectivity in Directed Graphs

0 references

Reachability is harder for directed than for undirected finite graphs

0 references

Representing Boolean functions as polynomials modulo composite numbers

0 references

On the Lambert $w$ function

0 references

Q3684278

0 references

Q3231324

0 references

Proofs that ∑1/p Diverges

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2232597

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3108103136
@@ Property / OpenAlex ID: W3108103136 / rank @@
+Normal rank
@@ Property / cites work @@
+How to share a secret
@@ Property / cites work: How to share a secret / rank @@
+Normal rank
@@ Property / cites work @@
+Q5581642
@@ Property / cites work: Q5581642 / rank @@
+Normal rank
@@ Property / cites work @@
+Rational secret sharing and multiparty computation
+Normal rank
@@ Property / cites work @@
+Security of Ramp Schemes
@@ Property / cites work: Security of Ramp Schemes / rank @@
+Normal rank
@@ Property / cites work @@
+How to Share a Secret, Infinitely
@@ Property / cites work: How to Share a Secret, Infinitely / rank @@
+Normal rank
@@ Property / cites work @@
+Q4343446
@@ Property / cites work: Q4343446 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3792623
@@ Property / cites work: Q3792623 / rank @@
+Normal rank
@@ Property / cites work @@
+Evolving ramp secret sharing with a small gap
@@ Property / cites work: Evolving ramp secret sharing with a small gap / rank @@
+Normal rank
@@ Property / cites work @@
+Security in Locally Repairable Storage
@@ Property / cites work: Security in Locally Repairable Storage / rank @@
+Normal rank
@@ Property / cites work @@
+On the local leakage resilience of linear secret sharing schemes
+Normal rank
@@ Property / cites work @@
+Non-malleable secret sharing
@@ Property / cites work: Non-malleable secret sharing / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum secret sharing
@@ Property / cites work: Quantum secret sharing / rank @@
+Normal rank
@@ Property / cites work @@
+Verifiable threshold quantum secret sharing with sequential communication
+Normal rank
@@ Property / cites work @@
+A verifiable framework of entanglement-free quantum secret sharing with information-theoretical security
+Normal rank
@@ Property / cites work @@
+Implementation of quantum secret sharing and quantum binary voting protocol in the IBM quantum computer
+Normal rank
@@ Property / cites work @@
+Efficient quantum secret sharing without a trusted player
+Normal rank
@@ Property / cites work @@
+Q4035739
@@ Property / cites work: Q4035739 / rank @@
+Normal rank
@@ Property / cites work @@
+How to share a function securely
@@ Property / cites work: How to share a function securely / rank @@
+Normal rank
@@ Property / cites work @@
+Q4249323
@@ Property / cites work: Q4249323 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3374918
@@ Property / cites work: Q3374918 / rank @@
+Normal rank
@@ Property / cites work @@
+Secure Multiparty Computation and Secret Sharing
@@ Property / cites work: Secure Multiparty Computation and Secret Sharing / rank @@
+Normal rank
@@ Property / cites work @@
+Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
+Normal rank
@@ Property / cites work @@
+Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
+Normal rank
@@ Property / cites work @@
+Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization
+Normal rank
@@ Property / cites work @@
+Key-Policy Attribute-Based Encryption for General Boolean Circuits from Secret Sharing and Multi-linear Maps
+Normal rank
@@ Property / cites work @@
+Generalized oblivious transfer by secret sharing
@@ Property / cites work: Generalized oblivious transfer by secret sharing / rank @@
+Normal rank
@@ Property / cites work @@
+Alternative Protocols for Generalized Oblivious Transfer
+Normal rank
@@ Property / cites work @@
+Perfectly secure message transmission
@@ Property / cites work: Perfectly secure message transmission / rank @@
+Normal rank
@@ Property / cites work @@
+Secure message transmission in asynchronous networks
+Normal rank
@@ Property / cites work @@
+Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures
+Normal rank
@@ Property / cites work @@
+General Perfectly Secure Message Transmission Using Linear Codes
+Normal rank
@@ Property / cites work @@
+Cutting-edge cryptography through the lens of secret sharing
+Normal rank
@@ Property / cites work @@
+Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
+Normal rank
@@ Property / cites work @@
+Advances in Cryptology - CRYPTO 2003
@@ Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+How to Compute under $${\mathcal {\varvec{AC}}}^\mathbf{0}$$ Leakage without Secure Hardware
+Normal rank
@@ Property / cites work @@
+Q4941853
@@ Property / cites work: Q4941853 / rank @@
+Normal rank
@@ Property / cites work @@
+Financial Cryptography
@@ Property / cites work: Financial Cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting
+Normal rank
@@ Property / cites work @@
+Secure Multiparty Computation Goes Live
@@ Property / cites work: Secure Multiparty Computation Goes Live / rank @@
+Normal rank
@@ Property / cites work @@
+Access structure hiding secret sharing from novel set systems and vector families
+Normal rank
@@ Property / cites work @@
+Lattice-Based Threshold Changeability for Standard Shamir Secret-Sharing Schemes
+Normal rank
@@ Property / cites work @@
+An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience
+Normal rank
@@ Property / cites work @@
+Fast asynchronous Byzantine agreement with optimal resilience
+Normal rank
@@ Property / cites work @@
+On Expected Constant-Round Protocols for Byzantine Agreement
+Normal rank
@@ Property / cites work @@
+Asynchronous Byzantine agreement with optimal resilience
+Normal rank
@@ Property / cites work @@
+How to share a secret with cheaters
@@ Property / cites work: How to share a secret with cheaters / rank @@
+Normal rank
@@ Property / cites work @@
+Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
+Normal rank
@@ Property / cites work @@
+Q4035712
@@ Property / cites work: Q4035712 / rank @@
+Normal rank
@@ Property / cites work @@
+Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
+Normal rank
@@ Property / cites work @@
+Constant-Size Commitments to Polynomials and Their Applications
+Normal rank
@@ Property / cites work @@
+Asynchronous Computational VSS with Reduced Communication Complexity
+Normal rank
@@ Property / cites work @@
+Publicly Verifiable Secret Sharing
@@ Property / cites work: Publicly Verifiable Secret Sharing / rank @@
+Normal rank
@@ Property / cites work @@
+The Byzantine Generals Problem
@@ Property / cites work: The Byzantine Generals Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Providing anonymity in unconditionally secure secret sharing schemes
+Normal rank
@@ Property / cites work @@
+Strongly ideal secret sharing schemes
@@ Property / cites work: Strongly ideal secret sharing schemes / rank @@
+Normal rank
@@ Property / cites work @@
+Anonymous secret sharing schemes
@@ Property / cites work: Anonymous secret sharing schemes / rank @@
+Normal rank
@@ Property / cites work @@
+On the bound for anonymous secret sharing schemes
@@ Property / cites work: On the bound for anonymous secret sharing schemes / rank @@
+Normal rank
@@ Property / cites work @@
+Constructions for anonymous secret sharing schemes using combinatorial designs
+Normal rank
@@ Property / cites work @@
+Steiner Triple Systems without Parallel Classes
@@ Property / cites work: Steiner Triple Systems without Parallel Classes / rank @@
+Normal rank
@@ Property / cites work @@
+Some new 2-resolvable Steiner quadruple systems
@@ Property / cites work: Some new 2-resolvable Steiner quadruple systems / rank @@
+Normal rank
@@ Property / cites work @@
+Transitive Steiner and Kirkman Triple Systems of Order 27
+Normal rank
@@ Property / cites work @@
+Almost all Steiner triple systems have perfect matchings
+Normal rank
@@ Property / cites work @@
+Asymptotic behavior of the chromatic index for hypergraphs
+Normal rank
@@ Property / cites work @@
+Q5661892
@@ Property / cites work: Q5661892 / rank @@
+Normal rank
@@ Property / cites work @@
+Almost all Steiner triple systems are almost resolvable
+Normal rank
@@ Property / cites work @@
+Proper S(t, K,v)'s for t ≥ 3,v ≤ 16, |K| &gt; 1 and Their Extensions
+Normal rank
@@ Property / cites work @@
+Extending AG(4, 2) to S(4, {5, 6}, 17)
@@ Property / cites work: Extending AG(4, 2) to S(4, {5, 6}, 17) / rank @@
+Normal rank
@@ Property / cites work @@
+Q4529517
@@ Property / cites work: Q4529517 / rank @@
+Normal rank
@@ Property / cites work @@
+There exists no Steiner system \(S(4,5,17)\)
@@ Property / cites work: There exists no Steiner system \(S(4,5,17)\) / rank @@
+Normal rank
@@ Property / cites work @@
+Q4256358
@@ Property / cites work: Q4256358 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4474199
@@ Property / cites work: Q4474199 / rank @@
+Normal rank
@@ Property / cites work @@
+On lattices, learning with errors, random linear codes, and cryptography
+Normal rank
@@ Property / cites work @@
+Q4343413
@@ Property / cites work: Q4343413 / rank @@
+Normal rank
@@ Property / cites work @@
+Almost Optimum t-Cheater Identifiable Secret Sharing Schemes
+Normal rank
@@ Property / cites work @@
+Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution
+Normal rank
@@ Property / cites work @@
+Identifying Cheaters without an Honest Majority
@@ Property / cites work: Identifying Cheaters without an Honest Majority / rank @@
+Normal rank
@@ Property / cites work @@
+Q4204100
@@ Property / cites work: Q4204100 / rank @@
+Normal rank
@@ Property / cites work @@
+Breaking the circuit-size barrier in secret sharing
+Normal rank
@@ Property / cites work @@
+Towards breaking the exponential barrier for general secret sharing
+Normal rank
@@ Property / cites work @@
+Better secret sharing via robust conditional disclosure of secrets
+Normal rank
@@ Property / cites work @@
+Secret-sharing schemes for general and uniform access structures
+Normal rank
@@ Property / cites work @@
+On the size of shares for secret sharing schemes
@@ Property / cites work: On the size of shares for secret sharing schemes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4370857
@@ Property / cites work: Q4370857 / rank @@
+Normal rank
@@ Property / cites work @@
+The size of a share must be large
@@ Property / cites work: The size of a share must be large / rank @@
+Normal rank
@@ Property / cites work @@
+On the information rate of perfect secret sharing schemes
+Normal rank
@@ Property / cites work @@
+Secret-Sharing Schemes: A Survey
@@ Property / cites work: Secret-Sharing Schemes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q4341739
@@ Property / cites work: Q4341739 / rank @@
+Normal rank
@@ Property / cites work @@
+Secret-Sharing for NP
@@ Property / cites work: Secret-Sharing for NP / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic encryption
@@ Property / cites work: Probabilistic encryption / rank @@
+Normal rank
@@ Property / cites work @@
+How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
+Normal rank
@@ Property / cites work @@
+A Pseudorandom Generator from any One-way Function
+Normal rank
@@ Property / cites work @@
+Pseudorandom bits for constant depth circuits
@@ Property / cites work: Pseudorandom bits for constant depth circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness vs randomness
@@ Property / cites work: Hardness vs randomness / rank @@
+Normal rank
@@ Property / cites work @@
+Pseudorandom generators for space-bounded computation
+Normal rank
@@ Property / cites work @@
+Pseudorandomness for network algorithms
@@ Property / cites work: Pseudorandomness for network algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
@@ Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank @@
+Normal rank
@@ Property / cites work @@
+Invitation to intersection problems for finite sets
+Normal rank
@@ Property / cites work @@
+Extremal problems in hypergraph colourings
@@ Property / cites work: Extremal problems in hypergraph colourings / rank @@
+Normal rank
@@ Property / cites work @@
+Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs
+Normal rank
@@ Property / cites work @@
+Matching Vector Codes
@@ Property / cites work: Matching Vector Codes / rank @@
+Normal rank
@@ Property / cites work @@
+On the Cryptographic Complexity of the Worst Functions
+Normal rank
@@ Property / cites work @@
+-Server PIR with Sub-Polynomial Communication
@@ Property / cites work: 2-Server PIR with Sub-Polynomial Communication / rank @@
+Normal rank
@@ Property / cites work @@
+-query locally decodable codes of subexponential length
+Normal rank
@@ Property / cites work @@
+Towards 3-query locally decodable codes of subexponential length
+Normal rank
@@ Property / cites work @@
+Conditional disclosure of secrets via non-linear reconstruction
+Normal rank
@@ Property / cites work @@
+Q4165427
@@ Property / cites work: Q4165427 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4526993
@@ Property / cites work: Q4526993 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228459
@@ Property / cites work: Q4228459 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4829810
@@ Property / cites work: Q4829810 / rank @@
+Normal rank
@@ Property / cites work @@
+On Ideal Lattices and Learning with Errors over Rings
+Normal rank
@@ Property / cites work @@
+Worst-case to average-case reductions for module lattices
+Normal rank
@@ Property / cites work @@
+Middle-product Learning with Errors
@@ Property / cites work: Middle-product Learning with Errors / rank @@
+Normal rank
@@ Property / cites work @@
+Structural Lattice Reduction: Generalized Worst-Case to Average-Case Reductions and Homomorphic Cryptosystems
+Normal rank
@@ Property / cites work @@
+Obfuscating Conjunctions under Entropic Ring LWE
@@ Property / cites work: Obfuscating Conjunctions under Entropic Ring LWE / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Public Key Encryption Based on Ideal Lattices
+Normal rank
@@ Property / cites work @@
+Towards attribute-based encryption for RAMs from LWE: sub-linear decryption, and more
+Normal rank
@@ Property / cites work @@
+FE for inner products and its application to decentralized ABE
+Normal rank
@@ Property / cites work @@
+Trapdoors for hard lattices and new cryptographic constructions
+Normal rank
@@ Property / cites work @@
+Simultaneous Hardcore Bits and Cryptography against Memory Attacks
+Normal rank
@@ Property / cites work @@
+Functional Encryption for Inner Product Predicates from Learning with Errors
+Normal rank
@@ Property / cites work @@
+Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
+Normal rank
@@ Property / cites work @@
+Reusable garbled circuits and succinct functional encryption
+Normal rank
@@ Property / cites work @@
+Saber: module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM
+Normal rank
@@ Property / cites work @@
+Round5: compact and fast post-quantum public-key encryption
+Normal rank
@@ Property / cites work @@
+(Leveled) Fully Homomorphic Encryption without Bootstrapping
+Normal rank
@@ Property / cites work @@
+Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
+Normal rank
@@ Property / cites work @@
+On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
+Normal rank
@@ Property / cites work @@
+A Framework for Efficient and Composable Oblivious Transfer
+Normal rank
@@ Property / cites work @@
+Two-message statistically sender-private OT from LWE
+Normal rank
@@ Property / cites work @@
+UC-secure OT from LWE, revisited
@@ Property / cites work: UC-secure OT from LWE, revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
+Normal rank
@@ Property / cites work @@
+Lattice-Based Blind Signatures
@@ Property / cites work: Lattice-Based Blind Signatures / rank @@
+Normal rank
@@ Property / cites work @@
+Lattice Signatures without Trapdoors
@@ Property / cites work: Lattice Signatures without Trapdoors / rank @@
+Normal rank
@@ Property / cites work @@
+The lattice-based digital signature scheme qTESLA
@@ Property / cites work: The lattice-based digital signature scheme qTESLA / rank @@
+Normal rank
@@ Property / cites work @@
+Pseudorandom Functions and Lattices
@@ Property / cites work: Pseudorandom Functions and Lattices / rank @@
+Normal rank
@@ Property / cites work @@
+Key Homomorphic PRFs and Their Applications
@@ Property / cites work: Key Homomorphic PRFs and Their Applications / rank @@
+Normal rank
@@ Property / cites work @@
+New and Improved Key-Homomorphic Pseudorandom Functions
+Normal rank
@@ Property / cites work @@
+Key-Homomorphic Constrained Pseudorandom Functions
+Normal rank
@@ Property / cites work @@
+Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
+Normal rank
@@ Property / cites work @@
+Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption
+Normal rank
@@ Property / cites work @@
+Private Puncturable PRFs from Standard Lattice Assumptions
+Normal rank
@@ Property / cites work @@
+Private constrained PRFs (and more) from LWE
@@ Property / cites work: Private constrained PRFs (and more) from LWE / rank @@
+Normal rank
@@ Property / cites work @@
+Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
+Normal rank
@@ Property / cites work @@
+Watermarking cryptographic functionalities from standard lattice assumptions
+Normal rank
@@ Property / cites work @@
+Watermarking PRFs from lattices: stronger security via extractable PRFs
+Normal rank
@@ Property / cites work @@
+Watermarking PRFs under standard assumptions: public marking and security with extraction queries
+Normal rank
@@ Property / cites work @@
+Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
+Normal rank
@@ Property / cites work @@
+Theory of Cryptography
@@ Property / cites work: Theory of Cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Secure Matrix Multiplication Over LWE-Based Homomorphic Encryption
+Normal rank
@@ Property / cites work @@
+A new secure matrix multiplication from ring-LWE
@@ Property / cites work: A new secure matrix multiplication from ring-LWE / rank @@
+Normal rank
@@ Property / cites work @@
+Noninteractive zero knowledge for NP from (Plain) Learning With Errors
+Normal rank
@@ Property / cites work @@
+Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
+Normal rank
@@ Property / cites work @@
+Graph-Induced Multilinear Maps from Lattices
@@ Property / cites work: Graph-Induced Multilinear Maps from Lattices / rank @@
+Normal rank
@@ Property / cites work @@
+Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
+Normal rank
@@ Property / cites work @@
+Candidate Multilinear Maps from Ideal Lattices
@@ Property / cites work: Candidate Multilinear Maps from Ideal Lattices / rank @@
+Normal rank
@@ Property / cites work @@
+Identity-Based (Lossy) Trapdoor Functions and Applications
+Normal rank
@@ Property / cites work @@
+Lossy trapdoor functions and their applications
@@ Property / cites work: Lossy trapdoor functions and their applications / rank @@
+Normal rank
@@ Property / cites work @@
+Dual Projective Hashing and Its Applications — Lossy Trapdoor Functions and More
+Normal rank
@@ Property / cites work @@
+A Decade of Lattice Cryptography
@@ Property / cites work: A Decade of Lattice Cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+Public-key cryptosystems from the worst-case shortest vector problem
+Normal rank
@@ Property / cites work @@
+Classical hardness of learning with errors
@@ Property / cites work: Classical hardness of learning with errors / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
+Normal rank
@@ Property / cites work @@
+Hardness of SIS and LWE with Small Parameters
@@ Property / cites work: Hardness of SIS and LWE with Small Parameters / rank @@
+Normal rank
@@ Property / cites work @@
+A sieve algorithm for the shortest lattice vector problem
+Normal rank
@@ Property / cites work @@
+Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
+Normal rank
@@ Property / cites work @@
+Rankin’s Constant and Blockwise Lattice Reduction
+Normal rank
@@ Property / cites work @@
+Q3549702
@@ Property / cites work: Q3549702 / rank @@
+Normal rank
@@ Property / cites work @@
+Lattice Enumeration Using Extreme Pruning
@@ Property / cites work: Lattice Enumeration Using Extreme Pruning / rank @@
+Normal rank
@@ Property / cites work @@
+Factoring polynomials with rational coefficients
@@ Property / cites work: Factoring polynomials with rational coefficients / rank @@
+Normal rank
@@ Property / cites work @@
+The LLL algorithm. Survey and applications
@@ Property / cites work: The LLL algorithm. Survey and applications / rank @@
+Normal rank
@@ Property / cites work @@
+Sieve algorithms for the shortest vector problem are practical
+Normal rank
@@ Property / cites work @@
+Q5417723
@@ Property / cites work: Q5417723 / rank @@
+Normal rank
@@ Property / cites work @@
+A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
+Normal rank
@@ Property / cites work @@
+On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
+Normal rank
@@ Property / cites work @@
+A hierarchy of polynomial time lattice basis reduction algorithms
+Normal rank
@@ Property / cites work @@
+Lattice basis reduction: Improved practical algorithms and solving subset sum problems
+Normal rank
@@ Property / cites work @@
+Q2757225
@@ Property / cites work: Q2757225 / rank @@
+Normal rank
@@ Property / cites work @@
+An LLL Algorithm with Quadratic Complexity
@@ Property / cites work: An LLL Algorithm with Quadratic Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4938616
@@ Property / cites work: Q4938616 / rank @@
+Normal rank
@@ Property / cites work @@
+Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
+Normal rank
@@ Property / cites work @@
+Approximate trapdoors for lattices and smaller hash-and-sign signatures
+Normal rank
@@ Property / cites work @@
+All-but-many lossy trapdoor functions from lattices and applications
+Normal rank
@@ Property / cites work @@
+All-But-Many Lossy Trapdoor Functions
@@ Property / cites work: All-But-Many Lossy Trapdoor Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Simple Lattice Trapdoor Sampling from a Broad Class of Distributions
+Normal rank
@@ Property / cites work @@
+On secret sharing systems
@@ Property / cites work: On secret sharing systems / rank @@
+Normal rank
@@ Property / cites work @@
+On Linear Secret Sharing for Connectivity in Directed Graphs
+Normal rank
@@ Property / cites work @@
+Reachability is harder for directed than for undirected finite graphs
+Normal rank
@@ Property / cites work @@
+Representing Boolean functions as polynomials modulo composite numbers
+Normal rank
@@ Property / cites work @@
+On the Lambert \(w\) function
@@ Property / cites work: On the Lambert \(w\) function / rank @@
+Normal rank
@@ Property / cites work @@
+Q3684278
@@ Property / cites work: Q3684278 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3231324
@@ Property / cites work: Q3231324 / rank @@
+Normal rank
@@ Property / cites work @@
+Proofs that ∑1/p Diverges
@@ Property / cites work: Proofs that ∑1/p Diverges / rank @@
+Normal rank