A randomized protocol for signing contracts
Communications of the ACM
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
The complexity of perfect zero-knowledge
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Does co-NP have short interactive proofs?
Information Processing Letters
Multi-prover interactive proofs: how to remove intractability assumptions
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
How to Solve any Protocol Problem - An Efficiency Improvement
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Everything provable is provable in zero-knowledge
CRYPTO '88 Proceedings on Advances in cryptology
Towards optimal simulations of formulas by bounded-width programs
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A general completeness theorem for two party games
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Public-randomness in public-key cryptography (extended abstract)
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
CRYPTO '89 Proceedings on Advances in cryptology
Non-interactive oblivious transfer and applications
CRYPTO '89 Proceedings on Advances in cryptology
Multiparty protocols tolerating half faulty processors
CRYPTO '89 Proceedings on Advances in cryptology
Multiparty computation with faulty majority
CRYPTO '89 Proceedings on Advances in cryptology
Security of quantum protocols against coherent measurements
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
25 years of quantum cryptography
ACM SIGACT News
Correlated pseudorandomness and the complexity of private computations
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Adaptive zero knowledge and computational equivocation (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Commodity-based cryptography (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Multi party computations: past and present
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Robust efficient distributed RSA-key generation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proceedings of the 1998 workshop on New security paradigms
More general completeness theorems for secure two-party computation
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Communication preserving protocols for secure function evaluation
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Secure Computation without Agreement
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Generalized Zig-zag Functions and Oblivious Transfer Reductions
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
New Results on Unconditionally Secure Distributed Oblivious Transfer
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
One-Time Tables for Two-Party Computation
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
The All-or-Nothing Nature of Two-Party Secure Computation
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Oblivious Transfer in the Bounded Storage Model
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Minimal Complete Primitives for Secure Multi-party Computation
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Secure Distributed Linear Algebra in a Constant Number of Rounds
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Achieving Zero-Knowledge Robustly
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Security with Low Communication Overhead
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Hiding Instances in Zero-Knowledge Proof Systems (Extended Abstract)
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Practical Quantum Oblivious Transfer
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Committed Oblivious Transfer and Private Multi-Party Computation
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Precomputing Oblivious Transfer
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference 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
Generation of Shared RSA Keys by Two Parties
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Adaptively Secure Oblivious Transfer
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Oblivious Polynomial Evaluation and Oblivious Neural Learning
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Efficient Oblivious Transfer in the Bounded-Storage Model
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Introduction to Secure Computation
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
The Search for the Holy Grail in Quantum Cryptography
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
Private Selective Payment Protocols
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
Practical Oblivious Transfer Protocols
IH '02 Revised Papers from the 5th International Workshop on Information Hiding
Efficient 1-Out-n Oblivious Transfer Schemes
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Cryptographic techniques for privacy-preserving data mining
ACM SIGKDD Explorations Newsletter
Efficient 1-Out-of-n Oblivious Transfer Schemes with Universally Usable Parameters
IEEE Transactions on Computers
Journal of Complexity - Special issue on coding and cryptography
Completeness in two-party secure computation: a computational view
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Cryptography and mechanism design
TARK '01 Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge
Blind sales in electronic commerce
ICEC '04 Proceedings of the 6th international conference on Electronic commerce
Black-box constructions for secure computation
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The Physics of No-Bit-Commitment: Generalized Quantum Non-Locality Versus Oblivious Transfer
Quantum Information Processing
Privacy-preserving demographic filtering
Proceedings of the 2006 ACM symposium on Applied computing
Oblivious polynomial evaluation and oblivious neural learning
Theoretical Computer Science
Zero-knowledge from secure multiparty computation
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Verifying and decoding in constant depth
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Privacy-preserving remote diagnostics
Proceedings of the 14th ACM conference on Computer and communications security
A (de)constructive approach to program checking
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Cryptography with constant computational overhead
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Efficient Two-Party Secure Computation on Committed Inputs
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Oblivious-Transfer Amplification
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Error-Tolerant Combiners for Oblivious Primitives
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Improved Garbled Circuit: Free XOR Gates and Applications
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Composable Security in the Bounded-Quantum-Storage Model
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Interactive Hashing: An Information Theoretic Tool (Invited Talk)
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
A Single Initialization Server for Multi-party Cryptography
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Statistical Security Conditions for Two-Party Secure Function Evaluation
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Oblivious Transfer Based on the McEliece Assumptions
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Susceptible Two-Party Quantum Computations
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
A Framework for Efficient and Composable Oblivious Transfer
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Founding Cryptography on Oblivious Transfer --- Efficiently
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
New Communication-Efficient Oblivious Transfer Protocols Based on Pairings
ISC '08 Proceedings of the 11th international conference on Information Security
Robust t-out-of-n oblivious transfer mechanism based on CRT
Journal of Network and Computer Applications
Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network 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
Coding-Based Oblivious Transfer
Mathematical Methods in Computer Science
Private multiparty sampling and approximation of vector combinations
Theoretical Computer Science
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Oblivious Transfer from Weak Noisy Channels
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Composing Quantum Protocols in a Classical Environment
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
Black-Box Constructions of Two-Party Protocols from One-Way Functions
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Hidden credential retrieval from a reusable password
Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
On the Security Loss in Cryptographic Reductions
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
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
Strengthening the Security of Distributed Oblivious Transfer
ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Toward empirical aspects of secure scalar product
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews - Special issue on information reuse and integration
Reducing Complexity Assumptions for Oblivious Transfer
IWSEC '09 Proceedings of the 4th International Workshop on Security: Advances in Information and Computer Security
Simple Adaptive Oblivious Transfer without Random Oracle
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Bootstrapped oblivious transfer and secure two-party function computation
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Basing cryptographic protocols on tamper-evident seals
Theoretical Computer Science
Efficient cryptographic protocols based on noisy channels
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Oblivious transfers and privacy amplification
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
How to break a "Secure" oblivious transfer protocol
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Quantum oblivious mutual identification
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Lower bounds for oblivious transfer reductions
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Conditional oblivious transfer and timed-release encryption
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Single database private information retrieval implies oblivious transfer
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Minimal-latency secure function evaluation
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
IH'06 Proceedings of the 8th international conference on Information hiding
Evaluating branching programs on encrypted data
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Efficient multi-party computation over rings
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Cryptography with constant input locality
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
How many oblivious transfers are needed for secure multiparty computation?
CRYPTO'07 Proceedings of the 27th annual international cryptology 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
Alternative protocols for generalized oblivious transfer
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Efficient fully-simulatable oblivious transfer
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
OT-combiners via secure computation
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Semi-honest to malicious oblivious transfer: the black-box way
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Degradation and amplification of computational hardness
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Secure evaluation of private linear branching programs with medical applications
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Worry-free encryption: functional encryption with public keys
Proceedings of the 17th ACM conference on Computer and communications security
Oblivious transfer based on physical unclonable functions
TRUST'10 Proceedings of the 3rd international conference on Trust and trustworthy computing
Interactive locking, zero-knowledge PCPs, and unconditional cryptography
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Password-authenticated session-key generation on the internet in the plain model
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
A zero-one law for cryptographic complexity with respect to computational UC security
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Secure two-party quantum evaluation of unitaries against specious adversaries
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
On the efficiency of classical and quantum oblivious transfer reductions
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Oblivious transfer with timed-release receiver's privacy
Journal of Systems and Software
Generalized oblivious transfer by secret sharing
Designs, Codes and Cryptography
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Unconditional and composable security using a single stateful tamper-proof hardware token
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
Completeness theorems with constructive proofs for finite deterministic 2-party functions
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Efficient non-interactive secure computation
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Concurrent composition in the bounded quantum storage model
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Correlation extractors and their applications
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Randomly encoding functions: a new cryptographic paradigm
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Non-local box complexity and secure function evaluation
Quantum Information & Computation
Robust cryptography in the noisy-quantum-storage model
Quantum Information & Computation
Fully simulatable quantum-secure coin-flipping and applications
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Building oblivious transfer on channel delays
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Physically uncloneable functions in the universal composition framework
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Constant-rate oblivious transfer from noisy channels
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Oblivious transfer and n-variate linear function evaluation
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Secure two-party computation over a Z-channel
ProvSec'11 Proceedings of the 5th international conference on Provable security
Weak oblivious transfer from strong one-way functions
ProvSec'11 Proceedings of the 5th international conference on Provable security
Automatically optimizing secure computation
Proceedings of the 18th ACM conference on Computer and communications security
Complete Fairness in Secure Two-Party Computation
Journal of the ACM (JACM)
Cryptography in constant parallel time
Cryptography in constant parallel time
Unconditionally secure oblivious transfer based on channel delays
ICICS'11 Proceedings of the 13th international conference on Information and communications security
Black-Box Constructions of Protocols for Secure Computation
SIAM Journal on Computing
A weakness in some oblivious transfer and zero-knowledge protocols
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
General public key m-out-of-n oblivious transfer
CIS'04 Proceedings of the First international conference on Computational and Information Science
Gate evaluation secret sharing and secure one-round two-party computation
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Questionable encryption and its applications
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
Universally composable oblivious transfer in the multi-party setting
CT-RSA'06 Proceedings of the 2006 The Cryptographers' Track at the RSA conference on Topics in Cryptology
On complete primitives for fairness
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
On the necessary and sufficient assumptions for UC computation
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Founding cryptography on tamper-proof hardware tokens
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
Efficient k-out-of-n oblivious transfer schemes with adaptive and non-adaptive queries
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Keyword search and oblivious pseudorandom functions
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Unconditional characterizations of non-interactive zero-knowledge
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Constant-round multiparty computation using a black-box pseudorandom generator
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Smooth projective hashing and two-message oblivious transfer
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Multi-party computation with conversion of secret sharing
Designs, Codes and Cryptography
Universally composable quantum multi-party computation
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Hybrid approach for secure mobile agent computations
MADNES'05 Proceedings of the First international conference on Secure Mobile Ad-hoc Networks and Sensors
Oblivious transfer and linear functions
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Communication-efficient distributed oblivious transfer
Journal of Computer and System Sciences
Optimal reductions between oblivious transfers using interactive hashing
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Oblivious transfer is symmetric
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Information-Theoretic conditions for two-party secure function evaluation
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Secure two-party context free language recognition
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Efficient cryptographic protocol design based on distributed el gamal encryption
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
SIMPL systems as a keyless cryptographic and security primitive
Cryptography and Security
Bit commitment in the bounded storage model: tight bound and simple optimal construction
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
The limits of common coins: further results
INDOCRYPT'11 Proceedings of the 12th international conference on Cryptology in India
Long distance quantum cryptography made simple
Quantum Information & Computation
On the existence of loss-tolerant quantum oblivious transfer protocols
Quantum Information & Computation
Identifying cheaters without an honest majority
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
Concurrently secure computation in constant rounds
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Implementing information-theoretically secure oblivious transfer from packet reordering
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
Universally composable oblivious transfer from lossy encryption and the mceliece assumptions
ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security
Statistically secure linear-rate dimension extension for oblivious affine function evaluation
ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security
Private multiparty sampling and approximation of vector combinations
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Practical security analysis of PUF-based two-player protocols
CHES'12 Proceedings of the 14th international conference on Cryptographic Hardware and Embedded Systems
Improved secure two-party computation via information-theoretic garbled circuits
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Completeness for symmetric two-party functionalities - revisited
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
A unified framework for UC from only OT
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Feasibility and completeness of cryptographic tasks in the quantum world
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
On the feasibility of extending oblivious transfer
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
On the power of correlated randomness in secure computation
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Shielding circuits with groups
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Interactive proofs of proximity: delegating computation in sublinear time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Private interactive communication across an adversarial channel
Proceedings of the 5th conference on Innovations in theoretical computer science
Iterated group products and leakage resilience against NC1
Proceedings of the 5th conference on Innovations in theoretical computer science
On oblivious transfer capacity
Information Theory, Combinatorics, and Search Theory
On the connectivity preserving minimum cut problem
Journal of Computer and System Sciences
| Hi-index | 0.01 |
Suppose your netmail is being erratically censored by Captain Yossarian. Whenever you send a message, he censors each bit of the message with probability 1/2, replacing each censored bit by some reserved character. Well versed in such concepts as redundancy, this is no real problem to you. The question is, can it actually be turned around and used to your advantage? We answer this question strongly in the affirmative. We show that this protocol, more commonly known as oblivious transfer, can be used to simulate a more sophisticated protocol, known as oblivious circuit evaluation([Y]). We also show that with such a communication channel, one can have completely noninteractive zero-knowledge proofs of statements in NP. These results do not use any complexity-theoretic assumptions. We can show that they have applications to a variety of models in which oblivious transfer can be done.