A randomized protocol for signing contracts
Communications of the ACM
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Founding crytpography on oblivious transfer
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Generating hard instances of lattice problems (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A public-key cryptosystem with worst-case/average-case equivalence
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Efficient oblivious transfer protocols
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Universally composable two-party and multi-party secure computation
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Oblivious Transfer with Adaptive Queries
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Universally Composable Commitments
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Equivalence Between Two Flavours of Oblivious Transfers
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Priced Oblivious Transfer: How to Sell Digital Goods
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
An Identity Based Encryption Scheme Based on Quadratic Residues
Proceedings of the 8th IMA International Conference on Cryptography and Coding
Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
New lattice-based cryptographic constructions
Journal of the ACM (JACM)
On lattices, learning with errors, random linear codes, and cryptography
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Worst-Case to Average-Case Reductions Based on Gaussian Measures
SIAM Journal on Computing
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Efficient Two-Party Secure Computation on Committed Inputs
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Simulatable Adaptive Oblivious Transfer
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Blind identity-based encryption and simulatable oblivious transfer
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Efficient fully-simulatable oblivious transfer
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
Cryptography and game theory: designing protocols for exchanging information
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Smooth projective hashing and two-message oblivious transfer
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Perfect non-interactive zero knowledge for NP
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Round Optimal Universally Composable Oblivious Transfer Protocols
ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
Universally Composable Adaptive Oblivious Transfer
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Secure Arithmetic Computation with No Honest Majority
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Simple, Black-Box Constructions of Adaptively Secure Protocols
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Simultaneous Hardcore Bits and Cryptography against Memory Attacks
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Secure Hamming Distance Based Computation and Its Applications
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Reducing Complexity Assumptions for Oblivious Transfer
IWSEC '09 Proceedings of the 4th International Workshop on Security: Advances in Information and Computer Security
Quantum-Secure Coin-Flipping and Applications
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Secure Two-Party Computation Is Practical
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Efficient Public Key Encryption Based on Ideal Lattices
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Non-committing Encryptions Based on Oblivious Naor-Pinkas Cryptosystems
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
Better key sizes (and attacks) for LWE-based encryption
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Chameleon all-but-one TDFs and their application to chosen-ciphertext security
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Identity-based encryption secure against selective opening attack
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Secure two-party computation via cut-and-choose oblivious transfer
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Practical adaptive oblivious transfer from simple assumptions
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Two-output secure computation with malicious adversaries
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Efficient non-interactive secure computation
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Highly-efficient universally-composable commitments based on the DDH assumption
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Improving BDD cryptosystems in general lattices
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
Fully simulatable quantum-secure coin-flipping and applications
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
New algorithms for learning in presence of errors
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
The geometry of lattice cryptography
Foundations of security analysis and design VI
The IPS compiler: optimizations, variants and concrete efficiency
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
General construction of chameleon all-but-one trapdoor functions
ProvSec'11 Proceedings of the 5th international conference on Provable security
Generalized learning problems and applications to non-commutative cryptography
ProvSec'11 Proceedings of the 5th international conference on Provable security
Threshold decryption and zero-knowledge proofs for lattice-based cryptosystems
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Public-key encryption schemes with auxiliary inputs
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Public-key cryptographic primitives provably as secure as subset sum
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
On the feasibility of consistent computations
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Efficient set operations in the presence of malicious adversaries
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
On ideal lattices and learning with errors over rings
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Bonsai trees, or how to delegate a lattice basis
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Adaptive and composable oblivious transfer protocols (short paper)
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
A framework for practical universally composable zero-knowledge protocols
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
New Techniques for Noninteractive Zero-Knowledge
Journal of the ACM (JACM)
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
A code-based 1-out-of-n oblivious transfer based on mceliece assumptions
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
Standard security does not imply security against selective-opening
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Trapdoors for lattices: simpler, tighter, faster, smaller
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Lossy Trapdoor Functions and Their Applications
SIAM Journal on Computing
Polly cracker, revisited, revisited
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Public-Key cryptography from new multivariate quadratic assumptions
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Efficient password authenticated key exchange via oblivious transfer
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
On definitions of selective opening security
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Extended-DDH and lossy trapdoor functions
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Multi-Committer threshold commitment scheme from lattice
PAISI'12 Proceedings of the 2012 Pacific Asia conference on Intelligence and Security Informatics
Universally composable oblivious transfer from lossy encryption and the mceliece assumptions
ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security
Salus: a system for server-aided secure function evaluation
Proceedings of the 2012 ACM conference on Computer and communications security
Zero-Knowledge proofs with low amortized communication from lattice assumptions
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Calling out cheaters: covert security with public verifiability
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Randomness-Dependent message security
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
International Journal of Applied Cryptography
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Classical hardness of learning with errors
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Zero-knowledge using garbled circuits: how to prove non-algebraic statements efficiently
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Secure pattern matching using somewhat homomorphic encryption
Proceedings of the 2013 ACM workshop on Cloud computing security workshop
Universally composable adaptive oblivious transfer (with access control) from standard assumptions
Proceedings of the 2013 ACM workshop on Digital identity management
Secure outsourced garbled circuit evaluation for mobile devices
SEC'13 Proceedings of the 22nd USENIX conference on Security
On Ideal Lattices and Learning with Errors over Rings
Journal of the ACM (JACM)
Efficient Linear Homomorphic Encryption from LWE Over Rings
Wireless Personal Communications: An International Journal
Public-key searchable encryption from lattices
International Journal of High Performance Systems Architecture
Hi-index | 0.00 |
We propose a simple and general framework for constructing oblivious transfer (OT) protocols that are efficient, universally composable, and generally realizableunder any one of a variety of standard number-theoretic assumptions, including the decisional Diffie-Hellman assumption, the quadratic residuosity and decisional composite residuosity assumptions, and worst-caselattice assumptions.Our OT protocols are round-optimal (one message each way), quite efficient in computation and communication, and can use a single common string for an unbounded number of executions between the same sender and receiver. Furthermore, the protocols can provide statisticalsecurity to either the sender or the receiver, simply by changing the distribution of the common string. For certain instantiations of the protocol, even a common uniformly randomstring suffices.Our key technical contribution is a simple abstraction that we call a dual-modecryptosystem. We implement dual-mode cryptosystems by taking a unified view of several cryptosystems that have what we call "messy" public keys, whose defining property is that a ciphertext encrypted under such a key carries no information(statistically) about the encrypted message.As a contribution of independent interest, we also provide a multi-bit amortizedversion of Regev's lattice-based cryptosystem (STOC 2005) whose time and space complexity are improved by a linear factor in the security parameter n. The resulting amortized encryption and decryption times are only $\tilde{O}(n)$ bit operations per message bit, and the ciphertext expansion can be made as small as a constant; the public key size and underlying lattice assumption remain essentially the same.