yusuke1997/dblp-id-title huggingface dataset:
Round-Optimal Black-Box Two-Party Computation
Reusable Non-Interactive Secure Computation
On Generating Solved Instances of Computational Problems
On the Linear Consistency Test (LCT) in Cryptanalysis with Applications
On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
A Public-Key Cryptosystem Based on the Matrix Cover NP-Complete Problem
Dishonest Majority Multi-Party Computation for Binary Circuits
More Flexible Exponentiation with Precomputation
Encryption Switching Protocols
Nondeterministic Cryptography
Fully Deniable Interactive Encryption
Public-Key Cryptosystems Resilient to Key Leakage
ømega (1/λ )-Rate Boolean Garbling Scheme from Generic Groups
Limits of Provable Security for Homomorphic Encryption
Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys
A Combinatorial Approach to Threshold Schemes
Security of a Keystream Cipher with Secret Initial Value
PicoGRAM: Practical Garbled RAM from Decisional Diffie-Hellman
High-Throughput Permissionless Blockchain Consensus Under Realistic Network Assumptions
Advances in Cryptology - CRYPTO '92, 12th Annual International Cryptology Conference, Santa Barbara, California, USA, August 16-20, 1992, Proceedings
At the Top of the Hypercube - Better Size-Time Tradeoffs for Hash-Based Signatures
An Efficient Divisible Electronic Cash Scheme
Security Mechanisms in Electronic Cards
A Message Authentication Code Based on Unimodular Matrix Groups
On the Round Complexity of Black-Box Secure MPC
Actively Secure MPC in the Dishonest Majority Setting: Achieving Constant Complexity in Online Communication, Computation Per Gate, Rounds, and Private Input Size
The PHOTON Family of Lightweight Hash Functions
Smaller Decoding Exponents: Ball-Collision Decoding
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
Round Efficient Secure Multiparty Quantum Computation with Identifiable Abort
New Multilinear Maps Over the Integers
Comparison of Three Modular Reduction Functions
Advances in Cryptology - CRYPTO 2017 - 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20-24, 2017, Proceedings, Part I
On Statistically Secure Obfuscation with Approximate Correctness
Ciphertext Only Attack for One-way Function of the MAP Using One Ciphertext
Concurrent Non-Malleable Commitments (and More) in 3 Rounds
One-way Sequence for Transaction Verification
Linear Complexity of Periodic Sequences: A General Theory
An Improved Algorithm for Arithmetic on a Family of Elliptic Curves
On the Practical CPA D Security of "exact" and Threshold FHE Schemes and Libraries
CORSAIR: A SMART Card for Public Key Cryptosystems
Adaptively Secure Constrained Pseudorandom Functions in the Standard Model
Unifying Leakage Models on a Rényi Day
Bitwise Garbling Schemes - A Model with 32λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\frac{3}{2}\lambda $$\end{document}-Bit Lower Bound of Ciphertexts
Provably Unforgeable Signatures
How to Reduce Your Enemy's Information (Extended Abstract)
A Cryptographic Scheme for Computerized Elections
Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions
Linicrypt: A Model for Practical Cryptography
Controlled Gradual Disclosure Schemes for Random Bits and Their Applications
Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs
Nonlinear Parity Circuits and their Cryptographic Applications
Low-Memory Attacks Against Two-Round Even-Mansour Using the 3-XOR Problem
Tri-State Circuits - A Circuit Model that Captures RAM
No Time to Hash: On Super-Efficient Entropy Accumulation
On the Concurrent Composition of Quantum Zero-Knowledge
Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN
State Machine Replication Among Strangers, Fast and Self-sufficient
Digital Signcryption or How to Achieve Cost(Signature & Encryption) << Cost(Signature) + Cost(Encryption)
Cryptanalysis of the Cellular Encryption Algorithm
An Efficient Existentially Unforgeable Signature Scheme and its Applications
Efficient Signature Schemes Based on Birational Permutations
On the Achievability of Simulation-Based Security for Functional Encryption
Generalized Secret Sharing and Monotone Functions
Quantum Commitments and Signatures Without One-Way Functions
Bounds in Shallows and in Miseries
Adaptively Sound Zero-Knowledge SNARKs for UP
Four-Round Concurrent Non-Malleable Commitments from One-Way Functions
One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption
Lattice-Based Succinct Arguments for NP with Polylogarithmic-Time Verification
Pseudo-signatures, Broadcast, and Multi-party Computation from Correlated Randomness
Tight Preimage Resistance of the Sponge Construction
Error Correction and Ciphertext Quantization in Lattice Cryptography
VLSI Implementation of Public-Key Encryption Algorithms
A New Approach to Round-Optimal Secure Multiparty Computation
On the Key Predistribution System: A Practical Solution to the Key Distribution Problem
Spooky Encryption and Its Applications
Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
Efficient Parallel Pseudo-Random Number Generation
Crowd-Blending Privacy
Cuckoo Hashing in Cryptography: Optimal Parameters, Robustness and Applications
Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part II
On Cryptographic Assumptions and Challenges
Exploring Decryption Failures of BIKE: New Class of Weak Keys and Key Recovery Attacks
How to Solve any Protocol Problem - An Efficiency Improvement
Low Communication 2-Prover Zero-Knowledge Proofs for NP
k-SUM in the Sparse Regime: Complexity and Applications
Time-Lock Puzzles from Lattices
Secret Distribution of Keys for Public-Key Systems
Time-Memory Tradeoff Attacks on the MTP Proof-of-Work Scheme
Unconditionally Secure Computation Against Low-Complexity Leakage
Match Me if You Can: Matchmaking Encryption and Its Applications
Predicate Encryption for Circuits from LWE
When Messages Are Keys: Is HMAC a Dual-PRF?
Resolving the Efficiency-Utility Dilemma of Threshold Linearly Homomorphic Encryption via Message-Space Adapter
Time-Stamping with Binary Linking Schemes
How to Share a Secret with Cheaters
TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption
Anonymous Tokens with Stronger Metadata Bit Hiding from Algebraic MACs
Improved Short Lattice Signatures in the Standard Model
A "Paradoxical'"Solution to the Signature Problem (Abstract)
Cryptography with Tamperable and Leaky Memory
Single-Shot Security for One-Time Memories in the Isolated Qubits Model
The Cryptanalysis of a New Public-Key Cryptosystem Based on Modular Knapsacks
Slide Reduction, Revisited - Filling the Gaps in SVP Approximation
Improving the Security of Quantum Protocols via Commit-and-Open
Random Oracle Reducibility
Leakage Certification Revisited: Bounding Model Errors in Side-Channel Security Evaluations
Breaking Iterated Knapsacks
Completeness Theorems for Adaptively Secure Broadcast
Fine-Grained Non-interactive Key-Exchange Without Idealized Assumptions
Quantum One-Time Protection of Any Randomized Algorithm
Raccoon: A Masking-Friendly Signature Proven in the Probing Model
Blockwise-Adaptive Attackers: Revisiting the (In)Security of Some Provably Secure Encryption Models: CBC, GEM, IACBC
Disposable Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash
Shift-Register Synthesis (Modula m)
THOMAS - A Complete Single Chip RSA Device
Lifetimes of Keys in Cryptographic Key Management Systems
A Chosen Text Attack on the RSA Cryptosystem and Some Discrete Logarithm Schemes
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
Hash Functions Based on Block Ciphers: A Synthetic Approach
On Succinct Arguments and Witness Encryption from Groups
Finding Short Integer Solutions When the Modulus Is Small
Abuse-Free Optimistic Contract Signing
Pseudorandomness Properties of Random Reversible Circuits
Cryptanalysis of the Gemmell and Naor Multiround Authentication Protocol
RSA/Rabin Least Significant Bits are 1/2 + 1/(poly(log N)) Secure
Hardness of k-LWE and Applications in Traitor Tracing
Generic MitM Attack Frameworks on Sponge Constructions
Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto '97
Breaking '128-bit Secure' Supersingular Binary Curves - (Or How to Solve Discrete Logarithms in F 2 4 1223 and F 2 12 367 )
Coin Flipping by Telephone
Advances in Cryptology - CRYPTO 2024 - 44th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2024, Proceedings, Part X
Collective Coin Tossing Without Assumptions nor Broadcasting
Efficiently Computing Data-Independent Memory-Hard Functions
A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security
MDx-MAC and Building Fast MACs from Hash Functions
Universal Composability from Essentially Any Trusted Setup
Polynomial Commitments from Lattices: Post-quantum Security, Fast Verification and Transparent Setup
Straight-Line Knowledge Extraction for Multi-Round Protocols
Unlocking Mix-Basis Potential: Geometric Approach for Combined Attacks
Amplifying the Security of Functional Encryption, Unconditionally
General Functional Bootstrapping Using CKKS
TreePIR: Sublinear-Time and Polylog-Bandwidth Private Information Retrieval from DDH
Alzette: A 64-Bit ARX-box - (Feat. CRAX and TRAX)
Key-Homomorphic Computations for RAM: Fully Succinct Randomised Encodings and More
Software Protection Using "Communal Key Cryptosystems"
Bi-Deniable Public-Key Encryption
Encryption Switching Protocols Revisited: Switching Modulo p
A Uniform Min-Max Theorem with Applications in Cryptography
Key Management from a Security Viewpoint
Tamper and Leakage Resilience in the Split-State Model
The Query-Complexity of Preprocessing Attacks
Higher-Order Differential Meet-in-the-middle Preimage Attacks on SHA-1 and BLAKE
Mac'n'Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions
Incremental Program Obfuscation
HyperNova: Recursive Arguments for Customizable Constraint Systems
Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'88
An Overview of Factoring
Cryptographic Extraction and Key Derivation: The HKDF Scheme
Merkle Puzzles in a Quantum World
A Subexponential-Time Algorithm for Computing Discrete Logarithms over GF(p²)
Memory Delegation
Authenticated BitGC for Actively Secure Rate-One 2PC
Secure Signature Schemes based on Interactive Protocols
Arbitration in Tamper Proof Systems
Parallel Hashing via List Recoverability
Breaking and Repairing GCM Security Proofs
Group Signatures with Almost-for-Free Revocation
How to Utilize the Randomness of Zero-Knowledge Proofs
Provable Security Against Decryption Failure Attacks from LWE
Equivalence Between Two Flavours of Oblivious Transfers
Extractors: Low Entropy Requirements Colliding with Non-malleability
An Improved Pseudo-random Generator Based on Discrete Log
Non-Existence of Homomorphic General Sharing Schemes for Some Key Spaces (Extended Abstract)
How to Recover the Full Plaintext of XCB
Stateless Evaluation of Pseudorandom Functions: Security beyond the Birthday Barrier
Efficient NIZKs and Signatures from Commit-and-Open Protocols in the QROM
Tight Characterizations for Preprocessing Against Cryptographic Salting
Known-Key Distinguisher on Full PRESENT
Explicit Rate-1 Non-malleable Codes for Local Tampering
Succinctly-Committing Authenticated Encryption
All-But-Many Lossy Trapdoor Functions and Selective Opening Chosen-Ciphertext Security from LWE
"Pseudo-Random" Number Generation Within Cryptographic Algorithms: The DDS Case
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
Practical Statistically-Sound Proofs of Exponentiation in Any Group
On Extractability of the KZG Family of Polynomial Commitment Schemes
Another View of the Division Property
A New ID-Based Key Sharing System
Precomputing Oblivious Transfer
Towards a White-Box Secure Fiat-Shamir Transformation
A Design Principle for Hash Functions
Leakage-Resilient Pseudorandom Functions and Side-Channel Attacks on Feistel Networks
Bounded Indistinguishability and the Complexity of Recovering Secrets
How to Prove Knowledge of Small Secrets
Hidden Cosets and Applications to Unclonable Cryptography
Secure Audio Teleconference
On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings
A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic
Random Probing Security: Verification, Composition, Expansion and New Constructions
Overloading the Nonce: Rugged PRPs, Nonce-Set AEAD, and Order-Resilient Channels
Cryptanalysis of the CFB Mode of the DES with a Reduced Number of Rounds
The Average Cycle Size of the Key Stream in Output Feedback Encipherment
Data Is a Stream: Security of Stream-Based Channels
Making Conditionally Secure Cryptosystems Unconditionally Abuse-Free in a General Context
Secure Computation Without Authentication
SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions
Scalable Multiparty Computation with Nearly Optimal Work and Resilience
Practical Cryptanalysis of iso/iec 9796-2 and emv Signatures
Fully, (Almost) Tightly Secure IBE and Dual System Groups
Iterative Characteristics of DES and s²-DES
A Larger Class of Cryptographic Boolean Functions via a Study of the Maiorana-McFarland Construction
Essential Algebraic Structure within the AES
Efficient Tree-Based Revocation in Groups of Low-State Devices
Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem
Identity-Based Cryptosystems and Signature Schemes
Quantum Complexity for Discrete Logarithms and Related Problems
Knapsack Public Key Cryptosystems and Diophantine Approximation
Sieve-in-the-Middle: Improved MITM Attacks
From Differential Cryptanalysis to Ciphertext-Only Attacks
Robust Non-interactive Zero Knowledge
XPX: Generalized Tweakable Even-Mansour with Improved Security Guarantees
Authenticating Pervasive Devices with Human Protocols
Dissection-BKW
Towards Permissionless Consensus in the Standard Model via Fine-Grained Complexity
Rate-1 Statistical Non-interactive Zero-Knowledge
Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part II
Factoring N = p r q for Large r
Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases
Key Management for Secure Electronic Funds Transfer in a Retail Environment
Generalized Birthday Arracks on Unbalanced Feistel Networks
Advances in Cryptology - CRYPTO 2016 - 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2016, Proceedings, Part III
A Simple Method for Generating and Sharing Pseudo-Random Functions, with Applications to Clipper-like Escrow Systems
Advances in Cryptology - CRYPTO 2025 - 45th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2025, Proceedings, Part VII
An Integrity Check Value Algorithm for Stream Ciphers
Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer
Message Authentication Codes from Unpredictable Block Ciphers
Advances in Cryptology - CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part II
Secure Communications over Insecure Channels Based on Short Authenticated Strings
Analysis of Certain Aspects of Output Feedback Mode
Network Oblivious Transfer
Simplified OAEP for the RSA and Rabin Functions
Arguments of Proximity - [Extended Abstract]
Lenstra's Factorization Method Based on Elliptic Curves
Laconic Oblivious Transfer and Its Applications
On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
Multi-party Homomorphic Secret Sharing and Sublinear MPC from Sparse LPN
Leakage-Resilient Symmetric Cryptography under Empirically Verifiable Assumptions
The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3
On the Plausibility of Fully Homomorphic Encryption for RAMs
Advances in Cryptology - CRYPTO 2024 - 44th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2024, Proceedings, Part VIII
Matrix Extensions of the RSA Algorithm
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
Threshold Schnorr with Stateless Deterministic Signing from Standard Assumptions
Standards for Data Security - A Change of Direction
Round-Optimal Secure Multi-Party Computation
Discussion of Adleman's Subexponential Algorithm for Computing Discrete Logarithms
More Efficient Isogeny Proofs of Knowledge via Canonical Modular Polynomials
An l-Span Generalized Secret Sharing Scheme
Differential Fault Attacks on Elliptic Curve Cryptosystems
Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
Mangrove: A Scalable Framework for Folding-Based SNARKs
Position Based Cryptography
Weakening Security Assumptions and Oblivious Transfer (Abstract)
Leakage Resilient Secret Sharing and Applications
Proofs of Replicated Storage Without Timing Assumptions
Cryptanalysis of Stream Ciphers with Linear Masking
Succinct PPRFs via Memory-Tight Reductions
On the Distribution of Linear Biases: Three Instructive Examples
Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge)
SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
Block Ciphers - Focus on the Linear Layer (feat. PRIDE)
How Should We Solve Search Problems Privately?
Non-malleable Codes from Two-Source Extractors
Hashing with SL_2
Trapdoor Functions from the Computational Diffie-Hellman Assumption
Lattice Signature with Efficient Protocols, Application to Anonymous Credentials
Use of the 'Signature Token' to Create a Negotiable Document
Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part III
Lattice Reduction with Approximate Enumeration Oracles - Practical Algorithms and Concrete Performance
Cryptanalysis of "2 R" Schemes
Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
The Generation of Cryptographically Strong Pseudo-Random Sequences
Universally Composable Relaxed Password Authenticated Key Exchange
Meet-in-the-Middle Attacks Revisited: Key-Recovery, Collision, and Preimage Attacks
A Simple Obfuscation Scheme for Pattern-Matching with Wildcards
Abstraction in Cryptography
A Forward-Secure Digital Signature Scheme
Limits on the Adaptive Security of Yao's Garbling
A Compressed $\varSigma $-Protocol Theory for Lattices
Physical Zero-Knowledge Proofs of Physical Properties
White Box Traitor Tracing
Optimizing Authenticated Garbling for Faster Secure Two-Party Computation
Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case
Multiparty Garbling from OT with Linear Scaling and RAM Support
The Hardness of the Hidden Subset Sum Problem and Its Cryptographic Implications
Payment Systems and Credential Mechanisms with Provable Security Against Abuse by Individuals
A Quadratic Sieve on the n-Dimensional Cube
sfZinc: Succinct Arguments with Small Arithmetization Overheads from IOPs of Proximity to the Integers
Fast Reduction of Algebraic Lattices over Cyclotomic Fields
An Attack on the Last Two Rounds of MD4
Analysis of the Security of the PSSI Problem and Cryptanalysis of the Durandal Signature Scheme
Tweakable Block Ciphers
Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs
How to Hash into Elliptic Curves
Cryptanalysis of RSA Signatures with Fixed-Pattern Padding
Yes, There is an Oblivious RAM Lower Bound!
A Framework for the Study of Cryptographic Protocols
Rounding in the Rings
On the Security of Multi-Party Ping-Pong Protocols
Efficient Algorithms for the Construction of Hyperelliptic Cryptosystems
Subtractive Sets over Cyclotomic Rings - Limits of Schnorr-Like Arguments over Lattices
Refined Attack on LWE with Hints: Constructing Lattice via Gaussian Elimination
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
Revisiting Post-quantum Fiat-Shamir
Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver
sfOPA: One-Shot Private Aggregation with Single Client Interaction and Its Applications to Federated Learning
Another Method for Attaining Security Against Adaptively Chosen Ciphertext Attacks
On the Communication Complexity of Secure Computation
Merkle-Hellman Revisited: A Cryptanalysis of the Qu-Vanstone Cryptosystem Based on Group Factorizations
Certifying Private Probabilistic Mechanisms
Bit Commitment Using Pseudo-Randomness
Practical Multilinear Maps over the Integers
Compact Structure-Preserving Signatures with Almost Tight Security
On Reverse-Engineering S-Boxes with Hidden Design Criteria or Structure
Anonymous Attestation with Subverted TPMs
The Bit Security of Modular Squaring Given Partial Factorization of the Modulos
Tight Leakage-Resilient CCA-Security from Quasi-Adaptive Hash Proof System
Pseudorandom Error-Correcting Codes
Anonymous Tokens with Private Metadata Bit
An Identity Escrow Scheme with Appointed Verifiers
Permutation Polynomials in RSA-Cryptosystems
SSE and SSD: Page-Efficient Searchable Symmetric Encryption
Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
A Logarithmic Lower Bound for Oblivious RAM (for All Parameters)
Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
Programmable Hash Functions and Their Applications
Multi-input Attribute Based Encryption and Predicate Encryption
Improving the Search Algorithm for the Best Linear Expression
Triangulating Rebound Attack on AES-like Hashing
Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems
Impossibility of Black-Box Simulation Against Leakage Attacks
Limits of Black-Box Anamorphic Encryption
Adaptively Secure BLS Threshold Signatures from DDH and co-CDH
Robust Multiparty Computation with Linear Communication Complexity
A Layered Approach to the Design of Private Key Cryptosystems
A Natural Taxonomy for Digital Information Authentication Schemes
SIGMA: The 'SIGn-and-MAc' Approach to Authenticated Diffie-Hellman and Its Use in the IKE-Protocols
Generic Transformation for Scalable Broadcast Encryption Schemes
Traceable Secret Sharing and Applications
Non-interactive Secure Multiparty Computation for Symmetric Functions, Revisited: More Efficient Constructions and Extensions
Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange
Constant Input Attribute Based (and Predicate) Encryption from Evasive and Tensor LWE
Generic and Algebraic Computation Models: When AGM Proofs Transfer to the GGM
Laconic Function Evaluation and ABE for RAMs from (Ring-)LWE
The IPS Compiler: Optimizations, Variants and Concrete Efficiency
On the Complexity of Compressing Obfuscation
Efficient Signature Schemes Based on Polynomial Equations
Progress in Data Security Standardization
Scalable Pseudorandom Quantum States
Fair Cryptosystems, Revisited: A Rigorous Approach to Key-Escrow (Extended Abstract)
Asymmetric Cryptography with a Hidden Monomial
How Easy is Collision Search. New Results and Applications to DES
On Linear Communication Complexity for (Maximally) Fluid MPC
Collision Resistance from Multi-collision Resistance for All Constant Parameters
Semi-quantum Tokenized Signatures
Round Optimal Blind Signatures
Quantum Key Distribution and String Oblivious Transfer in Noisy Channels
Traceable Verifiable Random Functions
Separability and Efficiency for Generic Group Signature Schemes
How to Use Bitcoin to Design Fair Protocols
Public-Key Registration
Generic Transformations of Predicate Encodings: Constructions and Applications
Quantum to Classical Randomness Extractors
Mitigating Dictionary Attacks on Password-Protected Local Storage