yusuke1997/dblp-id-title huggingface dataset:
OT-Combiners via Secure Computation
Resettably-Sound Resettable Zero Knowledge in Constant Rounds
Provably Memory-Hard Proofs of Work with Memory-Easy Verification
Expected Constant Round Byzantine Broadcast Under Dishonest Majority
The Randomized Iterate, Revisited - Almost Linear Seed Length PRGs from a Broader Class of One-Way Functions
A Universally Composable Secure Channel Based on the KEM-DEM Framework
Asymptotically Free Broadcast in Constant Expected Time via Packed VSS
Languages with Efficient Zero-Knowledge PCPs are in SZK
Random-Oracle Uninstantiability from Indistinguishability Obfuscation
Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
Matroids Can Be Far from Ideal Secret Sharing
From Cryptomania to Obfustopia Through Secret-Key Functional Encryption
Cryptographic Shallots: A Formal Treatment of Repliable Onion Encryption
Oblivious Transfer from Weak Noisy Channels
Transparent Error Correcting in a Computationally Bounded World
Equipping Public-Key Cryptographic Primitives with Watermarking (or: A Hole Is to Watermark)
Algebraic Group Model with Oblivious Sampling
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
Permuted Puzzles and Cryptographic Hardness
A Zero-One Law for Secure Multi-party Computation with Ternary Outputs
(Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks
Theory of Cryptography - 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, Proceedings, Part III
Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds
Communication Locality in Secure Multi-party Computation - How to Run Sublinear Algorithms in a Distributed Setting
Forward-Secure Encryption with Fast Forwarding
Inception Makes Non-malleable Codes Stronger
Expected-Time Cryptography: Generic Techniques and Applications to Concrete Soundness
On Constant-Round Concurrent Zero-Knowledge
Untelegraphable Encryption and its Applications
Optimal Amplification of Noisy Leakages
Chosen-Ciphertext Security of Multiple Encryption
On the (In)security of Kilian-Based SNARGs
Designing Fully Secure Protocols for Secure Two-Party Computation of Constant-Domain Functions
Covert Learning: How to Learn with an Untrusted Intermediary
Information-Theoretic Multi-server Private Information Retrieval with Client Preprocessing
Succinct Non-interactive Arguments via Linear Interactive Proofs
Round-Optimal and Efficient Verifiable Secret Sharing
Adaptive Security of Multi-party Protocols, Revisited
Hamming Weight Proofs of Proximity with One-Sided Error
Correlated-Input Secure Hash Functions
Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves - (ECFFT Part II)
Classical Proofs for the Quantum Collapsing Property of Classical Hash Functions
Holographic SNARGs for P and Batch-NP from (Polynomially Hard) Learning with Errors
Theory of Cryptography - 23rd International Conference, TCC 2025, Aarhus, Denmark, December 1-5, 2025, Proceedings, Part II
On the Impossibility of Entropy Reversal, and Its Application to Zero-Knowledge Proofs
Error Correction in the Bounded Storage Model
Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs
Linear-Time Arguments with Sublinear Verification from Tensor Codes
Sandwich BUFF: Achieving Non-resignability Using Iterative Hash Functions
Upgrading to Functional Encryption
Four-Round Black-Box Non-malleable Schemes from One-Way Permutations
Private Constrained PRFs (and More) from LWE
Weakly Extractable One-Way Functions
Signatures Resilient to Continual Leakage on Memory and Computation
Theory of Cryptography - 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, Proceedings, Part I
Theory of Cryptography - 22nd International Conference, TCC 2024, Milan, Italy, December 2-6, 2024, Proceedings, Part IV
Unclonable Commitments and Proofs
Immunizing Backdoored PRGs
Foundations of Single-Decryptor Encryption
The Price of Verifiability: Lower Bounds for Verifiable Random Functions
Fast Private Norm Estimation and Heavy Hitters
Order-Revealing Encryption and the Hardness of Private Learning
IBE with Incompressible Master Secret and Small Identity Secrets
Lower Bounds for Concurrent Self Composition
Cryptographic Assumptions: A Position Paper
How to Verify that a Small Device is Quantum, Unconditionally
Securely Obfuscating Re-encryption
Information-Theoretically Secure MPC Against Mixed Dynamic Adversaries
Adaptively Secure Attribute-Based Encryption from Witness Encryption
Doubly-Efficient Batch Verification in Statistical Zero-Knowledge
How Efficient Can Memory Checking Be?
Theory of Cryptography - 22nd International Conference, TCC 2024, Milan, Italy, December 2-6, 2024, Proceedings, Part II
Non-malleable Condensers for Arbitrary Min-entropy, and Almost Optimal Protocols for Privacy Amplification
ABE for Circuits with Constant-Size Secret Keys and Adaptive Security
Revisiting Lower and Upper Bounds for Selective Decommitments
Multi-key Fully-Homomorphic Encryption in the Plain Model
A General Composition Theorem for Secure Reactive Systems
On the Security of the "Free-XOR" Technique
Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols
Rationality in the Full-Information Model
On the Notion of Pseudo-Free Groups
Parallel Repetition for Leakage Resilience Amplification Revisited
Adaptively Secure Garbling Schemes for Parallel Computations
Theory of Cryptography - 20th International Conference, TCC 2022, Chicago, IL, USA, November 7-10, 2022, Proceedings, Part I
Constant Ciphertext-Rate Non-committing Encryption from Standard Assumptions
Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions - Or: How to Secretly Embed a Circuit in Your PRF
Round-Efficient Byzantine Agreement and Multi-party Computation with Asynchronous Fallback
A Domain Extender for the Ideal Cipher
Two-Round Secure MPC from Indistinguishability Obfuscation
Security Amplification for InteractiveCryptographic Primitives
Verifiably Secure Devices
Input Locality and Hardness Amplification
Counting Unpredictable Bits: A Simple PRG from One-Way Functions
On the Complexity of Parallel Hardness Amplification for One-Way Functions
Offline-Online Indifferentiability of Cryptographic Systems
Secure Physical Computation Using Disposable Circuits
Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments
Coupling of Random Systems
An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle
Topology-Hiding Computation Beyond Semi-Honest Adversaries
Statistical Concurrent Non-malleable Zero Knowledge
On the Impossibility of Surviving (Iterated) Deletion of Weakly Dominated Strategies in Rational MPC
From FE Combiners to Secure MPC and Back
Access Control Encryption: Enforcing Information Flow with Cryptography
Oblivious Transfer in Incomplete Networks
Saving Private Randomness in One-Way Functions and Pseudorandom Generators
Relaxing Environmental Security: Monitored Functionalities and Client-Server Computation
Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II
Quantum Pseudorandom Scramblers
Polynomial Secret Sharing Schemes and Algebraic Matroids
Tight Parallel Repetition Theorems for Public-Coin Arguments Using KL-Divergence
Theory of Cryptography - 23rd International Conference, TCC 2025, Aarhus, Denmark, December 1-5, 2025, Proceedings, Part IV
Evaluating 2-DNF Formulas on Ciphertexts
Adaptively Secure Streaming Functional Encryption
Security with Functional Re-encryption from CPA
On the Necessity of Rewinding in Secure Multiparty Computation
Quantum Rewinding for IOP-Based Succinct Arguments
Three Party Secure Computation with Friends and Foes
Simple Constructions from (Almost) Regular One-Way Functions
Unifying Presampling via Concentration Bounds
Resource Fairness and Composability of Cryptographic Protocols
Cutting-Edge Cryptography Through the Lens of Secret Sharing
Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents
Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I
On Actively-Secure Elementary MPC Reductions
Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model
Key-Homomorphic and Aggregate Verifiable Random Functions
How to Sample a Discrete Gaussian (and more) from a Random Oracle
Constrained Keys for Invertible Pseudorandom Functions
New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
Theory of Cryptography - 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part II
Moderately Hard Functions: Definition, Instantiations, and Applications
A Toolbox for Barriers on Interactive Oracle Proofs
MPC vs. SFE: Perfect Security in a Unified Corruption Model
One-Time Computable Self-erasing Functions
Hardness Preserving Constructions of Pseudorandom Functions
Lossy Functions Do Not Amplify Well
Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model
From Polynomial IOP and Commitments to Non-malleable zkSNARKs
Information-Theoretic 2-Round MPC Without Round Collapsing: Adaptive Security, and More
Differentially Private Learning Beyond the Classical Dimensionality Regime
Provable Time-Memory Trade-Offs: Symmetric Cryptography Against Memory-Bounded Adversaries
A New Cramer-Shoup Like Methodology for Group Based Provably Secure Encryption Schemes
A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch
Secure Computation with Preprocessing via Function Secret Sharing
Tackling Adaptive Corruptions in Multicast Encryption Protocols
Characterizing Deterministic-Prover Zero Knowledge
Déjà Q: Encore! Un Petit IBE
Accumulators in (and Beyond) Generic Groups: Non-trivial Batch Verification Requires Interaction
Secure Computation of the Mean and Related Statistics
Binary AMD Circuits from Secure Multiparty Computation
Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part II
On Computational Shortcuts for Information-Theoretic PIR
Attribute-Hiding Predicate Encryption in Bilinear Groups, Revisited
A Parallel Repetition Theorem for Leakage Resilience
Secure Computation and Its Diverse Applications
Sparse Linear Regression and Lattice Problems
Beyond the Limitation of Prime-Order Bilinear Groups, and Round Optimal Blind Signatures
Oblivious Transfer from Trapdoor Permutations in Minimal Rounds
Composing Quantum Protocols in a Classical Environment
Unclonable Cryptography with Unbounded Collusions and Impossibility of Hyperefficient Shadow Tomography
On the (Ir)Replaceability of Global Setups, or How (Not) to Use a Global Ledger
Linear Secret-Sharing Schemes for Forbidden Graph Access Structures
Statistical Layered MPC
Four-State Non-malleable Codes with Explicit Constant Rate
Synchronous Constructive Cryptography
Computational Robust (Fuzzy) Extractors for CRS-Dependent Sources with Minimal Min-entropy
Threshold Secret Sharing Requires a Linear Size Alphabet
Composable Long-Term Security with Rewinding
On Hardness Amplification of One-Way Functions
Scalable Multi-server Private Information Retrieval
A Study of Pair Encodings: Predicate Encryption in Prime Order Groups
Proactive Secret Sharing with Constant Communication
On the Possibility of One-Message Weak Zero-Knowledge
Multi-property Preserving Combiners for Hash Functions
Multi-authority ABE from Lattices Without Random Oracles
Non-Interactive Anonymous Router with Quasi-Linear Router Computation
Round-Robin is Optimal: Lower Bounds for Group Action Based Protocols
Why "Fiat-Shamir for Proofs" Lacks a Proof
Weakening Assumptions for Publicly-Verifiable Deletion
On Communication Models and Best-Achievable Security in Two-Round MPC
On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models
Simultaneous Secrecy and Reliability Amplification for a General Channel Model
On the Complexity of Fair Coin Flipping
LEGO for Two-Party Secure Computation
Functional Encryption for Quadratic Functions from k-Lin, Revisited
Statistical ZAPs from Group-Based Assumptions
Secure Quantum Computation with Classical Communication
Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation
Theory of Cryptography - 10th Theory of Cryptography Conference, TCC 2013, Tokyo, Japan, March 3-6, 2013. Proceedings
Leakage-Resilient Signatures
Multi-instance Randomness Extraction and Security Against Bounded-Storage Mass Surveillance
Laconic Private Set Intersection and Applications
Efficient Secure Multiparty Computation with Identifiable Abort
Zeroizing Attacks Against Evasive and Circular Evasive LWE
Interactive Oracle Proofs
Fully Homomorphic NIZK and NIWI Proofs
Towards Doubly Efficient Private Information Retrieval
NIZK from SNARG
Composability and On-Line Deniability of Authentication
From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes
Bandwidth Hard Functions for ASIC Resistance
On the Indifferentiability of Key-Alternating Feistel Ciphers with No Key Derivation
Composable and Finite Computational Security of Quantum Message Transmission
Secret-Key Zero-Knowlegde and Non-interactive Verifiable Exponentiation
Pseudorandom (Function-Like) Quantum State Generators: New Definitions and Applications
Universally Composable Synchronous Computation
General Properties of Quantum Zero-Knowledge Proofs
Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering
Limits on the Locality of Pseudorandom Generators and Applications to Indistinguishability Obfuscation
From Indifferentiability to Constructive Cryptography (and Back)
Zero-Communication Reductions
Chosen Ciphertext Security via Point Obfuscation
Quantum Encryption with Certified Deletion
Near-Optimal Secret Sharing and Error Correcting Codes in \mathsf AC^0 AC 0
Secure Non-interactive Reducibility is Decidable
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
Lossiness and Entropic Hardness for Ring-LWE
Quantum Key-Revocable Dual-Regev Encryption, Revisited
Deniable Attribute Based Encryption for Branching Programs from LWE
Computing on Authenticated Data
Simple, Black-Box Constructions of Adaptively Secure Protocols
Steganography-Free Zero-Knowledge
An Improvement Upon the Bounds for the Local Leakage Resilience of Shamir's Secret Sharing Scheme
Leakage Resilient Fully Homomorphic Encryption
ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation
Point-Function Obfuscation: A Framework and Generic Constructions
Batch Arguments to NIZKs from One-Way Functions
The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs
BKW Meets Fourier New Algorithms for LPN with Sparse Parities
Lower Bounds for the Number of Decryption Updates in Registration-Based Encryption
Rerandomizable and Replayable Adaptive Chosen Ciphertext Attack Secure Cryptosystems
On Black-Box Constructions of Time and Space Efficient Sublinear Arguments from Symmetric-Key Primitives
Chosen-Ciphertext Security from Tag-Based Encryption
Your Reputation's Safe with Me: Framing-Free Distributed Zero-Knowledge Proofs
Hardness Preserving Reductions via Cuckoo Hashing
Chainable Functional Commitments for Unbounded-Depth Circuits
Non-interactive Classical Verification of Quantum Computation
Continuous Group Key Agreement with Active Security
Bit-Security Preserving Hardness Amplification
From Selective IBE to Full IBE and Selective HIBE
Equivocal Blind Signatures and Adaptive UC-Security
Theory of Cryptography - 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part IV
PPAD is as Hard as LWE and Iterated Squaring
Non-malleable Codes, Extractors and Secret Sharing for Interleaved Tampering and Composition of Tampering
Distributed Oblivious RAM for Secure Two-Party Computation
Tightly-Secure Authenticated Key Exchange
Purely Rational Secret Sharing (Extended Abstract)
Errata to (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks
On Fully Secure MPC with Solitary Output
Theory of Cryptography - 23rd International Conference, TCC 2025, Aarhus, Denmark, December 1-5, 2025, Proceedings, Part I
On the (In)security of Fischlin's Paradigm
Delegating Quantum Computation in the Quantum Random Oracle Model
Efficient Rational Secret Sharing in Standard Communication Networks
Two-Round Man-in-the-Middle Security from LPN
Batching Adaptively-Sound SNARGs for NP
Smooth NIZK Arguments
Simpler Session-Key Generation from Short Random Passwords
Public-Key Encryption Schemes with Auxiliary Inputs
Bit Security: Optimal Adversaries, Equivalence Results, and a Toolbox for Computational-Statistical Security Analysis
Obfuscating Pseudorandom Functions is Post-quantum Complete
Computational Soundness of Coinductive Symbolic Security under Active Attacks
When Does Functional Encryption Imply Obfuscation?
On the Impossibility of Actively Secure Distributed Samplers
The Round Complexity of Quantum Zero-Knowledge
Multi-server Doubly Efficient PIR in the Classical Model and Beyond
Environmentally Friendly Composable Multi-party Computation in the Plain Model from Standard (Timed) Assumptions
Theory of Cryptography - 22nd International Conference, TCC 2024, Milan, Italy, December 2-6, 2024, Proceedings, Part I
Publicly Verifiable Deletion from Minimal Assumptions
Theory of Cryptography - 17th International Conference, TCC 2019, Nuremberg, Germany, December 1-5, 2019, Proceedings, Part I
Efficient Blind and Partially Blind Signatures Without Random Oracles
Multi-Client Non-interactive Verifiable Computation
Memory Checking for Parallel RAMs
PRF Domain Extension Using DAGs
Intrusion-Resilient Key Exchange in the Bounded Retrieval Model
Non-Malleable Encryption: Simpler, Shorter, Stronger
How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge
Super-Linear Time-Memory Trade-Offs for Symmetric Encryption
Constant-Round Oblivious Transfer in the Bounded Storage Model
The Layered Games Framework for Specifications and Analysis of Security Protocols
Matrix PRFs: Constructions, Attacks, and Applications to Obfuscation
Real-Valued Somewhat-Pseudorandom Unitaries
Mr NISC: Multiparty Reusable Non-Interactive Secure Computation
Four-Round Statistical Non-malleable Zero-Knowledge
Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations
Constructing and Understanding Chosen Ciphertext Security via Puncturable Key Encapsulation Mechanisms
On the One-Per-Message Unforgeability of (EC)DSA and Its Variants
Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions
Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security - (Extended Abstract)
Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part II
How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
Alternatives to Non-malleability: Definitions, Constructions, and Applications (Extended Abstract)
Hierarchical Identity Based Encryption with Polynomially Many Levels
Semi-quantum Copy-Protection and More
Secure Software Leasing from Standard Assumptions
The Security of Lazy Users in Out-of-Band Authentication
Games and the Impossibility of Realizable Ideal Functionality
Semi-adaptive Security and Bundling Functionalities Made Generic and Easy
A Quantitative Approach to Reductions in Secure Computation
Unbounded Leakage-Resilience and Intrusion-Detection in a Quantum World
One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments
Relationships Between Quantum IND-CPA Notions
Overcoming Weak Expectations
Computational Extractors and Pseudorandomness
Multilinear Schwartz-Zippel Mod N and Lattice-Based Succinct Arguments
Limits of Computational Differential Privacy in the Client/Server Setting
One-Out-of-Many Unclonable Cryptography: Definitions, Constructions, and More
SNARK Lower Bounds via Communication Complexity
Practical Adaptive Oblivious Transfer from Simple Assumptions
Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?
Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token
Functional Encryption for Turing Machines
Algebraic (Trapdoor) One-Way Functions and Their Applications
Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More
Efficient Private PEZ Protocols for Symmetric Functions
Oblivious-Transfer Complexity of Noisy Coin-Toss via Secure Zero Communication Reductions
Verifiable Random Functions from Weaker Assumptions
Reducing the Share Size of Weighted Threshold Secret Sharing Schemes via Chow Parameters Approximation
How to Avoid Obfuscation Using Witness PRFs
On Bounded Storage Key Agreement and One-Way Functions
Polylogarithmic Private Approximations and Efficient Matching
Improved OR-Composition of Sigma-Protocols
Non-malleable Obfuscation
Probabilistically Checkable Proofs of Proximity with Zero-Knowledge
Network Agnostic MPC with Statistical Security
Deniable Secret Sharing
Feasibility and Completeness of Cryptographic Tasks in the Quantum World
A Counterexample to the Chain Rule for Conditional HILL Entropy - And What Deniable Encryption Has to Do with It
Acyclicity Programming for Sigma-Protocols
Agile Cryptography: A Universally Composable Approach
On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i
New Techniques in Replica Encodings with Client Setup
Asymptotically Efficient Lattice-Based Digital Signatures
Simplex Consensus: A Simple and Fast Consensus Protocol
Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I
Attribute-Based Functional Encryption on Lattices
Robust Secret Sharing with Almost Optimal Share Size and Security Against Rushing Adversaries
Broadcast Amplification
Random-Index PIR and Applications
Adaptive Security of Symbolic Encryption
Iterative Constructions and Private Data Release
The Differential Privacy Frontier (Extended Abstract)
Plonk is Simulation Extractable in ROM Under Falsifiable Assumptions
Testing the Lipschitz Property over Product Distributions with Applications to Data Privacy
Generalized Environmental Security from Number Theoretic Assumptions
Perfectly-Secure MPC with Linear Communication Complexity
Round-Optimal Secure Two-Party Computation from Trapdoor Permutations
Adaptive Succinct Garbled RAM or: How to Delegate Your Database
Bridging Game Theory and Cryptography: Recent Results and Future Directions
Obfuscation of Probabilistic Circuits and Applications
Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND
Synchronous Consensus with Optimal Asynchronous Fallback Guarantees
Ledger Combiners for Fast Settlement
Theory of Cryptography - 17th International Conference, TCC 2019, Nuremberg, Germany, December 1-5, 2019, Proceedings, Part II
Multi-client Attribute-Based and Predicate Encryption from Standard Assumptions
Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs
Key Exchange Using Passwords and Long Keys
Continuously Non-malleable Secret Sharing for General Access Structures
Almost Optimal Bounds for Direct Product Threshold Theorem
Implementing Resettable UC-Functionalities with Untrusted Tamper-Proof Hardware-Tokens
The Cost of Adaptivity in Security Games on Graphs
Aggregate Pseudorandom Functions and Connections to Learning
(Pseudo) Random Quantum States with Binary Phase
Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge
An Equivalence Between Zero Knowledge and Commitments
Round-Efficient Byzantine Broadcast Under Strongly Adaptive and Majority Corruptions
Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices
Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation
Compactness vs Collusion Resistance in Functional Encryption