yusuke1997/dblp-id-title huggingface dataset:
Non-malleability Against Polynomial Tampering
Wyner's Analog Encryption Scheme: Results of a Simulation
Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization
Practical Problems with a Cryptographic Protection Scheme
Factoring Large Number with the TWIRL Device
ATLAS: Efficient and Scalable MPC in the Honest Majority Setting
Message-Locked Encryption for Lock-Dependent Messages
Fast Checkers for Cryptography
Lattice-Based Zero-Knowledge Arguments for Integer Relations
A Framework for Efficient and Composable Oblivious Transfer
Security for the DoD Transmission Control Protocol
Black-Box Constructions of Composable Protocols without Set-Up
Fast Spectral Tests for Measuring Nonrandomness and the DES
YOSO: You Only Speak Once - Secure MPC with Stateless Ephemeral Roles
Advances in Cryptology - CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16-20, 2021, Proceedings, Part I
The Smart Siskette - A Universal User Token and Personal Crypto-Engine
Multiparty Unconditionally Secure Protocols (Abstract)
Special Uses and Abuses of the Fiat-Shamir Passport Protocol
Incompressible Encodings
Advances in Cryptology - CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15-18, 2022, Proceedings, Part III
Maliciously Secure Massively Parallel Computation for All-but-One Corruptions
Visual Authentication and Identification
How Risky Is the Random-Oracle Model?
Crytanalysis of DES with a Reduced Number of Rounds: Sequences of Linear Factors in Block Ciphers
Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol
Keying Hash Functions for Message Authentication
Encrypted Davies-Meyer and Its Dual: Towards Optimal Security Using Mirror Theory
Leakage Certification Made Simple
Cryptography with One-Way Communication
Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result
Minimizing the Two-Round Even-Mansour Cipher
Aggregating Falcon Signatures with LaBRADOR
Differential Cryptanalysis in the Fixed-Key Model
Secret Sharing Over Infinite Domains (Extended Abstract)
New Bounds on the Local Leakage Resilience of Shamir's Secret Sharing Scheme
Memory-Sample Lower Bounds for LWE
On the Round Complexity of OT Extension
Cryptography with Weights: MPC, Encryption and Signatures
Synchronous, with a Chance of Partition Tolerance
Security Amplification by Composition: The Case of Doubly-Iterated, Ideal Ciphers
Indifferentiability of Iterated Even-Mansour Ciphers with Non-idealized Key-Schedules: Five Rounds Are Necessary and Sufficient
Symmetric Primitives with Structured Secrets
Accelerating SLH-DSA by Two Orders of Magnitude with a Single Hash Unit
Extending Oblivious Transfers Efficiently
MuSig-L: Lattice-Based Multi-signature with Single-Round Online Phase
A Public Key Cryptosystem Based on the Word Problem
Correcting Subverted Random Oracles
SQUARE HASH: Fast Message Authenication via Optimized Universal Hash Functions
Distinguisher-Dependent Simulation in Two Rounds and its Applications
Advances in Cryptology - CRYPTO 2011 - 31st Annual Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2011. Proceedings
Secure Computation with Minimal Interaction, Revisited
On Virtual Grey Box Obfuscation for General Circuits
Sometimes-Decryptable Homomorphic Encryption from Sub-exponential DDH
The FEAL Cipher Family
On Secure Multi-party Computation in Black-Box Groups
On Active Attack Detection in Messaging with Immediate Decryption
Foundations of Platform-Assisted Auctions
Semantic Security and Indistinguishability in the Quantum World
A 2^70 Attack on the Full MISTY1
HERMES: Efficient Ring Packing Using MLWE Ciphertexts and Application to Transciphering
Succinct Arguments for RAM Programs via Projection Codes
Tight State-Restoration Soundness in the Algebraic Group Model
Revisiting the Security of DbHtS MACs: Beyond-Birthday-Bound in the Multi-user Setting
Advances in Cryptology - CRYPTO 2005: 25th Annual International Cryptology Conference, Santa Barbara, California, USA, August 14-18, 2005, Proceedings
Fast Secure Two-Party ECDSA Signing
From Laconic Zero-Knowledge to Public-Key Cryptography - Extended Abstract
Functional Encryption for Turing Machines with Dynamic Bounded Collusion from LWE
Sequence Complexity as a Test for Cryptographic Systems
More Efficient Zero-Knowledge Protocols over $\mathbb {Z}_{2^k}$ via Galois Rings
A Systematic Study of Sparse LWE
RSA Bits are 732+epsilon Secure
Limits on the Power of Garbling Techniques for Public-Key Encryption
Short Group Signatures
Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
Is DES a Pure Cipher? (Results of More Cycling Experiments on DES)
Non-Interactive Zero-Knowledge with Preprocessing
Towards Faster Polynomial-Time Lattice Reduction
Analytical Characteristics of the DES
Comparison of Two Pseudo-Random Number Generators
The Algebraic One-More MISIS Problem and Applications to Threshold Signatures
Advances in Cryptology - CRYPTO 2024 - 44th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2024, Proceedings, Part V
Some Regular Properties of the 'Data Encryption Standard' Algorithm
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
Lower and Upper Bounds on Obtaining History Independence
Simple and Efficient Shuffling with Provable Correctness and ZK Privacy
Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions
How to Compute under ${\cal{AC}}^{\sf0}$ Leakage without Secure Hardware
Finding Collisions in the Full SHA-1
Quantum Cryptography, or Unforgeable Subway Tokens
Cryptanalysis of Full Sprout
A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation
Information-Theoretic Cryptography
Incrementally Verifiable Computation for NP from Standard Assumptions
Rerandomizable RCCA Encryption
Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms
Round-Optimal Secure Multiparty Computation with Honest Majority
Multiparty Protocols Tolerating Half Faulty Processors
An Algebraic Framework for Universal and Updatable SNARKs
Linear Cryptanalysis of FF3-1 and FEA
Unbounded Distributed Broadcast Encryption and Registered ABE from Succinct LWE
A New Simple Technique to Bootstrap Various Lattice Zero-Knowledge Proofs to QROM Secure NIZKs
Multi-instance Security and Its Application to Password-Based Cryptography
Faster Homomorphic Linear Transformations in HElib
Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part III
On the Construction of Perfect Authentication Codes that Permit Arbitration
i -Hop Homomorphic Encryption and Rerandomizable Yao Circuits
A Tweakable Enciphering Mode
Position-Based Quantum Cryptography: Impossibility and Constructions
Access Control at the Netherlands Postal and Telecommunications Services
Adaptively Secure Multi-Party Computation with Dishonest Majority
Pseudorandomness from Braid Groups
Relational Hash: Probabilistic Hash for Verifying Relations, Secure Against Forgery and More
One Way Hash Functions and DES
Finding Four Million Large Random Primes
Non-interactive Zero-Knowledge Arguments for QMA, with Preprocessing
The REDOC II Cryptosystem
Ring Signatures for Deniable AKEM: Gandalf's Fellowship
Time-Memory-Processor Tradeoffs
On Tight Quantum Security of HMAC and NMAC in the Quantum Random Oracle Model
Everything Provable is Provable in Zero-Knowledge
Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free?
The Shrinking Generator
On Witness Encryption and Laconic Zero-Knowledge Arguments
Message Transmission with Reverse Firewalls - Secure Communication on Corrupted Machines
Secure Computation from Leaky Correlated Randomness
Improved Bounds on Security Reductions for Discrete Log Based Signatures
A Fully-Adaptive Threshold Partially-Oblivious PRF
Practical Sublinear Proofs for R1CS from Lattices
Topology-Hiding Computation on All Graphs
Cryptanalytic Extraction of Neural Network Models
Private Circuits: A Modular Approach
Coding Constructions for Blacklisting Problems without Computational Assumptions
CM-Curves with Good Cryptographic Properties
A New Variant of PMAC: Beyond the Birthday Bound
A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator
Self Protecting Pirates and Black-Box Traitor Tracing
On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
Private Searching on Streaming Data
10-Party Sublinear Secure Computation from Standard Assumptions
Asymptotically Optimal Adaptive Asynchronous Common Coin and DKG with Silent Setup
Cryptanalysis of ADFGVX Encipherment Systems (Extended Abstract)
(Hierarchical) Identity-Based Encryption from Affine Message Authentication
Sustained Space and Cumulative Complexity Trade-Offs for Data-Dependent Memory-Hard Functions
Computational Hardness of Optimal Fair Computation: Beyond Minicrypt
On the Security of RSA Padding
Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring
Fluid MPC: Secure Multiparty Computation with Dynamic Participants
PI-Cut-Choo and Friends: Compact Blind Signatures via Parallel Instance Cut-and-Choose and More
Protocols for Multiparty Coin Toss with Dishonest Majority
On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem
Correcting Errors in RSA Private Keys
The Random Oracle Model and the Ideal Cipher Model Are Equivalent
The Collision Security of Tandem-DM in the Ideal Cipher Model
The Conditional Correlation Attack: A Practical Attack on Bluetooth Encryption
Structure vs. Hardness Through the Obfuscation Lens
Constant-Round Arguments for Batch-Verification and Bounded-Space Computations from One-Way Functions
Codes for Interactive Authentication
Automatic Verification of Differential Characteristics: Application to Reduced Gimli
Large Message Homomorphic Secret Sharing from DCR and Applications
On the Exact Round Complexity of Secure Three-Party Computation
Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More
A Generalized Birthday Problem
Parallel Repetition of (k 1, đots , k μ )-Special-Sound Multi-round Interactive Proofs
Unconditionally Secure Authentication Schemes and Practical and Theoretical Consequences
Designing and Detecting Trapdoors for Discrete Log Cryptosystems
Receiver-Anonymity in Rerandomizable RCCA-Secure Cryptosystems Resolved
On Defining Proofs of Knowledge
Two-Party ECDSA from Hash Proof Systems and Efficient Instantiations
Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets
Improved Algorithms for Finding Fixed-Degree Isogenies Between Supersingular Elliptic Curves
When Random Sampling Preserves Privacy
Inferring a Sequence Produced by a Linear Congruence
Fast Correlation Attacks through Reconstruction of Linear Polynomials
Secure Protocol Transformations
Better than Advertised Security for Non-interactive Threshold Signatures
On the Security of DES
Truncated Differentials and Skipjack
Efficient, Perfect Random Number Generators
Non-interactive Zero-Knowledge from Non-interactive Batch Arguments
On the Unpredictability of Bits of the Elliptic Curve Diffie--Hellman Scheme
Efficient Randomized Strong 2-Source Non-malleable Extractor for Any Linear Min-Entropy
A Tight High-Order Entropic Quantum Uncertainty Relation with Applications
Efficient Digital Public-Key Signature with Shadow (Abstract)
Reverse Firewalls for Actively Secure MPCs
Secret Sharing with Certified Deletion
Smart Card, a Highly Reliable and Portable Security Device
Weak Instances of Class Group Action Based Cryptography via Self-pairings
On the Impossibility of Efficiently Combining Collision Resistant Hash Functions
A New Approach to Efficient Non-Malleable Zero-Knowledge
Compressing Unit-Vector Correlations via Sparse Pseudorandom Generators
Seedless Fruit Is the Sweetest: Random Number Generation, Revisited
Unconditional Security Against Memory-Bounded Adversaries
Hidden Collisions on DSS
Public-Key Systems Based on the Difficulty of Tampering (Is There a Difference Between DES and RSA?)
Non-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization
Cryptanalysis of the Ajtai-Dwork Cryptosystem
Continuous Group-Key Agreement: Concurrent Updates Without Pruning
Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security
An Efficient Digital Signature Scheme Based on an Elliptic Curve Over the Ring Z n
Integral Resistance of Block Ciphers with Key Whitening by Modular Addition
Advances in Cryptology - CRYPTO 2016 - 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2016, Proceedings, Part I
Space-Efficient and Noise-Robust Quantum Factoring
A Statistical Attack of the FEAL-8 Cryptosystem
A New Paradigm of Hybrid Encryption Scheme
Kurosawa-Desmedt Meets Tight Security
Efficient Collision Attack Frameworks for RIPEMD-160
Proof-Carrying Data Without Succinct Arguments
Gossiping for Communication-Efficient Broadcast
Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S
Identity Escrow
Compact Lattice Gadget and Its Applications to Hash-and-Sign Signatures
Minimal Complete Primitives for Secure Multi-party Computation
Key-Recovery Attack on the ASASA Cryptosystem with Expanding S-Boxes
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
Advances in Cryptology - CRYPTO 2025 - 45th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2025, Proceedings, Part VIII
New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure Computation
Composition with Knowledge Assumptions
PoW-Based Distributed Cryptography with No Trusted Setup
Smoothing Out Binary Linear Codes and Worst-Case Sub-exponential Hardness for LPN
How To Break and Repair A "Provably Secure" Untraceable Payment System
Towards a Design Procedure for Cryptosecure Substitution Boxes
A Video Scrambling Technique Based On Space Filling Curves
On Computing Logarithms Over Finite Fields
Other Cycling Tests for DES (Abstract)
Privacy with Imperfect Randomness
Leakage-Resilient Zero Knowledge
Authenticated and Misuse-Resistant Encryption of Key-Dependent Data
On Message Proof Systems with Known Space Verifiers
Prouff and Rivain's Formal Security Proof of Masking, Revisited - Tight Bounds in the Noisy Leakage Model
The Detection of Cheaters in Threshold Schemes
Multi-Holder Anonymous Credentials from BBS Signatures
Generalization of Siegenthaler Inequality and Schnorr-Vaudenay Multipermutations
Authenticated Key Exchange and Signatures with Tight Security in the Standard Model
Advances in Cryptology - CRYPTO 2007, 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007, Proceedings
Security of Iterated Hash Functions Based on Block Ciphers
Cryptanalysis of the GOST Hash Function
Lattice-Based Timed Cryptography
Optimal Security Reductions for Unique Signatures: Bypassing Impossibilities with a Counterexample
Advances in Cryptology - CRYPTO 2001, 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19-23, 2001, Proceedings
Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields
Advances in Cryptology - CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15-18, 2022, Proceedings, Part II
Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-Bounds, and Separations
New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques
Provably Weak Instances of Ring-LWE
On Round Optimal Statistical Zero Knowledge Arguments
Generalized Linear Threshold Scheme
Black-Box (and Fast) Non-malleable Zero Knowledge
Randomized Encryption Techniques
Fast and Secure Updatable Encryption
Scalable Zero Knowledge with No Trusted Setup
A Non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge
Algebraic Decomposition for Probing Security
Big-Key Symmetric Encryption: Resisting Key Exfiltration
Escrow Encryption Systems Visited: Attacks, Analysis and Designs
Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes
Nonlinearly Balanced Boolean Functions and Their Propagation Characteristics (Extended Abstract)
Uniform Black-Box Separations via Non-malleable Extractors
Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
Untraceable Off-line Cash in Wallets with Observers (Extended Abstract)
Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts
Hiding Instances in Zero-Knowledge Proof Systems (Extended Abstract)
Random Self-reducibility of Ideal-SVP via Arakelov Random Walks
Producing a One-Way Hash Function from DES
A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness
Computation of Discrete Logarithms in Prime Fields (Extended Abstract)
Horst Meets Fluid-SPN: Griffin for Zero-Knowledge Applications
Partially-Bent Functions
Universal Hashing and Authentication Codes
Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes
Thinking Outside the Superbox
Advances in Cryptology - CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20-24, 2023, Proceedings, Part I
Indifferentiability for Public Key Cryptosystems
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
Efficient Anonymous Multicast and Reception (Extended Abstract)
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
Security-Related Comments Regarding McEliece's Public-Key Cryptosystem
Nonlinearity Bounds and Constructions of Resilient Boolean Functions
On the Communication Required for Unconditionally Secure Multiplication
New Constructions of Collapsing Hashes
OAEP Reconsidered
Augmented Random Oracles
Multiparty Computation from Somewhat Homomorphic Encryption
Fast Key Exchange with Elliptic Curve Systems
A Modification of a Broken Public-Key Cipher
How to Meet Ternary LWE Keys
Quantum Public-Key Encryption with Tamper-Resilient Public Keys from One-Way Functions
How to Make Replicated Data Secure
Deniable Ring Authentication
Must the Communication Graph of MPC Protocols be an Expander?
New Public-Key Schemes Based on Elliptic Curves over the Ring Z n
Error Floor Prediction with Markov Models for QC-MDPC Codes
Rationality and Adversarial Behavior in Multi-party Computation
On the Adaptive Security of FROST
Universally-Composable Two-Party Computation in Two Rounds
Secure Wire Shuffling in the Probing Model
Feasibility and Infeasibility of Secure Computation with Malicious PUFs
Quantum Lattice Enumeration in Limited Depth
Unifying Freedom and Separation for Tight Probing-Secure Composition
Non-Malleable Codes for Space-Bounded Tampering
Attribute-Based Multi-input FE (and More) for Attribute-Weighted Sums
Structure in the S-boxes of the DES
Network-Agnostic Security Comes (Almost) for Free in DKG and MPC
Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
Row Reduction Techniques for n-Party Garbling
On Strong Simulation and Composable Point Obfuscation
New Partial Key Exposure Attacks on RSA
On the McEliece Public-Key Cryptosystem
Automatic Search of Meet-in-the-Middle and Impossible Differential Attacks
Efficient Algorithms for Elliptic Curve Cryptosystems
Oblivious Key-Value Stores and Amplification for Private Set Intersection
How to (Really) Share a Secret
Quantum Bit Commitment and Coin Tossing Protocols
Advances in Cryptology - CRYPTO '98, 18th Annual International Cryptology Conference, Santa Barbara, California, USA, August 23-27, 1998, Proceedings
Quantum Public-Key Cryptosystems
Weaknesses in the SL 2 (IF s 2 ) Hashing Scheme
Fair Public-Key Cryptosystems
Building PRFs from PRPs
Consolidating Masking Schemes
Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes
Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography
A Prototype Encryption System Using Public Key
Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming
Non-malleable Secret Sharing for General Access Structures
Public-Coin 3-Round Zero-Knowledge from Learning with Errors and Keyless Multi-Collision-Resistant Hash
Breaking Verifiable Delay Functions in the Random Oracle Model
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
The Design and Analysis of Cryptographic Protocols
Functional Encryption: New Perspectives and Lower Bounds
The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing
Distributions Attaining Secret Key at a Rate of the Conditional Mutual Information
The Iterated Random Permutation Problem with Applications to Cascade Encryption
Unmasking TRaccoon: A Lattice-Based Threshold Signature with An Efficient Identifiable Abort Protocol
On the Security of the TLS Protocol: A Systematic Analysis
How to Eat Your Entropy and Have It Too - Optimal Recovery Strategies for Compromised RNGs
Quantum Attacks Against Indistinguishablility Obfuscators Proved Secure in the Weak Multilinear Map Model
All-But-Many Lossy Trapdoor Functions from Lattices and Applications
Compact Key Storage - A Modern Approach to Key Backup and Delegation
Breaking the FF3 Format-Preserving Encryption Standard over Small Domains
Cloning Games: A General Framework for Unclonable Primitives
Improved OT Extension for Transferring Short Secrets
Succinct Interactive Oracle Proofs: Applications and Limitations
Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability - (or: Quadratic Residuosity Strikes Back)
Everlasting Multi-party Computation
The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC
Keying the German Navy's Enigma
Integrating Cryptography in ISDN
Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms
A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem
Compressed $\varSigma $-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics
Attribute Based Encryption (and more) for Nondeterministic Finite Automata from LWE
On Concrete Security Treatment of Signatures Derived from Identification
Solving Low Density Knapsacks
A Formal Treatment of Onion Routing
Exploring the Advantages and Challenges of Fermat NTT in FHE Acceleration
Limits of Practical Sublinear Secure Computation
Secure Database Commitments and Universal Arguments of Quasi Knowledge
Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time
DualRing: Generic Construction of Ring Signatures with Efficient Instantiations
Simplified MITM Modeling for Permutations: New (Quantum) Attacks
The Import/Export Dilemma
Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES
Cryptography with Certified Deletion
Verifiable Registration-Based Encryption
Formal Security Proofs via Doeblin Coefficients: - Optimal Side-Channel Factorization from Noisy Leakage to Random Probing
All-or-Nothing Disclosure of Secrets
Provably Secure Steganography
Individual Cryptography
Polytopes in the Fiat-Shamir with Aborts Paradigm
Quantum Homomorphic Encryption for Polynomial-Sized Circuits
Revisiting Time-Space Tradeoffs for Function Inversion
Risky Traitor Tracing and New Differential Privacy Negative Results
The Price of Low Communication in Secure Multi-party Computation
Statistically Sender-Private OT from LPN and Derandomization
How to Predict Congruential Generators
An Optimal Distributed Discrete Log Protocol with Applications to Homomorphic Secret Sharing
One-Message Secure Reductions: On the Cost of Converting Correlations
Some Variations on RSA Signatures and Their Security
Unconditional Characterizations of Non-interactive Zero-Knowledge
On Optimal Tightness for Key Exchange with Full Forward Secrecy via Key Confirmation
Watermarking PRFs from Lattices: Stronger Security via Extractable PRFs
Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation
On Struik-Tilburg Cryptanalysis of Rao-Nam Scheme
A Recursive Construction Method of S-boxes Satisfying Strict Avalanche Criterion