Bounded-concurrent secure two-party computation without setup assumptions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Bounded-concurrent secure multi-party computation with a dishonest majority
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
New and improved constructions of non-malleable cryptographic protocols
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Concurrent Non-Malleable Commitments
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Lower bounds for non-black-box zero knowledge
Journal of Computer and System Sciences - Special issue on FOCS 2003
Foundations of cryptography: a primer
Foundations and Trends® in Theoretical Computer Science
Searchable symmetric encryption: improved definitions and efficient constructions
Proceedings of the 13th ACM conference on Computer and communications security
Delegating computation: interactive proofs for muggles
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Information Security and Cryptology
Succinct NP Proofs from an Extractability Assumption
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
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
Proceedings of the forty-first annual ACM symposium on Theory of computing
On the Insecurity of the Fiat-Shamir Signatures with Iterative Hash Functions
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
Parallel repetition of computationally sound protocols revisited
TCC'07 Proceedings of the 4th conference on Theory of cryptography
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Evaluating branching programs on encrypted data
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Round efficiency of multi-party computation with a dishonest majority
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Public key encryption that allows PIR queries
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
The complexity of zero knowledge
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
On the round complexity of covert computation
Proceedings of the forty-second ACM symposium on Theory of computing
Improved delegation of computation using fully homomorphic encryption
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Computational soundness of symbolic zero-knowledge proofs
Journal of Computer Security - 7th International Workshop on Issues in the Theory of Security (WITS'07)
On obfuscating programs with tamper-proof hardware
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
On round-efficient argument systems
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Single-prover concurrent zero knowledge in almost constant rounds
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
You can prove so many things in zero-knowledge
CISC'05 Proceedings of the First SKLOIS conference on Information Security and Cryptology
Handling expected polynomial-time strategies in simulation-based security proofs
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Sufficient conditions for collision-resistant hashing
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
TCC'06 Proceedings of the Third conference on Theory of Cryptography
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On efficient zero-knowledge PCPs
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
The knowledge tightness of parallel zero-knowledge
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
On the Composition of Public-Coin Zero-Knowledge Protocols
SIAM Journal on Computing
Salus: a system for server-aided secure function evaluation
Proceedings of the 2012 ACM conference on Computer and communications security
On constant-round precise zero-knowledge
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
Concurrent zero knowledge in the bounded player model
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Implementing resettable UC-Functionalities with untrusted tamper-proof hardware-tokens
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Non-black-box simulation in the fully concurrent setting
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Non-black-box simulation from one-way functions and applications to resettable security
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Searchable symmetric encryption: Improved definitions and efficient constructions
Journal of Computer Security
| Hi-index | 0.00 |
We put forward a new type of computationally-sound proof systems, called universal-arguments, which are related but different from both CS-proofs (as defined by Micali) and arguments (as defined by Brassard, Chaum and Crepeau). In particular, we adopt the instance-based prover-efficiency paradigm of CS-proofs, but follow the computational-soundness condition of argument systems (i.e., we consider only cheating strategies that are implementable by polynomial-size circuits).We show that universal-arguments can be constructed based on standard intractability assumptions that refer to polynomial-size circuits (rather than assumptions referring to subexponential-size circuits as used in the construction of CS-proofs). As an application of universal-arguments, we weaken the intractability assumptions used in the recent non-black-box zero-knowledge arguments of Barak. Specifically, we only utilize intractability assumptions that refer to polynomial-size circuits (rather than assumptions referring to circuits of some "nice" super-polynomial size).