scientific article; zbMATH DE number 6866297
From MaRDI portal
Publication:4638056
DOI10.4230/LIPIcs.ITCS.2017.7zbMath1402.94051MaRDI QIDQ4638056
Vinod Vaikuntanathan, Benny Applebaum, Eyal Kushilevitz, Yuval Ishai, Naama Haramaty-Krasne
Publication date: 3 May 2018
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (16)
Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs ⋮ Asymptotically quasi-optimal cryptography ⋮ Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier ⋮ Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions ⋮ On the complexity of collision resistant hash functions: new and old black-box separations ⋮ Non-adaptive universal one-way hash functions from arbitrary one-way functions ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error ⋮ Oblivious transfer with constant computational overhead ⋮ Brakedown: linear-time and field-agnostic SNARKs for R1CS ⋮ Faster sounder succinct arguments and \textsf{IOP}s ⋮ Additive randomized encodings and their applications ⋮ Correction to: ``Locally computable UOWHF with linear shrinkage ⋮ Unnamed Item ⋮ Breaking the circuit size barrier for secure computation under quasi-polynomial LPN ⋮ Tightly secure signature schemes from the LWE and subset sum assumptions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- QUAD: A multivariate stream cipher with provable security
- On the existence of statistically hiding bit commitment schemes and fail-stop signatures
- The hunting of the SNARK
- Breaking the Circuit Size Barrier for Secure Computation Under DDH
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- On the Cryptographic Applications of Random Functions (Extended Abstract)
- Collision-Free Hashing from Lattice Problems
- Candidate One-Way Functions Based on Expander Graphs
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
- Parallel Hashing via List Recoverability
- Generalized Compact Knapsacks Are Collision Resistant
- Multivariates Polynomials for Hashing
- On Building Hash Functions from Multivariate Quadratic Equations
- Amplifying Collision Resistance: A Complexity-Theoretic Treatment
- Security Bounds for the Design of Code-Based Cryptosystems
- The Complexity of Satisfiability of Small Depth Circuits
- Unbalanced Oil and Vinegar Signature Schemes
- The rank of sparse random matrices over finite fields
- The intractability of computing the minimum distance of a code
- Computationally Sound Proofs
- Bounds on the performance of belief propagation decoding
- Fast Learning Requires Good Memory
- On ensembles of low-density parity-check codes: asymptotic distance distributions
- Random codes: minimum distances and error exponents
- Hardness of approximating the minimum distance of a linear code
- Locally Computable UOWHF with Linear Shrinkage
- Fully homomorphic encryption using ideal lattices
- Smaller Decoding Exponents: Ball-Collision Decoding
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
- Advances in Cryptology – CRYPTO 2004
- Distance Verification for Classical and Quantum LDPC Codes
- Analysis of Multivariate Hash Functions
- Progress in Cryptology – Mycrypt 2005
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- How to Garble Arithmetic Circuits
- Cryptography in $NC^0$
- Noise-tolerant learning, the parity problem, and the statistical query model
- Theory of Cryptography
This page was built for publication:
