yusuke1997/dblp-id-title huggingface dataset:
Crptograpic Applications of the Non-Interactive Metaproof and Many-Prover Systems
A Fast Modular-multiplication Algorithm based on a Higher Radix
Additive Randomized Encodings and Their Applications
Tracing Quantum State Distinguishers via Backtracking
Communication-Efficient Unconditional MPC with Guaranteed Output Delivery
Advances in Cryptology - CRYPTO 2025 - 45th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2025, Proceedings, Part VI
Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
Oblivious Transfer with Adaptive Queries
Some Comments on the Knapsack Problem
Flexible Access Control with Master Keys
The Shortest Feedback Shift Register That Can Generate A Given Sequence
Collusion-Free Protocols in the Mediated Model
Design Concepts for Tamper Responding Systems
Bitcoin as a Transaction Ledger: A Composable Treatment
Compressing Cryptographic Resources
A Survey of Hardware Implementation of RSA (Abstract)
On the Impossibility of Key Agreements from Quantum Random Oracles
The Real Reason for Rivest's Phenomenon
Continuously Non-Malleable Codes in the Split-State Model from Minimal Assumptions
Willow: Secure Aggregation with One-Shot Clients
Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins?
Faster Correlation Attack on Bluetooth Keystream Generator E0
Adaptively Secure MPC with Sublinear Communication Complexity
Security of 2^t-Root Identification and Signatures
Achieving Zero-Knowledge Robustly
Fingerprinting Long Forgiving Messages
Some Remarks on the Herlestam-Johannesson Algorithm for Computing Logarithms over GF(2 p )
Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model
Dynamic Threshold Public-Key Encryption
A Lower Bound for Proving Hardness of Learning with Rounding with Polynomial Modulus
Correlation of Quadratic Boolean Functions: Cryptanalysis of All Versions of Full \mathsf MORUS
Tighter QCCA-Secure Key Encapsulation Mechanism with Explicit Rejection in the Quantum Random Oracle Model
Asymptotically Compact Adaptively Secure Lattice IBEs and Verifiable Random Functions via Generalized Partitioning Techniques
A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
Shared Generation of Authenticators and Signatures (Extended Abstract)
Bounds for Resilient Functions and Orthogonal Arrays
Direct Minimum-Knowledge Computations
Parallel Reducibility for Information-Theoretically Secure Computation
Efficient Universal Padding Techniques for Multiplicative Trapdoor One-Way Permutation
Hard-Core Predicates for a Diffie-Hellman Problem over Finite Fields
On Concurrent Zero-Knowledge with Pre-processing
Candidate Witness Encryption from Lattice Techniques
Accelerating the Delfs-Galbraith Algorithm with Fast Subfield Root Detection
Hash Functions Based on Three Permutations: A Generic Security Analysis
Indistinguishability Obfuscation from SXDH on 5-Linear Maps and Locality-5 PRGs
Keeping the SZK-Verifier Honest Unconditionally
Efficient Pseudorandom Correlation Generators: Silent OT Extension and More
Homomorphic Time-Lock Puzzles and Applications
The Notion of Security for Probabilistic Cryptosystems
Optimal Security Proofs for Signatures from Identification Schemes
Three's Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
On the Security of the Gollmann Cascades
Must You Know the Code of f to Securely Compute f?
Circular Security Separations for Arbitrary Length Cycles from LWE
Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes
MoSS: Modular Security Specifications Framework
On Rotation Group and Encryption of Analog Signals
On Knowledge-Soundness of Plonk in ROM from Falsifiable Assumptions
Tightly Secure Signatures and Public-Key Encryption
Computationally Efficient Asynchronous MPC with Linear Communication and Low Additive Overhead
Secret Sharing Schemes for Very Dense Graphs
A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence
Reconstructing RSA Private Keys from Random Key Bits
A Polynomial-Time Algorithm for Solving the Hidden Subset Sum Problem
Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
Advances in Cryptology - CRYPTO 2009, 29th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2009. Proceedings
A Key-schedule Weakness in SAFER K-64
Incremental Cryptography: The Case of Hashing and Signing
The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator
Protocols for Secret Key Agreement by Public Discussion Based on Common Information
General Perfect Secret Sharing Schemes
"Practical IP" <= MA
Malicious Security for PIR (Almost) for Free
A Comparison of Practical Public Key Cryptosystems Based on Integer Factorization and Discrete Logarithms
On the Local Leakage Resilience of Linear Secret Sharing Schemes
On Deniability in the Common Reference String and Random Oracle Model
Efficient Key Recovery for All HFE Signature Variants
Transistor: a TFHE-Friendly Stream Cipher
A Modular Approach to Registered ABE for Unbounded Predicates
Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
Blind Signature System
To Hash or Not to Hash Again? (In)Differentiability Results for H 2 and HMAC
Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
Limits on the Provable Consequences of One-way Permutations
Lattice-Based Post-quantum iO from Circular Security with Random Opening Assumption
Society and Group Oriented Cryptography: A New Concept
Two-Sided Malicious Security for Private Intersection-Sum with Cardinality
Security of Blind Digital Signatures (Extended Abstract)
Implicit White-Box Implementations: White-Boxing ARX Ciphers
Wagner's Algorithm Provably Runs in Subexponential Time for rmSIS ∞
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries
Faster Bootstrapping with Polynomial Error
A Note on Non-interactive Zero-Knowledge from CDH
Universal Composable Transaction Serialization with Order Fairness
Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP
An Efficient Identification Scheme Based on Permuted Kernels (Extended Abstract)
How to Keep a Secret Alive: Extensible Partial Key, Key Safeguarding, and Threshold Systems
Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation
Local Network Cryptosystem Architecture
SNARGs for Monotone Policy Batch NP
Le Mans: Dynamic and Fluid MPC for Dishonest Majority
A Chosen Text Attack on The Modified Cryptographic Checksum Algorithm of Cohen and Huang
Efficient Identification Schemes Using Two Prover Interactive Proofs
Watermarking Public-Key Cryptographic Primitives
Bucket Hashing and its Application to Fast Message Authentication
Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
Linear Cryptanalysis of the Fast Data Encipherment Algorithm
Digital Signature Scheme for Computer Communication Networks
Time-Space Lower Bounds for Finding Collisions in Merkle-Damgård Hash Functions
Syndrome Decoding in the Head: Shorter Signatures from Zero-Knowledge Proofs
Two Party RSA Key Generation
Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK
Quantum Security Proofs Using Semi-classical Oracles
Efficient Indifferentiable Hashing into Ordinary Elliptic Curves
Interactive Proofs with Provable Security Against Honest Verifiers
FFT-Hash-II is not yet Collision-free
Improving Support-Minors Rank Attacks: Applications to Gđisplaystyle eMSS and Rainbow
Maintaining Security in the Presence of Transient Faults
Optimal Non-perfect Uniform Secret Sharing Schemes
On Distributional Collision Resistant Hashing
Cryptanalysis of GGH15 Multilinear Maps
Fair Exchange of Secrets
NIZK from LPN and Trapdoor Hash via Correlation Intractability for Approximable Relations
How to Recover a Secret with O(n) Additions
Universal Electronic Cash
A Generalization of Hellman's Extension of Shannon's Approach to Cryptography (Abstract)
Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation
Faster Sounder Succinct Arguments and sfIOPs
Concurrent Non-Malleable Zero Knowledge Proofs
Analysis of a Public Key Approach Based on Polynomial Substitution
Cryptographic Solution to a Multilevel Security Problem
Functional Inversion and Communication Complexity
LATKE: A Framework for Constructing Identity-Binding PAKEs
Revisiting Security Estimation for LWE with Hints from a Geometric Perspective
How to Encipher Messages on a Small Domain
How (not) to Build Quantum PKE in Minicrypt
On the Security of the KMOV Public Key Cryptosystem
FHE Circuit Privacy Almost for Free
On Generation of Probable Primes By Incremental Search
Order-Fairness for Byzantine Consensus
A Formal Treatment of End-to-End Encrypted Cloud Storage
Intractable Problems in Number Theory
Convertible Undeniable Signatures
sfXHMQV: Better Efficiency and Stronger Security for Signal's Initial Handshake based on HMQV
A New Distribution-Sensitive Secure Sketch and Popularity-Proportional Hashing
Efficient Lattice-Based Zero-Knowledge Arguments with Standard Soundness: Construction and Applications
Nonlinear Feedback Shift Register Sequences
Obfuscation Combiners
Black-Box Transformations from Passive to Covert Security with Public Verifiability
MPC-Friendly Symmetric Cryptography from Alternating Moduli: Candidates, Protocols, and Applications
Efficient and Secure Pseudo-Random Number Generation
Soundness in the Public-Key Model
The Round Complexity of Black-Box Post-quantum Secure Computation
How to Compress Rabin Ciphertexts and Signatures (and More)
Secure Computation against Adaptive Auxiliary Information
Advances in Cryptology, Proceedings of CRYPTO '84, Santa Barbara, California, USA, August 19-22, 1984, Proceedings
An Algebraic Framework for Pseudorandom Functions and Applications to Related-Key Security
Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations
Properties of Cryptosystem PGM
Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
Distinguisher and Related-Key Attack on the Full AES-256
Differential-Linear Cryptanalysis
Superposition Meet-in-the-Middle Attacks: Updates on Fundamental Security of AES-like Hashing
The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols
New Efficient and Secure Protocols for Verifiable Signature Sharing and Other Applications
A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds
Efficient Hardware Implementation of the DES
Stochastic Secret Sharing with 1-Bit Shares and Applications to MPC
How to Improve Rebound Attacks
New Public-Key Cryptosystem Using Braid Groups
Password Interception in a SSL/TLS Channel
Solving the Tensor Isomorphism Problem for Special Orbits with Low Rank Points: Cryptanalysis and Repair of an Asiacrypt 2023 Commitment Scheme
Wallet Databases with Observers
Breaking Rainbow Takes a Weekend on a Laptop
Advances in Cryptology - CRYPTO 2006, 26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2006, Proceedings
Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings
On the Classification of Idea Secret Sharing Schemes
Differential Cryptanalysis of DES-like Cryptosystems
Certified Everlasting Zero-Knowledge Proof for QMA
Practical Quantum Oblivious Transfer
Designing Identification Schemes with Keys of Short Size
Fast Digital Identity Revocation (Extended Abstract)
Short and Stateless Signatures from the RSA Assumption
On Robust Combiners for Private Information Retrieval and Other Primitives
The Round Complexity of Verifiable Secret Sharing Revisited
Unconditionally Secure Digital Signatures
Lower Bounds on Lattice Sieving and Information Set Decoding
On the Design of SP Networks From an Information Theoretic Point of View
An Improvement of the Fiat-Shamir Identification and Signature Scheme
On Expected Constant-Round Protocols for Byzantine Agreement
An Improved Correlation Attack Against Irregular Clocked and Filtered Keystream Generators
Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials
Some Easy Instances of Ideal-SVP and Implications on the Partial Vandermonde Knapsack Problem
Towards Practical Public Key Systems Secure Against Chosen Ciphertext Attacks
Amortized Complexity of Information-Theoretically Secure MPC Revisited
Hyper-encryption against Space-Bounded Adversaries from On-Line Strong Extractors
More Efficient Dishonest Majority Secure Computation over $\mathbb {Z}_{2^k}$ via Galois Rings
Security, Liberty, and Electronic Communications
Optimistic Fair Secure Computation
Out-of-Band Authentication in Group Messaging: Computational, Statistical, Optimal
LFSR-based Hashing and Authentication
An LSI Digital Encryption Processor (DEP)
Blind Signatures from Proofs of Inequality
Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic
Computer-Aided Security Proofs for the Working Cryptographer
New Monotones and Lower Bounds in Unconditional Two-Party Computation
Verifiable Decapsulation: Recognizing Faulty Implementations of Post-quantum KEMs
Improved Analysis of Kannan's Shortest Lattice Vector Algorithm
Network-Hiding Communication and Applications to Multi-party Protocols
Robust Quantum Public-Key Encryption with Applications to Quantum Key Distribution
Probabilistic Analysis and Performance Modelling of the 'Swedish' Algorithm and Modifications
Round-Optimal Secure Two-Party Computation
Secure Voting Using Partially Compatible Homomorphisms
Attribute-Based Encryption for Circuits from Multilinear Maps
Capacity and Data Complexity in Multidimensional Linear Attack
DES Has No Per Round Linear Factors
MacORAMa: Optimal Oblivious RAM with Integrity
Decaf: Eliminating Cofactors Through Point Compression
On Concurrent Multi-party Quantum Computation
Quadratic Relation of S-box and Its Application to the Linear Attack of Full Round DES
Derandomization in Cryptography
Communication Complexity in Algebraic Two-Party Protocols
Zero-Knowledge IOPs Approaching Witness Length
Sample Efficient Search to Decision for kLIN
GURKE: Group Unidirectional Ratcheted Key Exchange
The LSD Broadcast Encryption Scheme
New Results on Modular Inversion Hidden Number Problem and Inversive Congruential Generator
Advances in Cryptology - CRYPTO 2008, 28th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2008. Proceedings
Good S-Boxes Are Easy To Find
Simultaneous Amplification: The Case of Non-interactive Zero-Knowledge
Compiled Nonlocal Games from any Trapdoor Claw-Free Function
An Elliptic Curve Implementation of the Finite Field Digital Signature Algorithm
Hash Functions and the (Amplified) Boomerang Attack
Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information
A Fast Pseudo Random Permutation Generator With Applications to Cryptology
Improved Differential Attacks on RC5
MuSig2: Simple Two-Round Schnorr Multi-signatures
Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs
Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability
Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security
Universally Composable Secure Computation with Corrupted Tokens
Concretely Efficient Lattice-Based Polynomial Commitment from Standard Assumptions
Cryptanalysis of OCB2: Attacks on Authenticity and Confidentiality
Cryptographic Protocols for Electronic Voting
A Basic Theory of Public and Private Cryptosystems
Components and Cycles of a Random Function
On Generalized Feistel Networks
Best of Both Worlds - Revisiting the Spymasters Double Agent Problem
Advances in Cryptology - CRYPTO '97, 17th Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 1997, Proceedings
Guarding the Signal: Secure Messaging with Reverse Firewalls
Evaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems
Sparse Pseudorandom Distributions
On Codes and Learning with Errors over Function Fields
Differential Fault Analysis of Secret Key Cryptosystems
Adaptively Secure 5 Round Threshold Signatures from MLWE/MSIS and DL with Rewinding
Lattice Reduction for Modules, or How to Reduce ModuleSVP to ModuleSVP
Field Encryption and Authentication
Gradual and Verifiable Release of a Secret
Observations on the SIMON Block Cipher Family
Efficient Multiparty Protocols via Log-Depth Threshold Formulae - (Extended Abstract)
DewTwo: A Transparent PCS with Quasi-Linear Prover, Logarithmic Verifier and 4.5KB Proofs from Falsifiable Assumptions
Automated Analysis of Cryptographic Assumptions in Generic Group Models
Key Recovery from Side-Channel Power Analysis Attacks on Non-SIMD HQC Decryption
Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
The MD4 Message Digest Algorithm
Advances in Cryptology - CRYPTO 2025 - 45th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2025, Proceedings, Part V
Physically Uncloneable Functions in the Universal Composition Framework
Interaction in Key Distribution Schemes (Extended Abstract)
New Attacks on Feistel Structures with Improved Memory Complexities
Zero-Knowledge Proofs and String Commitments Withstanding Quantum Attacks
Differential Cryptanalysis of Lucifer
Streaming Functional Encryption
Stationary Syndrome Decoding for Improved PCGs
Efficient Chosen-Ciphertext Security via Extractable Hash Proofs
Efficient Information-Theoretic Multi-party Computation over Non-commutative Rings
Verification by Anonymous Monitors
An M³ Public-Key Encryption Scheme
Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems
Scalable and Unconditionally Secure Multiparty Computation
High-Speed Hardware Implementation of the Knapsack Cipher
Cryptography and the Internet
Lattice-Based Succinct Arguments from Vanishing Polynomials - (Extended Abstract)
Scalable Multiparty Computation from Non-linear Secret Sharing
On the Round Complexity of Secure Quantum Computation
Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
A Punctured Programming Approach to Adaptively Secure Functional Encryption
Nearly Optimal Property Preserving Hashing
The Cost to Break SIKE: A Comparative Hardware-Based Analysis with AES and SHA-3
Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part I
Directed Acyclic Graphs, One-way Functions and Digital Signatures
On the Computation of Discrete Logarithms in Class Groups
A Key-Recovery Timing Attack on Post-quantum Primitives Using the Fujisaki-Okamoto Transformation and Its Application on FrodoKEM
Better Concrete Security for Half-Gates Garbling (in the Multi-instance Setting)
Information Theory Without the Finiteness Assumption, I: Cryptosystems as Group-Theoretic Objects
Multiparty Distributed Point Functions
Computing Logarithms in GF(2 n )
EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
On Signatures and Authentication
Linear Cryptanalysis Using Multiple Approximations
Oblivious Issuance of Proofs
ABE for DFA from k-Lin
A Formal Treatment of Multi-key Channels
Non-interactive Batch Arguments for NP from Standard Assumptions
Invertible Universal Hashing and the TET Encryption Mode
Proving the TLS Handshake Secure (As It Is)
Deriving the Complete Knowledge of Participants in Cryptographic Protocols (Extended Abstract)
Secret Sharing Homomorphisms: Keeping Shares of A Secret Sharing
Advances in Cryptology - CRYPTO 2016 - 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2016, Proceedings, Part II
On the Security of Compressed Encodings
Instant Ciphertext-Only Cryptanalysis of GSM Encrypted Communication
Bits Security of the Elliptic Curve Diffie-Hellman Secret Keys
Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost
Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
Solving Hidden Number Problem with One Bit Oracle and Advice
Post-quantum Simulatable Extraction with Minimal Assumptions: Black-Box and Constant-Round
Securing Circuits against Constant-Rate Tampering
How to Exchange Half a Bit
Improved Efficient Arguments (Preliminary Version)
Puncturable Pseudorandom Sets and Private Information Retrieval with Near-Optimal Online Bandwidth and Time
Some Thoughts on Speech Encryption
Some Cryptographic Techniques for File Protection
Differential Collisions in SHA-0
A Modular Treatment of Cryptographic APIs: The Symmetric-Key Case
The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
Cryptographic Significance of the Carry for Ciphers Based on Integer Addition
Pebbling and Proofs of Work
A Realization Scheme for the Identity-Based Cryptosystem
Compact Lattice Signatures via Iterative Rejection Sampling
The Measure-and-Reprogram Technique 2.0: Multi-round Fiat-Shamir and More
A Layered Broadcast Cryptographic System
Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography
The Bitcoin Backbone Protocol with Chains of Variable Difficulty
Highly Efficient Key Exchange Protocols with Optimal Tightness
A Key Recovery Attack on Discrete Log-based Schemes Using a Prime Order Subgroupp
Solving Large Sparse Linear Systems over Finite Fields
Founding Cryptography on Oblivious Transfer - Efficiently
Homomorphic Signatures with Efficient Verification for Polynomial Functions
Constructing VIL-MACsfrom FIL-MACs: Message Authentication under Weakened Assumptions
A Subexponential Algorithm for Discrete Logarithms over All Finite Fields
Subquadratic SNARGs in the Random Oracle Model
On the (In)Security of the BUFF Transform
Probabilistically Checkable Arguments
L-collision Attacks against Randomized MACs
On the Power of Secure Two-Party Computation
Non-interactive Timestamping in the Bounded Storage Model
Revisiting the Gentry-Szydlo Algorithm
Proving Security Against Chosen Cyphertext Attacks
Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
Improved Generic Attacks against Hash-Based MACs and HAIFA
Reducing the CRS Size in Registered ABE Systems
Witness Encryption from Instance Independent Assumptions
Current Market: Products, Costs, Trends
Rerandomizable Garbling, Revisited
List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin Tossing
Time-Lock Puzzles in the Random Oracle Model
Quantum Lifting for Invertible Permutations and Ideal Ciphers
Trade-offs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution
Improved Torsion-Point Attacks on SIDH Variants
Coefficient Grouping for Complex Affine Layers
Two-Round Trip Schnorr Multi-signatures via Delinearized Witnesses
Instantiating Random Oracles via UCEs
Limitations on the Use of Encryption to Enforce Mandatory Security
A High Speed Manipulation Detection Code
The First Collision for Full SHA-1
Dynamic Local Searchable Symmetric Encryption
Universally Composable Commitments
Moving a Step of ChaCha in Syncopated Rhythm
Threshold Cryptosystems
Computationally Differentially Private Inner-Product Protocols Imply Oblivious Transfer
A Simplified Approach to Threshold and Proactive RSA
Pirate Evolution: How to Make the Most of Your Traitor Keys
Trapdoor Hash Functions and Their Applications
From Obfuscation to the Security of Fiat-Shamir for Proofs
The Communication Complexity of Threshold Private Set Intersection
Universally Ideal Secret Sharing Schemes (Preliminary Version)
Threshold Encryption with Silent Setup
Multi-Input Functional Encryption for Inner Products: Function-Hiding Realizations and Constructions Without Pairings
On the Security of Ping-Pong Protocols
Advances in Cryptology - CRYPTO '88, 8th Annual International Cryptology Conference, Santa Barbara, California, USA, August 21-25, 1988, Proceedings
A Quantum Cipher with Near Optimal Key-Recycling
Threshold Signatures with Private Accountability
Correlation Analysis of the Shrinking Generator