yusuke1997/dblp-id-title huggingface dataset:
A Formal Analysis of Prefetching in Profiled Cache-Timing Attacks on Block Ciphers
Wildcarded Identity-Based Encryption
The Weil Pairing, and Its Efficient Calculation
On the Classification of Ideal Secret Sharing Schemes
The Combinatorics of Authentication and Secrecy Codes
An Efficient Existentially Unforgeable Signature Scheme and Its Applications
A Probable Prime Test with Very High Confidence for n L 3 mod 4
Secure Hardware Implementation of Nonlinear Functions in the Presence of Glitches
Parallel Collision Search with Cryptanalytic Applications
Efficient Fully Structure-Preserving Signatures and Shrinking Commitments
Two-Key Triple Encryption
Resource Requirements of Private Quantum Channels and Consequences for Oblivious Remote State Preparation
Key Processing with Control Vectors
SwiftEC: Shallue-van de Woestijne Indifferentiable Function To Elliptic Curves
Optimal Randomizer Efficiency in the Bounded-Storage Model
The Deoxys AEAD Family
Limits on the Efficiency of (Ring) LWE-Based Non-interactive Key Exchange
On the Relationships between Notions of Simulation-Based Security
Faster Homomorphic Operations and Beyond: Expediting Homomorphic Computation via Boolean Circuit Optimization
On Polynomial Approximation of the Discrete Logarithm and the Diffie - Hellman Mapping
Efficient Cryptosystems From 2 k -th Power Residue Symbols
Bucket Hashing and Its Application to Fast Message Authentication
Zeromorph: Zero-Knowledge Multilinear-Evaluation Proofs from Homomorphic Univariate Commitments
The Impossibility of Basing One-Way Permutations on Central Cryptographic Primitives
Decomposing Attacks on Asymmetric Cryptography Based on Mapping Compositions
Multiple Assignment Scheme for Sharing Secret
Cryptanalysis of an E0-like Combiner with Memory
Almost k-Wise Independent Sample Spaces and Their Cryptologic Applications
Cryptanalysis of ISO/IEC 9796-1
Efficient Amplification of the Security of Weak Pseudo-Random Function Generators
An Analysis of the Blockcipher-Based Hash Functions from PGV
Modifications to the Number Field Sieve
Fast Correlation Attacks on the Summation Generator
Photonic Side-Channel Analysis of Arbiter PUFs
Bit Commitment Using Pseudorandomness
Key Recovery Attacks on Iterated Even-Mansour Encryption Schemes
Dynamic Traitor Tracing
Constructive and Destructive Use of Compilers in Elliptic Curve Cryptography
Symmetric and Dual PRFs from Standard Assumptions: A Generic Validation of a Prevailing Assumption
Elliptic Curve Cryptosystems over Small Fields of Odd Characteristic
Signature Schemes Secure Against Hard-to-Invert Leakage
Structural Attacks for Public Key Cryptosystems based on Gabidulin Codes
Concurrent Knowledge Extraction in Public-Key Models
Bootstrapping for BGV and BFV Revisited
Accurate Score Prediction for Dual-Sieve Attacks
Compact Designated Verifier NIZKs from the CDH Assumption Without Pairings
A Simpler Construction of CCA2-Secure Public-KeyEncryption under General Assumptions
Succinct Non-Interactive Arguments via Linear Interactive Proofs
Generic Attacks on Hash Combiners
Proof of Soundness (Integrity) of Cryptographic Protocols
Statistical Concurrent Non-Malleable Zero-Knowledge from One-Way Functions
How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction
Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ
CBC MAC for Real-Time Data Sources
Natively Compatible Super-Efficient Lookup Arguments and How to Apply Them
A New Linear Distinguisher for Four-Round AES
An Analysis of SAFER
Fully Secure Functional Encryption with a Large Class of Relations from the Decisional Linear Assumption
Efficient Signature Generation by Smart Cards
Multidimensional Linear Cryptanalysis
No-Signaling Linear PCPs
Algebraic Properties of Cryptosystem PGM
A Taxonomy of Pairing-Friendly Elliptic Curves
Fault-Based Attack on Montgomery's Ladder Algorithm
A Uniform-Complexity Treatment of Encryption and Zero-Knowledge
Information-Theoretic Bounds for Authentication Codes and Block Designs
Nonlinear Invariant Attack: Practical Attack on Full SCREAM, iSCREAM, and Midori64
Accelerating Pollard's Rho Algorithm on Finite Fields
Beyond the Csiszár-Körner Bound: Best-Possible Wiretap Coding via Obfuscation
Non-commutative Ring Learning with Errors from Cyclic Algebras
Kummer for Genus One Over Prime-Order Fields
Leakage Resilience from Program Obfuscation
A Proof of Security of Yao's Protocol for Two-Party Computation
The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability
An Efficient and Generic Construction for Signal's Handshake (X3DH): Post-quantum, State Leakage Secure, and Deniable
Secure Classical Bit Commitment Using Fixed Capacity Communication Channels
Correction: Locally Computable UOWHF with Linear Shrinkage
Certifying Permutations: Noninteractive Zero-Knowledge Based on Any Trapdoor Permutation
Attacks on Block Ciphers of Low Algebraic Degree
Bounds for Key Distribution Patterns
Generating Random Factored Numbers, Easily
Protecting Distributed Primitives Against Leakage: Equivocal Secret Sharing and more
Attacks on Fast Double Block Length Hash Functions
High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer
Theoretical Cryptanalysis of the Klimov-Shamir Number Generator TF-1
SLAP: Simpler, Improved Private Stream Aggregation from Ring Learning with Errors
Reproducible Circularly Secure Bit Encryption: Applications and Realizations
Inferring Sequences Produced by a Linear Congruential Generator Missing Low-Order Bits
Divertible and Subliminal-Free Zero-Knowledge Proofs for Languages
A Structural Comparison of the Computational Difficulty of Breaking Discrete Log Cryptosystems
A New and Improved Paradigm for Hybrid Encryption Secure Against Chosen-Ciphertext Attack
Trading Help for Interaction in Statistical Zero-Knowledge Proofs
Decentralized Multi-authority ABE for sfNC 1 from BDH
Probabilistic Reliability and Privacy of Communication Using Multicast in General Neighbor Networks
How to Stretch Random Functions: The Security of Protected Counter Sums
Correction to: Unconditionally Secure Computation Against Low-Complexity Leakage
Glitch and Laser Fault Attacks onto a Secure AES Implementation on a SRAM-Based FPGA
Trapdoor Hard-to-Invert Group Isomorphisms and Their Application to Password-Based Authentication
On the Hardness of Module Learning with Errors with Short Distributions
Robust Multi-Property Combiners for Hash Functions
Using Abelian Varieties to Improve Pairing-Based Cryptography
On the Structure of the Privacy Hierarchy
Polynomial-Time Solutions of Computational Problems in Noncommutative-Algebraic Cryptography
Efficient Quantum Key Distribution Scheme and a Proof of Its Unconditional Security
Enhancements of Trapdoor Permutations
Reconciling Non-malleability with Homomorphic Encryption
New Types of Cryptanalytic Attacks Using Related Keys
Concurrent Composition of Secure Protocols in the Timing Model
PCPs and the Hardness of Generating Synthetic Data
A Design of a Fast Pipelined Modular Multiplier Based on a Diminished-Radix Algorithm
Security Arguments for Digital Signatures and Blind Signatures
A Cubic RSA Code Equivalent to Factorization
Breaking the $O(\sqrt{n})$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party
Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves ,
Characterization of Security Notions for Probabilistic Private-Key Encryption
Obfuscating Circuits Via Composite-Order Graded Encoding
Paillier's Trapdoor Function Hides up to O ( n ) Bits
Non-Malleable Functions and their Applications
Player Simulation and General Adversary Structures in Perfect Multiparty Computation
How to Construct Constant-Round Zero-Knowledge Proof Systems for NP
A Theoretical Framework for the Analysis of Physical Unclonable Function Interfaces and Its Relation to the Random Oracle Model
Secure Multiparty Protocols and Zero-Knowledge Proof Systems Tolerating a Faulty Minority
The Number of Almost Perfect Nonlinear Functions Grows Exponentially
Manticore: A Framework for Efficient Multiparty Computation Supporting Real Number and Boolean Arithmetic
A Fast Software One-Way Hash Function
Encryption against Storage-Bounded Adversaries from On-Line Strong Extractors
Provable Security Against a Differential Attack
Perfectly Balanced Boolean Functions and Golić Conjecture
Confined Guessing: New Signatures From Standard Assumptions
Key Establishment à la Merkle in a Quantum World
Constructive and Destructive Facets of Weil Descent on Elliptic Curves
Secret-Sharing Schemes for Very Dense Graphs
On-Line/Off-Line Digital Signatures
Lattice Enumeration and Automorphisms for Tower NFS: A 521-Bit Discrete Logarithm Computation
On d -Multiplicative Secret Sharing
Secure Circuit Evaluation
A Comparison of Cryptanalytic Tradeoff Algorithms
The Complexity of Certain Multi-Exponentiation Techniques in Cryptography
Public-Coin Parallel Zero-Knowledge for NP
A Key-Exchange Protocol Using Real Quadratic Fields
Compact Proofs of Partial Knowledge for Overlapping CNF Formulae
Improved Ring Oscillator PUF: An FPGA-friendly Secure Primitive
New Binding-Concealing Trade-Offs for Quantum String Commitment
Randomness versus Fault-Tolerance
Actively Secure Half-Gates with Minimum Overhead under Duplex Networks
Binary Sequences Derived from ML-Sequences over Rings, I: Periods of Minimal Polynomials
On the Security of Oscillator-Based Random Number Generators
Revisiting Mutual Information Analysis: Multidimensionality, Neural Estimation and Optimality Proofs
On the Communication Efficiency of Statistically Secure Asynchronous MPC with Optimal Resilience
White-Box Cryptography: Don't Forget About Grey-Box Attacks
On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions
Minimizing Locality of One-Way Functions via Semi-private Randomized Encodings
On the Construction of Pseudorandom Permutations: Luby-Rackoff Revisited
Non-interactive Timestamping in the Bounded-Storage Model
Making the Impossible Possible
An L (1/3) Discrete Logarithm Algorithm for Low Degree Curves
Separating Decision Diffie-Hellman from Computational Diffie-Hellman in Cryptographic Groups
Revisiting the Wrong-Key-Randomization Hypothesis
Key-Minimal Crytosystems for Unconditional Secrecy
Rotational Differential-Linear Cryptanalysis Revisited
Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model
Entropy Computation for Oscillator-based Physical Random Number Generators
Efficient Succinct Zero-Knowledge Arguments in the CL Framework
Tag-KEM/DEM: A New Framework for Hybrid Encryption
Dynamic Proofs of Retrievability Via Oblivious RAM
On-line Ciphers and the Hash-CBC Constructions
A Weak Cipher that Generates the Symmetric Group
Efficient Set Intersection with Simulation-Based Security
Side-Channel Resistant Crypto for Less than 2, 300 GE
Three System for Cryptographic Protocol Analysis
New Approaches for Deniable Authentication
On the Complexity of Constructing Pseudorandom Functions (Especially when They Don't Exist)
Efficient Dissection of Bicomposite Problems with Cryptanalytic Applications
Joint State Composition Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation
Mutually Trusted Authority-Free Secret Sharing Schemes
Efficient, Perfect Polynomial Random Number Generators
Continuously Non-malleable Codes in the Split-State Model
Correction to: A Complete Analysis of the BKZ Lattice Reduction Algorithm
A Discrete Logarithm Implementation of Perfect Zero-Knowledge Blobs
Efficient Arithmetic in Finite Field Extensions with Application in Elliptic Curve Cryptography
Secure Computation of the Median (and Other Elements of Specified Ranks)
Almost-Everywhere Secure Computation with Edge Corruptions
On Key Storage in Secure Networks
Definitions and Properties of Zero-Knowledge Proof Systems
Hyperelliptic Cryptosystems
Multi-theorem Preprocessing NIZKs from Lattices
Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters
New Bounds and Constructions for Authentication/Secrecy Codes with Splitting
On Matroid Characterization of Ideal Secret Sharing Schemes
Constructing Pseudo-Random Permutations with a Prescribed Structure
Modeling for Three-Subset Division Property without Unknown Subset
Quantum Private Information Retrieval has Linear Communication Complexity
Robust Channels: Handling Unreliable Networks in the Record Layers of QUIC and DTLS 1.3
Edit Probability Correlation Attacks on Stop/ Go Clocked Keystream Generators
Slender-Set Differential Cryptanalysis
A Note on Constant-Round Zero-Knowledge Proofs of Knowledge
Kangaroos, Monopoly and Discrete Logarithms
Index Calculus in Class Groups of Non-hyperelliptic Curves of Genus Three
Practical Homomorphic Message Authenticators for Arithmetic Circuits
The ℚ-curve Construction for Endomorphism-Accelerated Elliptic Curves
Efficient Selective Identity-Based Encryption Without Random Oracles
Maximum Correlation Analysis of Nonlinear Combining Functions in Stream Ciphers
Two-Round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattices
Feedback Shift Registers, 2-Adic Span, and Combiners with Memory
New Attacks on IDEA with at Least 6 Rounds
Parameter Optimization and Larger Precision for (T)FHE
On Decompositions of Permutations in Quadratic Functions
Low Bandwidth Dynamic Traitor Tracing Schemes
Short Signatures from Diffie-Hellman: Realizing Almost Compact Public Key
Partial Key Recovery Attack Against RMAC
Necessary and Sufficient Condtions for Collision-Free Hashing
Watermarking PRFs and PKE Against Quantum Adversaries
Nearly One-Sided Tests and the Goldreich?Levin Predicate
Completeness for Symmetric Two-Party Functionalities: Revisited
A Fast Diffie-Hellman Protocol in Genus 2
Improved Combinatorial Algorithms for the Inhomogeneous Short Integer Solution Problem
Deterministic Encryption with the Thorp Shuffle
Design Methodology and Validity Verification for a Reactive Countermeasure Against EM Attacks
Sequential Aggregate Signatures, Multisignatures, and Verifiably Encrypted Signatures Without Random Oracles
Ceno: Non-uniform, Segment and Parallel Zero-Knowledge Virtual Machine
Cryptanalysis of NORX v2.0
Structure-Preserving Signatures on Equivalence Classes and Constant-Size Anonymous Credentials
Fast Cut-and-Choose-Based Protocols for Malicious and Covert Adversaries
Improving the Exact Security of Digital Signature Schemes
An Infinite Class of Counterexamples to a Conjecture Concerning Nonlinear Resilient Functions
Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography
An Implementation for a Fast Public-Key Cryptosystem
Oblivious Sampling with Applications to Two-Party k-Means Clustering
Securely Obfuscating Re-Encryption
New Characterizations of Dillon-like Hyperbent Functions via Dickson Polynomials
User Impersonation in Key Certification Schemes
Polynomial and Normal Bases for Finite Fields
An Improved Real-Quadratic-Field-Based Key Exchange Procedure
On the Security of Modular Exponentiation with Application to the Construction of Pseudorandom Generators
Efficient Signature Schemes with Tight Reductions to the Diffie-Hellman Problems
More Efficient Oblivious Transfer Extensions
Tightly Secure Signatures From Lossy Identification Schemes
New Proofs for NMAC and HMAC: Security without Collision Resistance
Unbounded Predicate Inner Product Functional Encryption from Pairings
Secure Communication Channel Establishment: TLS 1.3 (over TCP Fast Open) versus QUIC
GNUC: A New Universal Composability Framework
An Efficient ZK Compiler from SIMD Circuits to General Circuits
New Second-Preimage Attacks on Hash Functions
Quantum Lightning Never Strikes the Same State Twice. Or: Quantum Money from Cryptographic Assumptions
Efficient Non-Malleable Commitment Schemes
Spin Me Right Round Rotational Symmetry for FPGA-Specific AES: Extended Version
Optimizing Rectangle and Boomerang Attacks: A Unified and Generic Framework for Key Recovery
Efficient Implementation of Pairing-Based Cryptosystems
Improved Cryptanalysis of AES-like Permutations
A Generalization of Hellman's Extension to Shannon's Approach to Cryptography
RIPEMD with Two-Round Compress Function is Not Collision-Free
On the Tight Security of TLS 1.3: Theoretically Sound Cryptographic Parameters for Real-World Deployments
Algebraic Nonlinearity and Its Applications to Cryptography
Buses for Anonymous Message Delivery
Breaking RSA May Be As Difficult As Factoring
Lossy Cryptography from Code-Based Assumptions Dense-Sparse LPN: A New Subexponentially Hard LPN Variant in SZK
A Public-Key Cryptosystem Using Purely Cubic Fields
Translating the Discrete Logarithm Problem on Jacobians of Genus 3 Hyperelliptic Curves with (ℓ , ℓ , ℓ )-Isogenies
Tight Security for Signature Schemes Without Random Oracles
One-Way Permutations on Elliptic Curves
The Extended k-tree Algorithm
Cryptanalysis of the CLT13 Multilinear Map
Logic Minimization Techniques with Applications to Cryptology
Further Enumerating Boolean Functions of Cryptographic Significance
Families of Prime-Order Endomorphism-Equipped Embedded Curves on Pairing-Friendly Curves
A One-Time Stegosystem and Applications to Efficient Covert Communication
A Lower Bound on Authentication After Having Observed a Sequence of Messages
The Generation of Random Numbers that Are Probably Prime
The Cryptanalysis of a Public-Key Implementation of Finite Group Mappings
TFHE: Fast Fully Homomorphic Encryption Over the Torus
Speeding Up Multi-scalar Multiplications for Pairing-Based zkSNARKs
A Practical Forgery Attack on Lilliput-AE
Protocols for Multiparty Coin Toss with a Dishonest Majority
A Note on Negligible Functions
Lightweight Asynchronous Verifiable Secret Sharing with Optimal Resilience
Cascade Ciphers: The Importance of Being First
A Perfect Zero-Knowledge Proof System for a Problem Equivalent to the Discrete Logarithm
Multi-Verifier Signatures
I Want to Ride My BICYCL : BICYCL Implements CryptographY in CLass Groups
On the Tightness of Forward-Secure Signature Reductions
Elliptic Curve Paillier Schemes
Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs
Breaking and Fixing Garbled Circuits When a Gate has Duplicate Input Wires
Efficient Algorithms for the Detection of (N, N)-Splittings and Endomorphisms
Actively Secure Setup for SPDZ
Cryptanalysis of the Shpilrain-Ushakov Protocol for Thompson's Group
Which New RSA-Signatures Can be Computed from Certain Given RSA-Signatures?
A Complete Analysis of the BKZ Lattice Reduction Algorithm
Short RSA Keys and Their Generation
Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities
Efficient Recursive Diffusion Layers for Block Ciphers and Hash Functions
Elliptic Curve Implementations of Zero-Knowledge Blobs
On Abelian and Homomorphic Secret Sharing Schemes
Using Symmetries in the Index Calculus for Elliptic Curves Discrete Logarithm
On the (in)Security of ROS
Introduction to the Special Issue on TLS 1.3
Lattice-Based Polynomial Commitments: Towards Asymptotic and Concrete Efficiency
A Guide to the Design of Digital Signatures based on Cryptographic Group Actions
Locally Random Reductions: Improvements and Applications
Analysis of Multivariate Encryption Schemes: Application to Dob and C *
The Insecurity of the Digital Signature Algorithm with Partially Known Nonces
All-But-Many Encryption
The Security of the Birational Permutation Signature Schemes
Linking Information Reconciliation and Privacy Amplification
Building Curves with Arbitrary Small MOV Degree over Finite Prime Fields
A Note on the Bivariate Coppersmith Theorem
Maintaining Authenticated Communication in the Presence of Break-Ins
Fiat-Shamir Bulletproofs are Non-malleable (in the Random Oracle Model)
An Efficient Threshold Access-Structure for RLWE-Based Multiparty Homomorphic Encryption
An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions
FlipIt: The Game of "Stealthy Takeover"
Information-Theoretic Bounds for Authentication Schemes
Permutations Satisfying (P 1) and (P 2) Properties and ℓ-Optimal Bent Functions
Minimal Complete Primitives for Secure Multi-Party Computation
Breaking the Decisional Diffie-Hellman Problem for Class Group Actions Using Genus Theory: Extended Version
Tight Security of Cascaded LRW2
Non-black-box Simulation in the Fully Concurrent Setting, Revisited
An Efficient State Recovery Attack on the X-FCSR Family of Stream Ciphers
Secure Communication in Minimal Connectivity Models
How Many Queries are Needed to Distinguish a Truncated Random Permutation from a Random Function?
On Soundness Notions for Interactive Oracle Proofs
Generic Constructions of Identity-Based and Certificateless KEMs
Non-malleable Encryption: Simpler, Shorter, Stronger
Mutual Information Analysis: a Comprehensive Study
Semi-quantum Money
From Physical to Stochastic Modeling of a TERO-Based TRNG
An Elliptic Curve Trapdoor System
Automata Evaluation and Text Search Protocols with Simulation-Based Security
On a Fallacious Bound for Authentication Codes
Efficient One-Sided Adaptively Secure Computation
Lattice-Based Programmable Hash Functions and Applications
On Subversion-Resistant SNARKs
MPClan: Protocol Suite for Privacy-Conscious Computations
Zero-Knowledge Proofs of Identity
Translucent Cryptography - An Alternative to Key Escrow, and Its Implementation via Fractional Oblivious Transfer
Graph Coloring Applied to Secure Computation in Non-Abelian Groups
Threshold Computation in the Head: Improved Framework for Post-Quantum Signatures and Zero-Knowledge Arguments
Discrete Logarithm Problems with Auxiliary Inputs
Erratum to: A Comparison of Cryptanalytic Tradeoff Algorithms
Adaptively Secure Distributed PRFs from sf LWE
Practical Aspects of Quantum Cryptographic Key Distribution
Ring Signatures: Stronger Definitions, and Constructions without Random Oracles
The TLS Handshake Protocol: A Modular Analysis
The COLM Authenticated Encryption Scheme
A New Public-Key Cryptosystem over a Quadratic Order with Quadratic Decryption Time
CRYPTOPOST - A Cryptographic Application to Mail Processing
Counting Binary Functions with Certain Cryptographic Properties
Byzantine Agreement Given Partial Broadcast
Substitution-Permutation Networks Resistant to Differential and Linear Cryptanalysis
The Security of the IAPM and IACBC Modes
Secret Sharing Over Infinite Domains
Computationally Secure Oblivious Transfer
Fast Correlation Attacks on Certain Stream Ciphers
Cryptanalytic Time-Memory-Data Trade-offs for FX-Constructions and the Affine Equivalence Problem
An Extended Quadratic Frobenius Primality Test with Average- and Worst-Case Error Estimate
A Construction of a Cipher from a Single Pseudorandom Permutation
Ascon v1.2: Lightweight Authenticated Encryption and Hashing
The Vulnerability of Geometric Sequences Based on Fields of Odd Characteristic
Cryptanalysis of the Chor - Rivest Cryptosystem
Adaptive versus Non-Adaptive Security of Multi-Party Protocols
Possibility and Impossibility Results for Selective Decommitments
Security Models and Proof Strategies for Plaintext-Aware Encryption
The Rebound Attack and Subspace Distinguishers: Application to Whirlpool
Unconditionally Anonymous Ring and Mesh Signatures
Conditionally-Perfect Secrecy and a Provably-Secure Randomized Cipher
Applying a Formal Analysis Technique to the CCITT X.509 Strong Two-Way Authentication Protocol
Decrypting Without Keys: The Case of the GlobalPlatform SCP02 Protocol
Decorrelation: A Theory for Block Cipher Security
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for $\varvec{\Sigma }$-Protocols
Security Analysis of Randomize-Hash-then-Sign Digital Signatures
A Black-Box Construction of Non-malleable Encryption from Semantically Secure Encryption
Enhanced Public Key Security for the McEliece Cryptosystem
Cryptanalysis of the Tillich-Zémor Hash Function
Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation
Secure Multi-Party Computation without Agreement
A Matrix Key-Distribution Scheme
An Extension of Kedlaya's Algorithm to Hyperelliptic Curves in Characteristic 2
Efficient and Scalable Universal Circuits
Finding the Inverse of some Shift Invariant Transformations
The Cryptanalysis of FEAL-4 with 20 Chosen Plaintexts