yusuke1997/dblp-id-title huggingface dataset:
Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles
Perfect Structure on the Edge of Chaos - Trapdoor Permutations from Indistinguishability Obfuscation
Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part I
Multi-key Authenticated Encryption with Corruptions: Reductions Are Lossy
3-Party Secure Computation for RAMs: Optimal and Concretely Efficient
Homomorphic Evaluation Requires Depth
Near-Optimal Private Information Retrieval with Preprocessing
Stronger Lower Bounds for Online ORAM
Slightly Sublinear Trapdoor Hash Functions and PIR from Low-Noise LPN
Two-Round MPC: Information-Theoretic and Black-Box
Limits in the Provable Security of ECDSA Signatures
Secure Linear Algebra Using Linearly Recurrent Sequences
Compact Key Storage in the Standard Model
Functional Encryption: Definitions and Challenges
Time-Space Trade-Offs for Sumcheck
Universally Composable Security with Global Setup
Interactive Coding for Interactive Proofs
Oblivious Parallel RAM and Applications
Lower Bounds in the Hardware Token Model
On Statistical Security in Two-Party Computation
Secret-Sharing Schemes for High Slices
Delegating RAM Computations with Adaptive Soundness and Privacy
The Cost of Maintaining Keys in Dynamic Groups with Applications to Multicast Encryption and Group Messaging
Functional Encryption for Bounded Collusions, Revisited
A Generic Approach to Constructing and Proving Verifiable Random Functions
Unfair Noisy Channels and Oblivious Transfer
The Power of Negations in Cryptography
Towards a Theory of Extractable Functions
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
Towards General-Purpose Program Obfuscation via Local Mixing
The Pseudorandomness of Legendre Symbols Under the Quadratic-Residuosity Assumption
From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back
One-Way Functions and pKt Complexity
Generalized Proofs of Knowledge with Fully Dynamic Setup
Leakage-Resilient Non-malleable Codes
Updatable Public Key Encryption in the Standard Model
Disappearing Cryptography in the Bounded Storage Model
Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
Adaptively-Secure, Non-interactive Public-Key Encryption
Comparing Two Notions of Simulatability
Verifiable Private Information Retrieval
Optimal Bounded-Collusion Secure Functional Encryption
Generic-Group Lower Bounds via Reductions Between Geometric-Search Problems: With and Without Preprocessing
Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way
Private Coins versus Public Coins in Zero-Knowledge Proof Systems
On Perfect Correctness in (Lockable) Obfuscation
Graph-Induced Multilinear Maps from Lattices
Round-Optimal Privacy-Preserving Protocols with Smooth Projective Hash Functions
Rate-1 Quantum Fully Homomorphic Encryption
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation
Theory of Cryptography - 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, Proceedings, Part II
Rigorous Foundations for Dual Attacks in Coding Theory
Subspace LWE
A Simple Construction of iO for Turing Machines
General Adversary Structures in Byzantine Agreement and Multi-party Computation with Active and Omission Corruption
Two-Round Maliciously Secure Computation with Super-Polynomial Simulation
Randomness-Dependent Message Security
On Iterative Collision Search for LPN and Subset Sum
Exploring Crypto Dark Matter: - New Simple PRF Candidates and Their Applications
On the Regularity of Lossy RSA - Improved Bounds and Applications to Padding-Based Encryption
On the Relationships Between Notions of Simulation-Based Security
Efficient Multi-party Computation with Dispute Control
zkSNARKs in the ROM with Unconditional UC-Security
Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability
Lower Bounds for Multi-server Oblivious RAMs
Leakage-Tolerant Interactive Protocols
Predicate Privacy in Encryption Systems
Quantum Rewinding for Many-Round Protocols
Some Recent Progress in Lattice-Based Cryptography
Computational Collapse of Quantum State with Application to Oblivious Transfer
A Unified Approach to Constructing Black-Box UC Protocols in Trusted Setup Models
Designated Confirmer Signatures Revisited
On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators
Parallel Repetition Theorems for Interactive Arguments
Perfectly Secure Oblivious RAM without Random Oracles
Lower Bounds on the Time/Memory Tradeoff of Function Inversion
Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
An Unstoppable Ideal Functionality for Signatures and a Modular Analysis of the Dolev-Strong Broadcast
On Symmetric Encryption and Point Obfuscation
Hardness Amplification of Weakly Verifiable Puzzles
Impossibility of Blind Signatures from One-Way Permutations
Leakage-resilient Linear Secret-sharing Against Arbitrary Bounded-size Leakage Family
Statistical Security in Two-Party Computation Revisited
Long-Term Security and Universal Composability
Identifying Cheaters without an Honest Majority
3-Message Zero Knowledge Against Human Ignorance
Locally Verifiable Distributed SNARGs
Efficiency Limitations for Σ-Protocols for Group Homomorphisms
Distributed Broadcast Encryption from Lattices
Authenticated Adversarial Routing
Lower Bounds on Implementing Robust and Resilient Mediators
Universally Composable Privacy Amplification Against Quantum Adversaries
Multilinear Maps from Obfuscation
Relativized Succinct Arguments in the ROM do not Exist
Asynchronous Agreement on a Core Set in Constant Expected Time and More Efficient Asynchronous VSS and MPC
Richer Efficiency/Security Trade-offs in 2PC
How to Securely Outsource Cryptographic Computations
Non-malleable Vector Commitments via Local Equivocability
Exploring the Limits of Common Coins Using Frontier Analysis of Protocols
Asynchronous Byzantine Agreement with Subquadratic Communication
Encrypted Messages from the Heights of Cryptomania
New Approaches to Traitor Tracing with Embedded Identities
General Hardness Amplification of Predicates and Puzzles - (Extended Abstract)
Rate-1 Zero-Knowledge Proofs from One-Way Functions
Theory of Cryptography - 19th International Conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021, Proceedings, Part I
Ideal-SVP is Hard for Small-Norm Uniform Prime Ideals
On the Feasibility of Extending Oblivious Transfer
Theory of Cryptography - 20th International Conference, TCC 2022, Chicago, IL, USA, November 7-10, 2022, Proceedings, Part III
Efficient Secure Communication over Dynamic Incomplete Networks with Minimal Connectivity
A Note on Constant-Round Zero-Knowledge Proofs for NP
Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
Chosen-Ciphertext Security via Correlated Products
On Black-Box Verifiable Outsourcing
Revocable Cryptography from Learning with Errors
Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model
Succinct Arguments in the Quantum Random Oracle Model
Delayed-Key Message Authentication for Streams
sfJustvengers: Batched VOLE ZK Disjunctions in 풪(R+B+C) Communication
Fully-Secure MPC with Minimal Trust
Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs
On Achieving "Best-in-the-Multiverse" MPC
Ring Signatures: Stronger Definitions, and Constructions Without Random Oracles
Statistical Difference Beyond the Polarizing Regime
Security Bounds for Proof-Carrying Data from Straightline Extractors
Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Providence, RI, USA, March 28-30, 2011. Proceedings
Unifying Classical and Quantum Key Distillation
Computational Monogamy of Entanglement and Non-interactive Quantum Key Distribution
Realistic Failures in Secure Multi-party Computation
Permissionless Clock Synchronization with Public Setup
On the (Im)possibility of Game-Theoretically Fair Leader Election Protocols
Theory of Cryptography, Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10-12, 2005, Proceedings
(Password) Authenticated Key Establishment: From 2-Party to Group
On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations
Key-Homomorphic Constrained Pseudorandom Functions
Round Optimal Concurrent MPC via Strong Simulation
Can PPAD Hardness be Based on Standard Cryptographic Assumptions?
The Brave New World of Global Generic Groups and UC-Secure Zero-Overhead SNARKs
Round Optimal Concurrent Non-malleability from Polynomial Hardness
An Equivalence Between Attribute-Based Signatures and Homomorphic Signatures, and New Constructions for Both
Information-Theoretic Broadcast-Optimal MPC
On the Price of Concurrency in Group Ratcheting Protocols
Time/Space Tradeoffs for Generic Attacks on Delay Functions
Single-Key to Multi-Key Functional Encryption with Polynomial Loss
Four Round Secure Computation Without Setup
A Note on Low-Communication Secure Multiparty Computation via Circuit Depth-Reduction
Return of GGH15: Provable Security Against Zeroizing Attacks
Bounds on the Sample Complexity for Private Learning and Private Data Release
Resource-Efficient OT Combiners with Active Security
Classical Verification of Quantum Computations with Efficient Verifier
Achieving Constant Round Leakage-Resilient Zero-Knowledge
Unconditional Foundations for Supersingular Isogeny-Based Cryptography
Interactive Zero-Knowledge with Restricted Random Oracles
Batched Multi-hop Multi-key FHE from Ring-LWE with Compact Ciphertext Extension
Adaptively Indistinguishable Garbled Circuits
Point Obfuscation and 3-Round Zero-Knowledge
Is Information-Theoretic Topology-Hiding Computation Possible?
Obfuscation for Cryptographic Purposes
Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation
Securing Unbounded Differential Privacy Against Timing Attacks
On Black-Box Reductions between Predicate Encryption Schemes
Low-Degree Security of the Planted Random Subgraph Problem
Obfuscated Fuzzy Hamming Distance and Conjunctions from Subset Product Problems
Strengthening the Security of Encrypted Databases: Non-transitive JOINs
Robust Combiners and Universal Constructions for Quantum Cryptography
On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
Adaptive Security, Erasures, and Network Assumptions in Communication-Local MPC
Universally Composable Succinct Vector Commitments and Applications
Limits on Adaptive Security for Attribute-Based Encryption
Tighter Adaptive IBEs and VRFs: Revisiting Waters' Artificial Abort
Trojan-Resilience Without Cryptography
Large-Plaintext Functional Bootstrapping in FHE with Small Bootstrapping Keys
Non-malleable Time-Lock Puzzles and Applications
On One-Way Functions, the Worst-Case Hardness of Time-Bounded Kolmogorov Complexity, and Computational Depth
On the Impossibility of Structure-Preserving Deterministic Primitives
Weak Verifiable Random Functions
On Extractability Obfuscation
Searching for ELFs in the Cryptographic Forest
Towards Privacy for Social Networks: A Zero-Knowledge Based Definition of Privacy
Adaptive Multiparty NIKE
Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
Random-Index Oblivious RAM
Theory of Cryptography - 11th Theory of Cryptography Conference, TCC 2014, San Diego, CA, USA, February 24-26, 2014. Proceedings
Non-interactive Zero-Knowledge from Homomorphic Encryption
Black-Box Impossibilities of Obtaining 2-Round Weak ZK and Strong WI from Polynomial Hardness
On the Complexity of Arithmetic Secret Sharing
Towards a Separation of Semantic and CCA Security for Public Key Encryption
Combinatorially Homomorphic Encryption
Privately Constrained PRFs from DCR: Puncturing and Bounded Waring Rank
A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness
Towards Multiparty Computation Withstanding Coercion of All Parties
Round Optimal Black-Box "Commit-and-Prove"
Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds
Fairness with an Honest Minority and a Rational Majority
On Basing Search SIVP on NP-Hardness
Efficient, Robust and Constant-Round Distributed RSA Key Generation
Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
Degradation and Amplification of Computational Hardness
Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits
Linear-Size Constant-Query IOPs for Delegating Computation
Universal Reductions: Reductions Relative to Stateful Oracles
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
Proofs of Retrievability via Hardness Amplification
Cryptography from Planted Graphs: Security with Logarithmic-Size Messages
On the Hardness of Learning with Rounding over Small Modulus
The Power of NAPs: - Compressing OR-Proofs via Collision-Resistant Hashing
Parallel Repetition of Computationally Sound Protocols Revisited
A Lower Bound for One-Round Oblivious RAM
Achievable CCA2 Relaxation for Homomorphic Encryption
Notions of Reducibility between Cryptographic Primitives
Doubly Efficient Interactive Proofs over Infinite and Non-commutative Rings
Perfectly Secure Message Transmission in Two Rounds
On Matroids and Non-ideal Secret Sharing
Semi-honest to Malicious Oblivious Transfer - The Black-Box Way
No-signaling Linear PCPs
Output-Compressing Randomized Encodings and Applications
Theory of Cryptography, 4th Theory of Cryptography Conference, TCC 2007, Amsterdam, The Netherlands, February 21-24, 2007, Proceedings
Round Optimal Secure Multiparty Computation from Minimal Assumptions
Multi-authority Attribute Based Encryption
Cryptography in Subgroups of Z n
Indistinguishability Obfuscation: From Approximate to Exact
Amortizing Rate-1 OT and Applications to PIR and PSI
Theory of Cryptography - 20th International Conference, TCC 2022, Chicago, IL, USA, November 7-10, 2022, Proceedings, Part II
Erratum: Succinct Non-interactive Arguments via Linear Interactive Proofs
On the (In)Security of SNARKs in the Presence of Oracles
On Related-Secret Pseudorandomness
The Complexity of Computing the Optimal Composition of Differential Privacy
On the Black-Box Complexity of Optimally-Fair Coin Tossing
Registration-Based Encryption: Removing Private-Key Generator from IBE
Revisiting Fairness in MPC: Polynomial Number of Parties and General Adversarial Structures
Can We Access a Database Both Locally and Privately?
Lower Bounds for Non-interactive Zero-Knowledge
Classical Binding for Quantum Commitments
Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing
DORAM Revisited: Maliciously Secure RAM-MPC with Logarithmic Overhead
Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs
Theory of Cryptography - 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part I
Public-Key Encryption with Quantum Keys
Towards Topology-Hiding Computation from Oblivious Transfer
Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds
Composition of Random Systems: When Two Weak Make One Strong
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
Forward Secret Encrypted RAM: Lower Bounds and Applications
Secure Computation for Big Data
Efficient Perfectly Secure Computation with Optimal Resilience
On Average-Case Hardness in TFNP from One-Way Functions
On Secure Two-Party Computation in Three Rounds
Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption: A Tight Computational Lower Bound
P-signatures and Noninteractive Anonymous Credentials
Concurrent Zero Knowledge Without Complexity Assumptions
Polynomial-Time Targeted Attacks on Coin Tossing for Any Number of Corruptions
On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness
Efficient Garbled Pseudorandom Functions and Lookup Tables from Minimal Assumption
Optimal Broadcast Encryption from LWE and Pairings in the Standard Model
Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs
How to Compile Polynomial IOP into Simulation-Extractable SNARKs: A Modular Approach
Concurrent Non-Malleable Zero Knowledge with Adaptive Inputs
On the Security of Time-Lock Puzzles and Timed Commitments
Blockchains Enable Non-interactive MPC
Information-Theoretic Secret-Key Agreement: The Asymptotically Tight Relation Between the Secret-Key Rate and the Channel Quality Ratio
Instance-Hiding Interactive Proofs - (Extended Abstract)
Perfectly Secure Oblivious Parallel RAM
A Ciphertext-Size Lower Bound for Order-Preserving Encryption with Limited Leakage
The Edited Truth
Obfuscation of Hyperplane Membership
Rate-1 Arithmetic Garbling From Homomorphic Secret Sharing
Attribute Based Encryption for Deterministic Finite Automata from \mathsfDLIN
Tamper Detection and Continuous Non-malleable Codes
(Verifiable) Delay Functions from Lucas Sequences
Impossibility of Simulation Secure Functional Encryption Even with Random Oracles
Distributing Keys and Random Secrets with Constant Complexity
Pseudorandom Function-Like States from Common Haar Unitary
On Compressing Encrypted Data without the Encryption Key
On Secure Computation of Solitary Output Functionalities with and Without Broadcast
Toward Privacy in Public Databases
On Communication-Efficient Asynchronous MPC with Adaptive Security
The Resiliency of MPC with Low Interaction: The Benefit of Making Errors (Extended Abstract)
Succinct Malleable NIZKs and an Application to Compact Shuffles
Taming Adaptivity in YOSO Protocols: The Modular Way
Uniqueness Is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor Permutations
Interactive Non-malleable Codes
Towards Non-Black-Box Separations of Public Key Encryption and One Way Function
From Weak to Strong Zero-Knowledge and Applications
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
Founding Cryptography on Tamper-Proof Hardware Tokens
Outlier Privacy
Limits on the Stretch of Non-adaptive Constructions of Pseudo-Random Generators
Rate-1 Incompressible Encryption from Standard Assumptions
Locally Decodable and Updatable Non-malleable Codes and Their Applications
Estimating Gaps in Martingales and Applications to Coin-Tossing: Constructions and Hardness
CPA-to-CCA Transformation for KDM Security
Fine-Grained Secure Computation
The Function-Inversion Problem: Barriers and Opportunities
Secure Arithmetic Computation with No Honest Majority
Synchronizable Fair Exchange
Simultaneous Hardcore Bits and Cryptography against Memory Attacks
Sufficient Conditions for Collision-Resistant Hashing
On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes
Black-Box Circular-Secure Encryption beyond Affine Functions
Physically Observable Cryptography (Extended Abstract)
A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles
Achieving Leakage Resilience through Dual System Encryption
Function-Private Functional Encryption in the Private-Key Setting
Generalized Special-Sound Interactive Proofs and Their Knowledge Soundness
Simple and Efficient Batch Verification Techniques for Verifiable Delay Functions
On the Complexity of Additively Homomorphic UC Commitments
Multi-authority Functional Encryption with Bounded Collusions from Standard Assumptions
Seedless Condensers for Efficiently Samplable Sources
An Efficient Parallel Repetition Theorem
Secure Computation with Parallel Calls to 2-Ary Functions
Robust Encryption
Theory of Cryptography, 6th Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009. Proceedings
Functional Encryption Without Obfuscation
Post-quantum Resettably-Sound Zero Knowledge
Identity-Based Encryption Secure against Selective Opening Attack
Collusion Resistant Copy-Protection for Watermarkable Functionalities
On the Limitations of Pseudorandom Unitaries - Or: Cryptographic Applications of LOCC Indistinguishability of Identical Versus Independent Haar Unitaries
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
Functional Re-encryption and Collusion-Resistant Obfuscation
Concurrent Security and Non-malleability
The MMap Strikes Back: Obfuscation and New Multilinear Maps Immune to CLT13 Zeroizing Attacks
Decomposable Obfuscation: A Framework for Building Applications of Obfuscation from Polynomial Hardness
Fully Succinct Batch Arguments for sfNP from Indistinguishability Obfuscation
Strong Hardness of Privacy from Weak Traitor Tracing
Multiparty Homomorphic Secret Sharing and More from LPN and MQ
Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments
One-Sided Adaptively Secure Two-Party Computation
Secure Sampling with Sublinear Communication
Multi-key FHE from LWE, Revisited
On the Necessary and Sufficient Assumptions for UC Computation
From One-Time to Two-Round Reusable Multi-signatures Without Nested Forking
Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens
Security Proofs for Key-Alternating Ciphers with Non-Independent Round Permutations
Characterizing Collision and Second-Preimage Resistance in Linicrypt
Homomorphic Encryption: From Private-Key to Public-Key
Evaluating Branching Programs on Encrypted Data
Secure Quantum Extraction Protocols
Fully-Homomorphic Encryption from Lattice Isomorphism
Bounded Functional Encryption for Turing Machines: Adaptive Security from General Assumptions
Signatures of Correct Computation
Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation
Theory of Cryptography, Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006, Proceedings
Is It Even Possible? On the Parallel Composition of Asynchronous MPC Protocols
The Parallel Reversible Pebbling Game: Analyzing the Post-quantum Security of iMHFs
Recursive Proof Composition from Accumulation Schemes
After-the-Fact Leakage in Public-Key Encryption
Multi-Client Verifiable Computation with Stronger Security Guarantees
On Black-Box Separations of Quantum Digital Signatures from Pseudorandom States
Does Privacy Require True Randomness?
CP-ABE for Circuits (and More) in the Symmetric Key Setting
On Secret Sharing Schemes, Matroids and Polymatroids
A Dichotomy for Local Small-Bias Generators
Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier?
Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model
Game Theoretic Notions of Fairness in Multi-party Coin Toss
Position-Based Cryptography and Multiparty Communication Complexity
Targeted Homomorphic Attribute-Based Encryption
From Non-adaptive to Adaptive Pseudorandom Functions
Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs
Private Approximation of Clustering and Vertex Cover
Fully-Succinct Publicly Verifiable Delegation from Constant-Size Assumptions
Predicate Encryption from Bilinear Maps and One-Sided Probabilistic Rank
Ideal Hierarchical Secret Sharing Schemes
SCALES - MPC with Small Clients and Larger Ephemeral Servers
Basing Weak Public-Key Cryptography on Strong One-Way Functions
Standard Security Does Imply Security Against Selective Opening for Markov Distributions
One-Time Programs from Commodity Hardware
Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008
Vector Commitments over Rings and Compressed $\varSigma $-Protocols
Lower Bounds in Differential Privacy
Efficient Information-Theoretic Secure Multiparty Computation over Z/p k Z via Galois Rings
Algebraically Structured LWE, Revisited
Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities
Mercurial Commitments: Minimal Assumptions and Efficient Constructions
Universally Composable $\varSigma $-protocols in the Global Random-Oracle Model