yusuke1997/dblp-id-title huggingface dataset:
From Minicrypt to Obfustopia via Private-Key Functional Encryption
Cryptanalysis of Full SCARF
Fast Batch Verification for Modular Exponentiation and Digital Signatures
BDD-Based Cryptanalysis of Keystream Generators
How to Compress Encrypted Data
New Attacks on all Double Block Length Hash Functions of Hash Rate 1, including the Parallel-DM
Cryptology and Complexity Theories
Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions?
Oracle Separation Between Quantum Commitments and Quantum One-Wayness
Quasi-Adaptive NIZK for Linear Subspaces Revisited
Multi-Designated Receiver Signed Public Key Encryption
The Collision Intractability of MDC-2 in the Ideal-Cipher Model
Efficient Two-Party Secure Computation on Committed Inputs
Perfect Non-interactive Zero Knowledge for NP
Anonymous NIZK Proofs of Knowledge with Preprocessing
Actively Secure Half-Gates with Minimum Overhead Under Duplex Networks
Is the RSA Scheme Safe?
Random Oracles and Non-uniformity
On the Security of Two MAC Algorithms
Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
A Measure of Semiequivocation
On the Use of the Binary Multiplying Channel in a Private Communication System
Security Analysis of a Practical "on the fly" Authentication and Signature Generation
A New Algebraic Approach to the Regular Syndrome Decoding Problem and Implications for PCG Constructions
Another Round of Breaking and Making Quantum Money: - How to Not Build It from Lattices, and More
The Characterization of All Binary Sequences with Perfect Linear Complexity Profiles
Optimal Traitor Tracing from Pairings
Related-Key Boomerang and Rectangle Attacks
Faster Secure Two-Party Computation in the Single-Execution Setting
Fully Homomophic Encryption over the Integers Revisited
Improved Generic Algorithms for Hard Knapsacks
Pseudorandomness in the (Inverseless) Haar Random Oracle Model
Efficient Binary Conversion for Paillier Encrypted Values
Automated Unbounded Analysis of Cryptographic Constructions in the Generic Group Model
Proof-of-Work-Based Consensus in Expected-Constant Time
Online/Offline OR Composition of Sigma Protocols
Are Crypto-Accelerators Really Inevitable? 20Bit Zero-Knowledge in Less than a Second on Simple 8-bit Microcontrollers
Graph-Theoretic Algorithms for the "Isomorphism of Polynomials" Problem
Group Signatures Without NIZK: From Lattices in the Standard Model
Query-Reusable Proof Systems
Tight Security Bounds for Double-Block Hash-then-Sum MACs
Universal One-Way Hash Functions via Inaccessible Entropy
Breaking the 1/λ-Rate Barrier for Arithmetic Garbling
A Memory Efficient Version of Satoh's Algorithm
Correlation Functions of Geometric Sequences
Efficient and Non-malleable Proofs of Plaintext Knowledge and Applications
Probabilistic Analysis of Elementary Randimizers
ESIGN: An Efficient Digital Signature Implementation for Smard Cards
How to Certify the Leakage of a Chip?
Complete Addition Formulas for Prime Order Elliptic Curves
Asymptotically Optimal Early Termination for Dishonest Majority Broadcast
The Chain & Sum Primitive and Its Applications to MACs and Stream Ciphers
Watermarking PRFs Against Quantum Adversaries
Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes
A Meta-complexity Characterization of Quantum Cryptography
Positive Results and Techniques for Obfuscation
Universally Composable Multi-party Computation Using Tamper-Proof Hardware
Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies
Generic Universal Forgery Attack on Iterative Hash-Based MACs
Public-Key Encryption in the Bounded-Retrieval Model
Efficient Mixed Garbling from Homomorphic Secret Sharing and GGM-Tree
Orientations and the Supersingular Endomorphism Ring Problem
Meet-in-the-Middle Preimage Attacks on Sponge-Based Hashing
Message Protection by Spread Spectrum Modulation in a Packet Voice Radio Link
Isogeny Problems with Level Structure
On the Reversibility of Oblivious Transfer
QUAD: A Practical Stream Cipher with Provable Security
Unconditional Byzantine Agreement and Multi-party Computation Secure against Dishonest Minorities from Scratch
COA-Secure Obfuscation and Applications
Key-Versatile Signatures and Applications: RKA, KDM and Joint Enc/Sig
On the Power of Expansion: More Efficient Constructions in the Random Probing Model
Security Proofs for Identity-Based Identification and Signature Schemes
Non-malleable Codes from Average-Case Hardness: $${\mathsf {A}}{\mathsf {C}}^0$$ , Decision Trees, and Streaming Space-Bounded Tampering
Non-interactive Distributional Indistinguishability (NIDI) and Non-malleable Commitments
End-to-End Encrypted Zoom Meetings: Proving Security and Strengthening Liveness
Finding the Impossible: Automated Search for Full Impossible-Differential, Zero-Correlation, and Integral Attacks
Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain
Families of SNARK-Friendly 2-Chains of Elliptic Curves
Non-interactive Public-Key Cryptography
A Bound for Multiparty Secret Key Agreement and Implications for a Problem of Secure Computing
Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part I
Random Oracle Combiners: Merkle-Damgård Style
Classification of Ideal Homomorphic Threshold Schemes over Finite Abelian Groups (Extended Abstract)
Homomorphisms of Secret Sharing Schemes: A Tool for Verifiable Signature Sharing
Cryptanalysis of Candidate Obfuscators for Affine Determinant Programs
Computing the Endomorphism Ring of a Supersingular Elliptic Curve from a Full Rank Suborder
Can We Trust Cryptographic Software? Cryptographic Flaws in GNU Privacy Guard v1.2.3
Improved Differential-Linear Cryptanalysis of 7-Round Chaskey with Partitioning
Polynomial Time Cryptanalytic Extraction of Deep Neural Networks in the Hard-Label Setting
Cryptanalysis of Video Encryption Based on Space-Filling Curves
Fully Homomorphic Encryption for Cyclotomic Prime Moduli
Multiparty Reusable Non-interactive Secure Computation from LWE
The Locality of Searchable Symmetric Encryption
Efficient Circuit-Size Independent Public Key Encryption with KDM Security
New Limits of Provable Security and Applications to ElGamal Encryption
Secret Sharing Schemes with Bipartite Access Structure
Complete Characterization of Broadcast and Pseudo-signatures from Correlations
Public-Key Cryptosystems with Very Small Key Length
Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields
Private Circuits II: Keeping Secrets in Tamperable Circuits
Foiling Birthday Attacks in Length-Doubling Transformations - Benes: A Non-Reversible Alternative to Feistel
Property-Preserving Hash Functions for Hamming Distance from Standard Assumptions
The Rectangle Attack - Rectangling the Serpent
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
Lower Bounds for Authentication Codes With Splitting
Improved Power Analysis Attacks on Falcon
Limitations of the Meta-reduction Technique: The Case of Schnorr Signatures
The Retracing Boomerang Attack
Software Performance of Universal Hash Functions
Public-Key Steganography
Hiding Secret Points Amidst Chaff
Correlation-Immune Polynomials over Finite Fields
Differential Cryptanalysis for Multivariate Schemes
Efficient Communication-Storage Tradeoffs for Multicast Encryption
Secure Conference Key Distribution Schemes for Conspiracy Attack
Public-Seed Pseudorandom Permutations
Lower Bounds for (Batch) PIR with Private Preprocessing
Bootstrapping Bits with CKKS
Advances in Cryptology - EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19-23, 2019, Proceedings, Part II
Technical Security: The Starting Point
On IND-qCCA Security in the ROM and Its Applications - CPA Security Is Sufficient for TLS 1.3
Black-Box Composition Does Not Imply Adaptive Security
Secrecy and Privacy in a Local Area Network Environment
Differentially Uniform Mappings for Cryptography
New Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5
Public Traceability in Traitor Tracing Schemes
Efficient Pre-processing PIR Without Public-Key Cryptography
Efficient and Generic Methods to Achieve Active Security in Private Information Retrieval and More Advanced Database Search
On Feedforward Transforms and p-Fold Periodic p-Arrays
An Optimal Class of Symmetric Key Generation Systems
Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts
Speeding up Discrete Log and Factoring Based Schemes via Precomputations
NanoGRAM: Garbled RAM with $\widetilde{O}(\log N)$ Overhead
The Rating of Understanding in Secure Voice Communication Systems
Attacks on Protocols for Server-Aided RSA Computation
Polynomial Time Attack on Wild McEliece over Quadratic Extensions
Cryptanalysis of the EMD Mode of Operation
Key Recovery from Gram-Schmidt Norm Leakage in Hash-and-Sign Signatures over NTRU Lattices
Can O.S.S. be Repaired? Proposal for a New Practical Signature Scheme
Fault Template Attacks on Block Ciphers Exploiting Fault Propagation
Sublinear Zero-Knowledge Arguments for RAM Programs
An Alternative to the Fiat-Shamir Protocol
An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem
On Removing Graded Encodings from Functional Encryption
Cryptanalytic Applications of the Polynomial Method for Solving Multivariate Equation Systems over GF(2)
A Practice-Oriented Treatment of Pseudorandom Number Generators
Revisiting the Efficiency of Malicious Two-Party Computation
Efficient Generic Forward-Secure Signatures with an Unbounded Number Of Time Periods
Divertible Zero Knowledge Interactive Proofs and Commutative Random Self-Reducibility
Leveraging Small Message Spaces for CCA1 Security in Additively Homomorphic and BGN-Type Encryption
Pseudorandom Function Tribe Ensembles Based on One-Way Permutations: Improvements and Applications
Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions
Combinatorial Properties of Basic Encryption Operations (Extended Abstract)
Algebraic Cryptanalysis of McEliece Variants with Compact Keys
A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem
Breaking Efficient Anonymous Channel
On the Number of Close-and-Equal Pairs of Bits in a String
How to Make Efficient Fail-stop Signatures
Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance
Blind Signatures Based on the Discrete Logarithm Problem
On the Impossibility of Tight Cryptographic Reductions
Rethinking PKI: What's Trust Got to Do with It?
Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves
Status Report on Factoring (At the Sandia National Laboratories)
Cryptanalysis of the ANSI X9.52 CBCM Mode
Coin-Based Anonymous Fingerprinting
Incompressible Cryptography
Embedding the UC Model into the IITM Model
Cryptanalysis of a Modified Rotor Machine
Security Under Message-Derived Keys: Signcryption in iMessage
Bifurcated Signatures: Folding the Accountability vs. Anonymity Dilemma into a Single Private Signing Scheme
Non-interactive Zero Knowledge from Sub-exponential DDH
Recycling Random Bits in Composed Perfect Zero-Knowledge
Tight Proofs for Signature Schemes without Random Oracles
A Fast Elliptic Curve Cryptosystem
Liv-Lempel Complexity for Periodic Sequences and its Cryptographic Application
Breaking RSA May Not Be Equivalent to Factoring
A Secure and Optimally Efficient Multi-Authority Election Scheme
BitGC: Garbled Circuits with 1 Bit per Gate
Quantum Oblivious Mutual Identification
Scalable Group Signatures with Revocation
Finding Collisions on a One-Way Street: Can Secure Hash Functions Be Based on General Assumptions?
Secure Hash-and-Sign Signatures Without the Random Oracle
Analysis of Multiple Access Channel using Multiple Level FSK
Polynomial Time Cryptanalytic Extraction of Neural Network Models
Dummy Shuffling Against Algebraic Attacks in White-Box Implementations
A Tutorial on High Performance Computing Applied to Cryptanalysis - (Invited Talk Abstract)
Efficient Distributed Randomness Generation from Minimal Assumptions Where PArties Speak Sequentially Once
A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday Barrier
Leakage-Resilient Cryptography from Minimal Assumptions
A voice Scrambling System for Testing and Demonstration
Authentication Codes in Plaintext and Chosen-content Attacks
Global, Unpredictable Bit Generation Without Broadcast
Threshold Garbled Circuits and Ad Hoc Secure Computation
Constructions of Bent Functions and Difference Sets
Practical Attack on All Parameters of the DME Signature Scheme
Quorum-Based Secure Multi-party Computation
Online-Extractability in the Quantum Random-Oracle Model
Protocols and Lower Bounds for Failure Localization in the Internet
ChiLow and ChiChi: New Constructions for Code Encryption
Unclonable Group Identification
Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
Executable Proofs, Input-Size Hiding Secure Computation and a New Ideal World
On Concurrently Secure Computation in the Multiple Ideal Query Model
Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
AES and the Wide Trail Design Strategy
SNARKs for Virtual Machines Are Non-malleable
A Secure Public-key Authentication Scheme
Toothpicks: More Efficient Fork-Free Two-Round Multi-signatures
Black Box Cryptanalysis of Hash Networks Based on Multipermutations
Multi-key and Multi-input Predicate Encryption from Learning with Errors
Rotational Cryptanalysis from a Differential-Linear Perspective - Practical Distinguishers for Round-Reduced FRIET, Xoodoo, and Alzette
Efficient Simulation of Random States and Random Unitaries
Salvaging Merkle-Damgård for Practical Applications
A Block Lanczos Algorithm for Finding Dependencies Over GF(2)
Weakly Super-Invertible Matrices and Constant Communication Dishonest Majority MPC
Efficient Exponentiation using Procomputation and Vector Addition Chains
Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
Locality-Preserving Oblivious RAM
Non-malleable Commitments Against Quantum Attacks
Two Halves Make a Whole - Reducing Data Transfer in Garbled Circuits Using Half Gates
Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free
Patchable Indistinguishability Obfuscation: i O for Evolving Software
The Bitcoin Backbone Protocol: Analysis and Applications
Security of Transportable Computerized Files
Round Efficiency of Multi-party Computation with a Dishonest Majority
Bulletproofs++: Next Generation Confidential Transactions via Reciprocal Set Membership Arguments
Collisions for the Compressin Function of MD5
Let Attackers Program Ideal Models: Modularity and Composability for Adaptive Compromise
On Finding Small Solutions of Modular Multivariate Polynomial Equations
Advances in Cryptology: Proceedings of EUROCRYPT 84, A Workshop on the Theory and Application of of Cryptographic Techniques, Paris, France, April 9-11, 1984, Proceedings
Advances in Cryptology - EUROCRYPT 2025 - 44th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Madrid, Spain, May 4-8, 2025, Proceedings, Part VII
On the Composition of Two-Prover Commitments, and Applications to Multi-round Relativistic Commitments
Some Applications of Multiple Key Ciphers
Efficient Secret Sharing Without a Mutually Trusted Authority (Extended Abstract)
A New Mode of Operation for Block Ciphers and Length-Preserving MACs
Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs
Structural Lattice Reduction: Generalized Worst-Case to Average-Case Reductions and Homomorphic Cryptosystems
Non-linearity of Exponent Permutations
Advances in Cryptology - EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10-14, 2020, Proceedings, Part II
Relaxed Vector Commitment for Shorter Signatures
Optimal Merging in Quantum k-xor and k-xor-sum Algorithms
Two-Round Multiparty Secure Computation from Minimal Assumptions
Nonce-Based Cryptography: Retaining Security When Randomness Fails
Wire-Tap Channel II
Multilevel Cryptosecure Relational Database
Witness Semantic Security
Analysis of a Nonlinear Feedforward Logic for Binary Sequence Generators
Zero-Knowledge Sets with Short Proofs
Efficient Proofs that a Committed Number Lies in an Interval
Security Flaws Induced by CBC Padding - Applications to SSL, IPSEC, WTLS ...
Easy Come - Easy Go Divisible Cash
An Improved Low-Denisty Subset Sum Algorithm
Post-Quantum Multi-Party Computation
Rational Isogenies from Irrational Endomorphisms
The Dining Cryptographers in the Disco - Underconditional Sender and Recipient Untraceability with Computationally Secure Serviceability (Abstract)
Smooth Entropy and Rényi Entropy
Formal Analysis of Multi-device Group Messaging in WhatsApp
Proving Tight Security for Rabin-Williams Signatures
Efficient Amplification of the Security of Weak Pseudo-random Function Generators
Removing the Strong RSA Assumption from Arguments over the Integers
When Shift Registers Clock Themselves
Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits
Strengthening Zero-Knowledge Protocols Using Signatures
Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles
Simultaneous Security of Bits in the Discrete Log
Traceable Signatures
Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions
On a Generalization of Substitution-Permutation Networks: The HADES Design Strategy
Relativistic (or 2-Prover 1-Round) Zero-Knowledge Protocol for \mathsf NP Secure Against Quantum Adversaries
Advances in Cryptology - EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19-23, 2019, Proceedings, Part III
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
Fast Authentication in a Trapdoor - Knapsack Public Key Cryptosystem
A Practical Mix
Distance-Bounding Protocols (Extended Abstract)
Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator
Approximate Divisor Multiples - Factoring with Only a Third of the Secret CRT-Exponents
How to Say "No"
Computationally Private Information Retrieval with Polylogarithmic Communication
On the Construction of Authentication Codes With Secrecy and Codes Withstanding Spoofing Attacks of Order L >= 2
Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees
Fiat-Shamir Bulletproofs are Non-Malleable (in the Algebraic Group Model)
From Improved Leakage Detection to the Detection of Points of Interests in Leakage Traces
General Public Key Residue Cryptosystems and Mental Poker Protocols
Efficient Factoring Based on Partial Information
Tightly-Secure Key-Encapsulation Mechanism in the Quantum Random Oracle Model
Which New RSA Signatures Can Be Computed From Some Given RSA Signatures?
Succinct Randomized Encodings from Laconic Function Evaluation, Faster and Simpler
On the Efficiency of Group Signatures Providing Information-Theoretic Anonymity
Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction
On the Security of RDSA
Broadcast-Optimal Two-Round MPC
Tighter Security Notions for a Modular Approach to Private Circuits
Distributed Provers with Applications to Undeniable Signatures
On Finding Quantum Multi-collisions
A New Public-Key Cryptosystem
Compact E-Cash
Founding Secure Computation on Blockchains
Actively Secure Arithmetic Computation and VOLE with Constant Computational Overhead
Cryptanalysis of the Hash Functions MD4 and RIPEMD
Lightweight, Maliciously Secure Verifiable Function Secret Sharing
Formal Verification of Masked Hardware Implementations in the Presence of Glitches
Limits of Polynomial Packings for $\mathbb {Z}_{p^k}$ and $\mathbb {F}_{p^k}$
Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions
Batch Bootstrapping I: - A New Framework for SIMD Bootstrapping in Polynomial Modulus
New Lattice Two-Stage Sampling Technique and Its Applications to Functional Encryption - Stronger Security and Smaller Ciphertexts
Massively Parallel Elliptic Curve Factorin
The Bit Security of Paillier's Encryption Scheme and Its Applications
A New Multiple Key Cipher and an Improved Voting Scheme
On the Construction of Highly Nonlinear Permutations
Combinatorial Bounds for Authentication Codes with Arbitration
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
Anamorphic Encryption, Revisited
Concurrently Secure Computation in Constant Rounds
A New Trapdoor Knapsack Public-Key Cryptosystem
Short, Invertible Elements in Partially Splitting Cyclotomic Rings and Applications to Lattice-Based Zero-Knowledge Proofs
SQIsignHD: New Dimensions in Cryptography
Security/Efficiency Tradeoffs for Permutation-Based Hashing
Activities of IFIP Working Group 11: 4 on Crypto Management
Constant-Round Simulation-Secure Coin Tossing Extension with Guaranteed Output
All Complete Functionalities are Reversible
Cryptography with Updates
Anamorphic Encryption: New Constructions and Homomorphic Realizations
Spartan and Bulletproofs are Simulation-Extractable (for Free!)
On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL
Reconsidering Generic Composition
Asymmetric Fingerprinting (Extended Abstract)
A Probabilistic Primality test Based on the Properties of Certain Generalized Lucas Numbers
Single-Server Private Information Retrieval with Sublinear Amortized Time
Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists
Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31 - June 4, 1998, Proceeding
On the Importance of Checking Cryptographic Protocols for Faults (Extended Abstract)
Alternating Step Generators Controlled by De Bruijn Sequences
Secure Multiparty Computation with Sublinear Preprocessing
SNARGs for P from Sub-exponential DDH and QR
Finding a Small Root of a Univariate Modular Equation
Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
Batch Fully Homomorphic Encryption over the Integers
How Easy is Collision Search? Application to DES (Extended Summary)
The Exact Price for Unconditionally Secure Asymmetric Cryptography
Finding Hash Collisions with Quantum Computers by Using Differential Trails with Smaller Probability than Birthday Bound
Priced Oblivious Transfer: How to Sell Digital Goods
Facts and Myths of Enigma: Breaking Stereotypes
Homomorphic Signatures for Polynomial Functions
Verifiable Random Functions from Identity-Based Key Encapsulation
Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes
Low-Bandwidth Mixed Arithmetic in VOLE-Based ZK from Low-Degree PRGs
Potential Weaknesses of the Commutator Key Agreement Protocol Based on Braid Groups
Efficient Maliciously Secure Multiparty Computation for RAM
Single Database Private Information Retrieval Implies Oblivious Transfer
MIMD-Factorisation on Hypercubes
Dealing Necessary and Sufficient Numbers of Cards for Sharing a One-Bit Secret Key
On Valiant's Conjecture - Impossibility of Incrementally Verifiable Computation from Random Oracles
Distributed Differential Privacy via Shuffling
Traitors Collaborating in Public: Pirates 2.0
How to Break Okamoto's Cryptosystem by Reducing Lattice Bases
Practical Homomorphic MACs for Arithmetic Circuits
The 2Hash OPRF Framework and Efficient Post-quantum Instantiations
A Kilobit Hidden SNFS Discrete Logarithm Computation
Multi-input Inner-Product Functional Encryption from Pairings
An Information-Theoretic Treatment of Homophonic Substitution
Ciminion: Symmetric Encryption Based on Toffoli-Gates over Large Finite Fields
On Binary Sequences from Recursions modulo 2 e Made Non-Linear by the Bit-by-Bit XOR Function
Encryption and Key Manaagement for the ECS Satellite Service
On Cryptosystems Based on Polynomials and Finite Fields
Supersingular Curves You Can Trust
How to Break MD5 and Other Hash Functions
Efficient Anonymous Channel and All/Nothing Election Scheme