STOC 2021

http://acm-stoc.org/stoc2021/accepted-papers.html

• Continuous LWE
• Structure vs. Randomness for Bilinear Maps
• Iterated lower bound formulas: a diagonalization-based approach to proof complexity
• An Optimal Separation of Randomized and Quantum Query Complexity
• Improving Schroeppel and Shamir's Algorithm for Subset Sum via Orthogonal Vectors
• Information Theoretic Limits of Cardinality Estimation: Fisher Meets Shannon
• k-Forrelation Optimally Separates Quantum and Classical Query Complexity
• Eliminating Intermediate Measurements in Space-Bounded Quantum Computation
• SNARGs for Bounded Depth Computations and PPAD Hardness from Sub-Exponential LWE
• Simple and fast derandomization from very hard functions: Eliminating randomness at almost no cost,
• Outcome Indistinguishability
• Average-Case Hardness of NP from Exponential Worst-Case Hardness Assumptions
• Lower Bounds for Monotone Arithmetic Circuits Via Communication Complexity
• Indistinguishability Obfuscation from Circular Security
• Automating Algebraic Proof Systems is NP-Hard
• Succinct Blind Quantum Computation Using a Random Oracle
• Pseudodeterministic Algorithms and the Structure of Probabilistic Time
• Indistinguishability Obfuscation from Well-Founded Assumptions
• Fiat-Shamir via List-Recoverable Codes (or: Parallel Repetition of GMW is not Zero-Knowledge)
• Strong Co-Nondeterministic Lower Bounds for NP Cannot Be Proved Feasibly
• Cryptography from Sublinear-Time Hardness of Time-Bounded Kolmogorov Complexity

Eurocrypt 2021

https://iacr.org/cryptodb/data/conf.php?year=2021&venue=eurocrypt

• A -Time Algorithm for -SVP and -Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP
• On the Security of Homomorphic Encryption on Approximate Numbers
• New Lattice Two-Stage Sampling Technique and its Applications to Functional Encryption – Stronger Security and Smaller Ciphertexts
• On the ideal shortest vector problem over random rational primes
• Delay Encryption
• On Bounded Distance Decoding with Predicate: Breaking the "Lattice Barrier" for the Hidden Number Problem
• Improved cryptanalysis of UOV and Rainbow
• Non-Interactive Anonymous Router
• Function Secret Sharing for Mixed-Mode and Fixed-Point Secure Computation
• Secure Software Leasing
• Public-Coin Statistical Zero-Knowledge Batch Verification against Malicious Verifiers
• Decentralized Multi-Authority ABE for DNFs from LWE
• Compact, Efficient and UC-Secure Isogeny-Based Oblivious Transfer
• Tightly-Secure Authenticated Key Exchange, Revisited
• Cryptanalytic Applications of the Polynomial Method for Solving Multivariate Equation Systems over GF(2)
• Round-Optimal Blind Signatures in the Plain Model from Classical and Quantum Standard Assumptions
• Multi-Source Non-Malleable Extractors and Applications
• Efficient Range Proofs with Transparent Setup from Bounded Integer Commitments
• Aggregatable Distributed Key Generation
• Generic Compiler for Publicly Verifiable Covert Multi-Party Computation
• Candidate Obfuscation via Oblivious LWE Sampling
• Classical vs Quantum Random Oracles
• Threshold Garbled Circuits and Ad Hoc Secure Computation
• Post-Quantum Multi-Party Computation
• Black-Box Non-Interactive Non-Malleable Commitments
• "Bifurcated Cryptography" Folding Competing Cryptosystems into a Single Scheme: On Accountability vs. Anonymity in Private Signatures
• Oblivious Transfer is in MiniQCrypt
• Towards Accountability in CRS Generation
• Non-Interactive Zero Knowledge from Sub-exponential DDH
• Multi-Party Reusable Non-Interactive Secure Computation from LWE
• Constant-Overhead Unconditionally Secure Multiparty Computation over Binary Fields
• On the (in)security of ROS
• Unbounded Multi-Party Computation from Learning with Errors
• Security Analysis of Quantum Lightning
• Non-interactive Distributional Indistinguishability (NIDI) and Non-Malleable Commitments
• High-Precision Bootstrapping of RNS-CKKS Homomorphic Encryption Using Optimal Minimax Polynomial Approximation and Inverse Sine Function
• On the Compressed-Oracle Technique, and Post-Quantum Security of Proofs of Sequential Work
• One-way functions and malleability oracles: Hidden shift attacks on isogeny-based protocols
• Breaking the Circuit Size Barrier for Secure Computation under Quasi-Polynomial LPN
• Indistinguishability Obfuscation from Simple-to-State Hard Problems: New Assumptions, New Techniques, and Simplification
• The Rise of Paillier: Homomorphic Secret Sharing and Public-Key Silent OT
• Advanced Lattice Sieving on GPUs, with Tensor Cores
• Efficient Bootstrapping for Approximate Homomorphic Encryption with Non-Sparse Keys

PKC 2021

https://pkc.iacr.org/2021/acceptedpapers.php

• Single-to-Multi-Theorem Transformations for Non-Interactive Statistical Zero-Knowledge
• Adventures in Crypto Dark Matter: Attacks and Fixes for Weak Pseudorandom Functions
• QCCA-Secure Generic Key Encapsulation Mechanism with Tighter Security in the Quantum Random Oracle Model
• Improving Revocation for Group Signature with Redactable Signature
• Bootstrapping fully homomorphic encryption over the integers in less than one second
• Group Signatures with User-Controlled and Sequential Linkability
• On the CCA Compatibility of Public-Key Infrastructure
• Round-optimal Verifiable Oblivious Pseudorandom Functions from Ideal Lattices
• Two-Party Adaptor Signatures From Identification Schemes
• On the Success Probability of Solving Unique SVP via BKZ
• Multi-Party Threshold Private Set Intersection with Sublinear Communication
• Two-round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattices
• Compact Zero-Knowledge Proofs for Threshold ECDSA with Trustless Setup
• An Efficient and Generic Construction for Signal's Handshake (X3DH): Post-Quantum, State Leakage Secure, and Deniable
• On the Integer Polynomial Learning with Errors Problem
• Exact Lattice Sampling from Non-Gaussian Distributions
• Non-Interactive CCA2-Secure Threshold Cryptosystems: Achieving Adaptive Security in the Standard Model Without Pairings
• Publicly Verifiable Zero Knowledge from (Collapsing) Blockchains
• Updatable Signatures and Message Authentication Codes
• More Efficient Digital Signatures with Tight Multi-User Security
• Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments
• Multiparty Cardinality Testing for Threshold Private Set Intersection
• A Geometric Approach to Homomorphic Secret Sharing
• Banquet: Short and Fast Signatures from AES
• On Publicly-Accountable Zero-Knowledge and Small Shuffle Arguments