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

DOI10.1016/j.tcs.2021.07.022OpenAlexW3108103136MaRDI QIDQ2232597

Vipin Singh Sehrawat, Foo Yee Yeo, Yvo G. Desmedt

Publication date: 6 October 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.14804

zbMATH Keywords

extremal set theorysecret sharinglearning with errorshidden access structuresPRIM-LWE

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• Saber
• Falcon
• ABY
• FrodoKEM

Cites Work

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

This page was built for publication: Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification