Non-interactive zero-knowledge and its applications
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Simple constant-time consensus protocols in realistic failure models
Journal of the ACM (JACM)
Knowledge, probability, and adversaries
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy
Journal of the ACM (JACM)
Proving security against chosen cyphertext attacks
CRYPTO '88 Proceedings on Advances in cryptology
On generating solved instances of computational problems
CRYPTO '88 Proceedings on Advances in cryptology
Abuses in cryptography and how to fight them
CRYPTO '88 Proceedings on Advances in cryptology
Witness indistinguishable and witness hiding protocols
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Public-key cryptosystems provably secure against chosen ciphertext attacks
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Perfect zero-knowledge in constant rounds
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The (true) complexity of statistical zero knowledge
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
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
General public key residue cryptosystems and mental poker protocols
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
A remark on efficiency of identification schemes
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Resiliency of interactive distributed tasks (extended abstracts)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Journal of the ACM (JACM)
Making conditionally secure cryptosystems unconditionally abuse-free in a general context
CRYPTO '89 Proceedings on Advances in cryptology
Sparse pseudorandom distributions (extended abstract)
CRYPTO '89 Proceedings on Advances in cryptology
CRYPTO '89 Proceedings on Advances in cryptology
Efficient identification schemes using two prover interactive proofs
CRYPTO '89 Proceedings on Advances in cryptology
On the concrete complexity of zero-knowledge proofs
CRYPTO '89 Proceedings on Advances in cryptology
Zero knowledge proofs of knowledge in two rounds
CRYPTO '89 Proceedings on Advances in cryptology
Multiparty protocols tolerating half faulty processors
CRYPTO '89 Proceedings on Advances in cryptology
How convincing is your protocol?
ACM SIGACT News
On the hardness of computing the permanent of random matrices (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Making zero-knowledge provers efficient
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A note on efficient zero-knowledge proofs and arguments (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Finite state verifiers I: the power of interaction
Journal of the ACM (JACM)
Finite state verifiers II: zero knowledge
Journal of the ACM (JACM)
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Knowledge, probability, and adversaries
Journal of the ACM (JACM)
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Towards practical “proven secure” authenticated key distribution
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Reasoning about knowledge and probability
Journal of the ACM (JACM)
A taxonomy of proof systems (part 2)
ACM SIGACT News
PSPACE is provable by two provers in one round
Journal of Computer and System Sciences
The random oracle hypothesis is false
Journal of Computer and System Sciences
Practical and provably secure release of a secret and exchange of signatures
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Interactive hashing simplifies zero-knowledge protocol design
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Improved privacy in wallets with observers
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Two prover protocols: low error at affordable rates
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
How to share a function securely
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Computational complexity and knowledge complexity (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Simple strategies for large zero-sum games with applications to complexity theory
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Designing programs that check their work
Journal of the ACM (JACM)
A formalization of the Turing test
ACM SIGART Bulletin
Knowledge on the average—perfect, statistical and logarithmic
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Correlated pseudorandomness and the complexity of private computations
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Witness-based cryptographic program checking and robust function sharing
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
On relationships between statistical zero-knowledge proofs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Language design and standardization
TRI-Ada '90 Proceedings of the conference on TRI-ADA '90
Formal specification techniques (extended abstract)
ICSE '94 Proceedings of the 16th international conference on Software engineering
Private information storage (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Linear zero-knowledge—a note on efficient zero-knowledge proofs and arguments
STOC '97 Proceedings of the twenty-ninth 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
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Probabilistically checkable proofs with zero knowledge
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Making games short (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
A General Zero-Knowledge Scheme
Designs, Codes and Cryptography
Proceedings of the 4th ACM conference on Computer and communications security
Proactive public key and signature systems
Proceedings of the 4th ACM conference on Computer and communications security
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
On the limits of non-approximability of lattice problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Non-interactive and non-malleable commitment
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Robust efficient distributed RSA-key generation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Communication-efficient anonymous group identification
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Sim: a utility for detecting similarity in computer programs
SIGCSE '99 The proceedings of the thirtieth SIGCSE technical symposium on Computer science education
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Security-preserving hardness-amplification for any regular one-way function
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Proceedings of the 1998 workshop on New security paradigms
Anonymous authentication with subset queries (extended abstract)
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
On transformation of interactive proofs that preserve the prover's complexity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Resettable zero-knowledge (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On zero-knowledge proofs (extended abstract): “from membership to decision”
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Information Security, Mathematics, and Public-Key Cryptography
Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
A Protocol to Achieve Independence in Constant Rounds
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the 7th ACM conference on Computer and communications security
Composition and integrity preservation of secure reactive systems
Proceedings of the 7th ACM conference on Computer and communications security
Concurrent and resettable zero-knowledge in poly-loalgorithm rounds
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Black-box concurrent zero-knowledge requires \tilde {Ω} (logn) rounds
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Paillier's cryptosystem revisited
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Efficient generation of shared RSA keys
Journal of the ACM (JACM)
2-round zero knowledge and proof auditors
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Concurrent zero-knowledge with timing, revisited
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Strict polynomial-time in simulation and extraction
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Universally composable two-party and multi-party secure computation
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Asynchronous verifiable secret sharing and proactive cryptosystems
Proceedings of the 9th ACM conference on Computer and communications security
Some facets of complexity theory and cryptography: A five-lecture tutorial
ACM Computing Surveys (CSUR)
A complete problem for statistical zero knowledge
Journal of the ACM (JACM)
The Complexity of the Extended GCD Problem
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
How to Construct Fail-Stop Confirmer Signature Schemes
ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
A New Identification Scheme Based on the Bilinear Diffie-Hellman Problem
ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Many-Valued Logics and Holographic Proofs
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Non-Interactive Zero-Knowledge: A Low-Randomness Characterization of NP
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
On Interactive Proofs with a Laconic Prover
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently while Concealing it
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
The Query Complexity of Program Checking by Constant-Depth Circuits
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Cryptographically Sound and Machine-Assisted Verification of Security Protocols
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Strong Solutions to the Identification Problem
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
On Concurrent Zero-Knowledge with Pre-processing
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
The All-or-Nothing Nature of Two-Party Secure Computation
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Auditable, Anonymous Electronic Cash Extended Abstract
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Adaptive Security for Threshold Cryptosystems
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
A Cryptographic Solution to a Game Theoretic Problem
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
A Note on the Round-Complexity of Concurrent Zero-Knowledge
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Soundness in the Public-Key Model
CRYPTO '01 Proceedings of the 21st 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
Robust Non-interactive Zero Knowledge
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Identification Tokens - or: Solving the Chess Grandmaster Problem
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Interactive Proofs with Provable Security Against Honest Verifiers
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Crptograpic Applications of the Non-Interactive Metaproof and Many-Prover Systems
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
Fair Computation of General Functions in Presence of Immoral Majority
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Multi-Language Zero Knowledge Interactive Proof Systems
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Deriving the Complete Knowledge of Participants in Cryptographic Protocols (Extended Abstract)
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Interactive Proofs with Space Bounded Provers
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Foundations of Secure Interactive Computing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
On the Discrepancy between Serial and Parallel of Zero-Knowledge Protocols (Extended Abstract)
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent (Extended Abstract)
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
On Message Proof Systems with Known Space Verifiers
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Secret Sharing and Perfect Zero Knowledge
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
A Low Communication Competitive Interactive Proof System for Promised Quadratic Residuosity
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
An Identity-Based Signature Scheme with Bounded Life-Span
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Designated Confirmer Signatures and Public-Key Encryption are Equivalent
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Language Dependent Secure Bit Commitment
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Improved Efficient Arguments (Preliminary Version)
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Honest Verifier vs Dishonest Verifier in Public Cain Zero-Knowledge Proofs
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Security of 2^t-Root Identification and Signatures
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Robust and Efficient Sharing of RSA Functions
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Proving Without Knowing: On Oblivious, Agnostic and Blindolded Provers
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Min-round Resettable Zero-Knowledge in the Public-Key Model
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
How to Convert the Flavor of a Quantum Bit Commitment
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Identification Protocols Secure against Reset Attacks
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Universally Composable Notions of Key Exchange and Secure Channels
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications 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
Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A Note on Security Proofs in the Generic Model
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Responsive Round Complexity and Concurrent Zero-Knowledge
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Informatics - 10 Years Back. 10 Years Ahead.
Signing Contracts and Paying Electronically
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
FC '01 Proceedings of the 5th International Conference on Financial Cryptography
FC '01 Proceedings of the 5th International Conference on Financial Cryptography
On the Security of Homage Group Authentication Protocol
FC '01 Proceedings of the 5th International Conference on Financial Cryptography
Private Selective Payment Protocols
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
Zero-Knowledge Watermark Detection and Proof of Ownership
IHW '01 Proceedings of the 4th International Workshop on Information Hiding
Non-interactive Cryptosystem for Entity Authentication
ISW '99 Proceedings of the Second International Workshop on Information Security
Equitability in Retroactive Data Confiscation versus Proactive Key Escrow
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Removing Complexity Assumptions from Concurrent Zero-Knowledge Proofs
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
How to Utilize the Randomness of Zero-Knowledge Proofs
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
On Defining Proofs of Knowledge
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Commitment Schemes and Zero-Knowledge Protocols
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
PSPACE has constant-round quantum interactive proof systems
Theoretical Computer Science - Algorithms,automata, complexity and games
Adiabatic quantum state generation and statistical zero knowledge
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Non-interactive and reusable non-malleable commitment schemes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Simmons' protocol is not free of subliminal channels
CSFW '96 Proceedings of the 9th IEEE workshop on Computer Security Foundations
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Non-Interactive CryptoComputing For NC1
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Quantum multi-prover interactive proof systems with limited prior entanglement
Journal of Computer and System Sciences
An asynchronous protocol for distributed computation of RSA inverses and its applications
Proceedings of the twenty-second annual symposium on Principles of distributed computing
A secure and private system for subscription-based remote services
ACM Transactions on Information and System Security (TISSEC)
Magic Functions: In Memoriam: Bernard M. Dwork 1923--1998
Journal of the ACM (JACM)
Efficient 1-Out-of-n Oblivious Transfer Schemes with Universally Usable Parameters
IEEE Transactions on Computers
Electronic Commerce Research
Efficient Undeniable Signature Schemes Based on Ideal Arithmetic in Quadratic Orders
Designs, Codes and Cryptography
Cryptography and cryptographic protocols
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
On interactive proofs with a laconic prover
Computational Complexity
Privacy preserving database application testing
Proceedings of the 2003 ACM workshop on Privacy in the electronic society
Asynchronous group key exchange with failures
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
TARK '94 Proceedings of the 5th conference on Theoretical aspects of reasoning about knowledge
Cryptography and mechanism design
TARK '01 Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge
Digital multi-signature scheme based on the elliptic curve cryptosystem
Journal of Computer Science and Technology
Journal of the ACM (JACM)
Interactive and Probabilistic Proof of Mobile Code Safety
Automated Software Engineering
Simple extractors for all min-entropies and a new pseudorandom generator
Journal of the ACM (JACM)
Beyond NP: the work and legacy of Larry Stockmeyer
Proceedings of the thirty-seventh 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 general composition of secure protocols in the timing model
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A secure and scalable group key exchange system
Information Processing Letters
Policy-hiding access control in open environment
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed 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
Quantum Information and the PCP Theorem
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
New approaches for deniable authentication
Proceedings of the 12th ACM conference on Computer and communications security
Private approximation of search problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Zero knowledge with efficient provers
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
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
Progress in computational complexity theory
Journal of Computer Science and Technology
LWPP and WPP are not uniformly gap-definable
Journal of Computer and System Sciences
Zero-knowledge watermark detector robust to sensitivity attacks
MM&Sec '06 Proceedings of the 8th workshop on Multimedia and security
Foundations of cryptography: a primer
Foundations and Trends® in Theoretical Computer Science
Deniable authentication and key exchange
Proceedings of the 13th ACM conference on Computer and communications security
Journal of Computer and System Sciences
Concurrently-secure credential ownership proofs
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Hybrid commitments and their applications to zero-knowledge proof systems
Theoretical Computer Science
The PCP theorem by gap amplification
Journal of the ACM (JACM)
Zero-knowledge from secure multiparty computation
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
An efficient parallel repetition theorem for Arthur-Merlin games
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
Toward a general theory of quantum games
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Complexity of Ring Morphism Problems
Computational Complexity
Pseudorandomness for Approximate Counting and Sampling
Computational Complexity
The reactive simulatability (RSIM) framework for asynchronous systems
Information and Computation
Blacklistable anonymous credentials: blocking misbehaving users without ttps
Proceedings of the 14th ACM conference on Computer and communications security
Pors: proofs of retrievability for large files
Proceedings of the 14th ACM conference on Computer and communications security
Analyzing Security Protocols Using Time-Bounded Task-PIOAs
Discrete Event Dynamic Systems
Efficient zero-knowledge watermark detection with improved robustness to sensitivity attacks
EURASIP Journal on Information Security
Delegating computation: interactive proofs for muggles
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Universal semantic communication I
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Protocol completion incentive problems in cryptographic Vickrey auctions
Electronic Commerce Research
On the cunning power of cheating verifiers: Some observations about zero knowledge proofs
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Beyond nash equilibrium: solution concepts for the 21st century
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
How to protect privacy in floating car data systems
Proceedings of the fifth ACM international workshop on VehiculAr Inter-NETworking
Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Zero Knowledge and Soundness Are Symmetric
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Information Security and Cryptology
Deniable Authentication on the Internet
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
Composable Formal Security Analysis: Juggling Soundness, Simplicity and Efficiency
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Statistical Security Conditions for Two-Party Secure Function Evaluation
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Simplified Submission of Inputs to Protocols
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Probabilistic Proof Systems: A Primer
Foundations and Trends® in Theoretical Computer Science
PEREA: towards practical TTP-free revocation in anonymous authentication
Proceedings of the 15th ACM conference on Computer and communications security
Improved Security Notions and Protocols for Non-transferable Identification
ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
Probabilistically checkable proofs
Communications of the ACM - Being Human in the Digital Age
On the Security of Beth's Identification Schemes against Active and Concurrent Adversaries
Mathematical Methods in Computer Science
An application of quantum finite automata to interactive proof systems
Journal of Computer and System Sciences
Composability and On-Line Deniability of Authentication
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Zero-Knowledge Proofs with Witness Elimination
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Efficient zero-knowledge identification schemes which respect privacy
Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
Efficient Concurrent npoly(logn)-Simulatable Argument of Knowledge
ISPEC '09 Proceedings of the 5th International Conference on Information Security Practice and Experience
On the Portability of Generalized Schnorr Proofs
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
Non-malleability amplification
Proceedings of the forty-first annual ACM symposium on Theory of computing
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
An active trust model based on zero knowledge proofs for airborne networks
Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies
An Observation on Non-Malleable Witness-Indistinguishability and Non-Malleable Zero-Knowledge
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Efficient Deniable Authentication for Signatures
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
An epistemic characterization of zero knowledge
Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge
Threshold Attribute-Based Signatures and Their Application to Anonymous Credential Systems
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Unifying Zero-Knowledge Proofs of Knowledge
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Co-sound Zero-Knowledge with Public Keys
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Proceedings of the 23rd Annual IFIP WG 11.3 Working Conference on Data and Applications Security XXIII
Universally Composable Adaptive Priced Oblivious Transfer
Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
On Tamper-Resistance from a Theoretical Viewpoint
CHES '09 Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems
Verifying Anonymous Credential Systems in Applied Pi Calculus
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Zero Knowledge in the Random Oracle Model, Revisited
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
The Role of Agent Interaction in Models of Computing: Panelist Reviews
Electronic Notes in Theoretical Computer Science (ENTCS)
Real-or-random Key Secrecy of the Otway-Rees Protocol via a Symbolic Security Proof
Electronic Notes in Theoretical Computer Science (ENTCS)
The relativized relationship between probabilistically checkable debate systems, IP and PSPACE
Information Processing Letters
A secure and scalable Group Key Exchange system
Information Processing Letters
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
Homomorphisms of secret sharing schemes: a tool for verifiable signature sharing
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Efficient multiplicative sharing schemes
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Equivocable oblivious transfer
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
On the security of a practical identification scheme
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Robust threshold DSS signatures
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
New convertible undeniable signature schemes
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Fast and secure immunization against adaptive man-in-the-middle impersonation
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Round-optimal zero-knowledge arguments based on any one-way function
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
Incremental cryptography and memory checkers
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
EUROCRYPT'91 Proceedings of the 10th 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
Cryptographic protocols provably secure against dynamic adversaries
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
On the efficiency of group signatures providing information-theoretic anonymity
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Server(prover/signer)-aided verification of identity proofs and signatures
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Securing traceability of ciphertexts: towards a secure software key escrow system
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Recycling random bits in composed perfect zero-knowledge
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
Efficient concurrent zero-knowledge in the auxiliary string model
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Cryptographic and physical zero-knowledge proof systems for solutions of sudoku puzzles
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Lower bounds for non-interactive zero-knowledge
TCC'07 Proceedings of the 4th conference on Theory of cryptography
TCC'07 Proceedings of the 4th conference on Theory of cryptography
One-way permutations, interactive hashing and statistically hiding commitments
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Simulatable commitments and efficient concurrent zero-knowledge
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Simulation in quasi-polynomial time, and its application to protocol composition
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Strengthening zero-knowledge protocols using signatures
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Equivocable and extractable commitment schemes
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
A signature scheme with efficient protocols
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Efficient zero-knowledge proofs for some practical graph problems
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Threshold anonymous group identification and zero-knowledge proof
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Ninja: non identity based, privacy preserving authentication for ubiquitous environments
UbiComp '07 Proceedings of the 9th international conference on Ubiquitous computing
Universally-composable two-party computation in two rounds
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Cryptography in the multi-string model
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Complex zero-knowledge proofs of knowledge are easy to use
ProvSec'07 Proceedings of the 1st international conference on Provable security
Concurrent statistical zero-knowledge arguments for NP from one way functions
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
The complexity of zero knowledge
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Enhancing the trust and perceived security in e-cognocracy
VOTE-ID'07 Proceedings of the 1st international conference on E-voting and identity
Sub-linear zero-knowledge argument for correctness of a shuffle
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Efficient non-interactive proof systems for bilinear groups
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Secure cryptographic precomputation with insecure memory
ISPEC'08 Proceedings of the 4th international conference on Information security practice and experience
PPAA: peer-to-peer anonymous authentication
ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
A zero-knowledge proof of digital signature scheme based on the elliptic curve cryptosystem
IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
Incrementally verifiable computation or proofs of knowledge imply time/space efficiency
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Which languages have 4-round zero-knowledge proofs?
TCC'08 Proceedings of the 5th conference on Theory of cryptography
How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge
TCC'08 Proceedings of the 5th conference on Theory of cryptography
General properties of quantum zero-knowledge proofs
TCC'08 Proceedings of the 5th conference on Theory of cryptography
An equivalence between zero knowledge and commitments
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Interactive and noninteractive zero knowledge are equivalent in the help model
TCC'08 Proceedings of the 5th conference on Theory of cryptography
The round-complexity of black-box zero-knowledge: a combinatorial characterization
TCC'08 Proceedings of the 5th conference on Theory of cryptography
On constant-round concurrent zero-knowledge
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Concurrent non-malleable commitments from any one-way function
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Proceedings of the forty-second ACM symposium on Theory of computing
Modeling complexity in secure distributed computing
Future directions in distributed computing
Security approaches in e-cognocracy
Computer Standards & Interfaces
Jack: scalable accumulator-based nymble system
Proceedings of the 9th annual ACM workshop on Privacy in the electronic society
Private memoirs of a smart meter
Proceedings of the 2nd ACM Workshop on Embedded Sensing Systems for Energy-Efficiency in Building
BLAC: Revoking Repeatedly Misbehaving Anonymous Users without Relying on TTPs
ACM Transactions on Information and System Security (TISSEC)
From secrecy to soundness: efficient verification via secure computation
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Collaborative, privacy-preserving data aggregation at scale
PETS'10 Proceedings of the 10th international conference on Privacy enhancing technologies
PETS'10 Proceedings of the 10th international conference on Privacy enhancing technologies
Interactive locking, zero-knowledge PCPs, and unconditional cryptography
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Concurrent non-malleable zero knowledge proofs
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Non-interactive verifiable computing: outsourcing computation to untrusted workers
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Improved delegation of computation using fully homomorphic encryption
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Other complexity classes and measures
Algorithms and theory of computation handbook
On the round complexity of zero-knowledge proofs based on one-way permutations
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Beyond Lamport's happened-before: on the role of time bounds in synchronous systems
DISC'10 Proceedings of the 24th international conference on Distributed computing
Secure electronic bills of lading: blind counts and digital signatures
Electronic Commerce Research
On server trust in private proxy auctions
Electronic Commerce Research
Computational soundness of symbolic zero-knowledge proofs
Journal of Computer Security - 7th International Workshop on Issues in the Theory of Security (WITS'07)
Regulatory compliant oblivious RAM
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
On RFID privacy with mutual authentication and tag corruption
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
A general, flexible and efficient proof of inclusion and exclusion
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Securization of policy making social computing. An application to e-cognocracy
Computers in Human Behavior
Concurrent non-malleable zero knowledge with adaptive inputs
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Toward practical and unconditional verification of remote computations
HotOS'13 Proceedings of the 13th USENIX conference on Hot topics in operating systems
Limits of provable security from standard assumptions
Proceedings of the forty-third annual ACM symposium on Theory of computing
Towards a game theoretic view of secure computation
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
On constant-round concurrent non-malleable proof systems
Information Processing Letters
On parallel composition of zero-knowledge proofs with black-box quantum simulators
Quantum Information & Computation
Identification schemes from key encapsulation mechanisms
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Studies in complexity and cryptography
Another proof that BPP ⊆ PH (and more)
Studies in complexity and cryptography
Studies in complexity and cryptography
On probabilistic versus deterministic provers in the definition of proofs of knowledge
Studies in complexity and cryptography
On the complexity of computational problems regarding distributions
Studies in complexity and cryptography
Studies in complexity and cryptography
On security preserving reductions - revised terminology
Studies in complexity and cryptography
Verifiable delegation of computation over large datasets
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Classical cryptographic protocols in a quantum world
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
PEREA: Practical TTP-free revocation of repeatedly misbehaving anonymous users
ACM Transactions on Information and System Security (TISSEC)
Proofs of ownership in remote storage systems
Proceedings of the 18th ACM conference on Computer and communications security
Journal of the ACM (JACM)
Using zero knowledge to share a little knowledge: bootstrapping trust in device networks
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Cryptography in constant parallel time
Cryptography in constant parallel time
Trust extension as a mechanism for secure code execution on commodity computers
Trust extension as a mechanism for secure code execution on commodity computers
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
Revisiting colored networks and privacy preserving censorship
CRITIS'06 Proceedings of the First international conference on Critical Information Infrastructures Security
Practical verified computation with streaming interactive proofs
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Quantum interactive proofs with weak error bounds
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Re-identifying anonymous nodes
LoCA'06 Proceedings of the Second international conference on Location- and Context-Awareness
SZK proofs for black-box group problems
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Entanglement in interactive proof systems with binary answers
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Independent zero-knowledge sets
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
An efficient compiler from Σ-protocol to 2-move deniable zero-knowledge
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Universal designated verifier signature proof (or how to efficiently prove knowledge of a signature)
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
IWDW'05 Proceedings of the 4th international conference on Digital Watermarking
Hybrid trapdoor commitments and their applications
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Concurrent zero knowledge in the public-key model
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On the role definitions in and beyond cryptography
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
Testing disjointness of private datasets
FC'05 Proceedings of the 9th international conference on Financial Cryptography and Data Security
Short threshold signature schemes without random oracles
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
You can prove so many things in zero-knowledge
CISC'05 Proceedings of the First SKLOIS conference on Information Security and Cryptology
An unbounded simulation-sound non-interactive zero-knowledge proof system for NP
CISC'05 Proceedings of the First SKLOIS conference on Information Security and Cryptology
Practical zero-knowledge arguments from Σ-protocols
WINE'05 Proceedings of the First international conference on Internet and Network Economics
A dolev-yao model for zero knowledge
ASIAN'09 Proceedings of the 13th Asian conference on Advances in Computer Science: information Security and Privacy
An efficient parallel repetition theorem
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Eye for an eye: efficient concurrent zero-knowledge in the timing model
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Composition of zero-knowledge proofs with efficient provers
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Private coins versus public coins in zero-knowledge proof systems
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
OACerts: oblivious attribute certificates
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Computational complexity since 1980
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Time-bounded task-PIOAs: a framework for analyzing security protocols
DISC'06 Proceedings of the 20th international conference on Distributed Computing
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
Universally composable DKG with linear number of exponentiations
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
Handling expected polynomial-time strategies in simulation-based security proofs
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Error correction in the bounded storage model
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Quantum interactive proofs with competing provers
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Different approaches to proof systems
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Impossibility and feasibility results for zero knowledge with public keys
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Secure computation without authentication
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
A fast cryptanalysis of the isomorphism of polynomials with one secret problem
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
An application of quantum finite automata to interactive proof systems (extended abstract)
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
A theory of goal-oriented communication
Journal of the ACM (JACM)
Conditional reactive simulatability
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Relations among security notions for undeniable signature schemes
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Non-interactive zaps and new techniques for NIZK
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Concurrent zero-knowledge with timing, revisited
Theoretical Computer Science
Theoretical Computer Science
Cryptanalysis of an efficient proof of knowledge of discrete logarithm
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Efficiency tradeoffs for malicious two-party computation
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
BGN authentication and its extension to convey message commitments
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Syntax-Driven private evaluation of quantified membership queries
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
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
Watermarking security: a survey
Transactions on Data Hiding and Multimedia Security I
Playing savitch and cooking games
Concurrency, Compositionality, and Correctness
The church-turing thesis: breaking the myth
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Concurrent zero knowledge without complexity assumptions
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Games and the impossibility of realizable ideal functionality
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Universally composable symbolic analysis of mutual authentication and key-exchange protocols
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Efficient zero-knowledge arguments from two-tiered homomorphic commitments
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Constructive cryptography --- a new paradigm for security definitions and proofs
TOSCA'11 Proceedings of the 2011 international conference on Theory of Security and Applications
Designated confirmer signatures with unified verification
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Cryptography from learning parity with noise
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Complete problem for perfect zero-knowledge quantum proof
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
The Computational Complexity of Nash Equilibria in Concisely Represented Games
ACM Transactions on Computation Theory (TOCT)
On efficient zero-knowledge PCPs
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Resettable statistical zero knowledge
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
Randomness condensers for efficiently samplable, seed-dependent sources
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Research notes: Attacks on an ID-based signature scheme based on Rabin's public key cryptosystem
Computer Communications
Concurrently secure computation in constant rounds
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
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
Computer Science Review
Securing cloud-based computations against malicious providers
ACM SIGOPS Operating Systems Review
On the Composition of Public-Coin Zero-Knowledge Protocols
SIAM Journal on Computing
Private and verifiable interdomain routing decisions
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Integrity verification of cloud-hosted data analytics computations
Proceedings of the 1st International Workshop on Cloud Intelligence
An efficient and secure data sharing framework using homomorphic encryption in the cloud
Proceedings of the 1st International Workshop on Cloud Intelligence
Privacy-preserving back-propagation and extreme learning machine algorithms
Data & Knowledge Engineering
The shy mayor: private badges in geosocial networks
ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
Strictly-black-box zero-knowledge and efficient validation of financial transactions
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Taking proof-based verified computation a few steps closer to practicality
Security'12 Proceedings of the 21st USENIX conference on Security symposium
A general, flexible and efficient proof of inclusion and exclusion
INTRUST'11 Proceedings of the Third international conference on Trusted Systems
Securing cloud-based computations against malicious providers
Proceedings of the 1st European Workshop on Dependable Cloud Computing
Zero-Knowledge proofs via polynomial representations
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Private and verifiable interdomain routing decisions
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
Publicly verifiable delegation of large polynomials and matrix computations, with applications
Proceedings of the 2012 ACM conference on Computer and communications security
PERM: practical reputation-based blacklisting without TTPS
Proceedings of the 2012 ACM conference on Computer and communications security
A Parallel Repetition Theorem for Constant-Round Arthur-Merlin Proofs
ACM Transactions on Computation Theory (TOCT)
A characterization of non-interactive instance-dependent commitment-schemes (NIC)
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
On the (non-)equivalence of UC security notions
ProvSec'12 Proceedings of the 6th international conference on Provable Security
AUDIO: an integrity auditing framework of outlier-mining-as-a-service systems
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II
Efficiency limitations of Σ-protocols for group homomorphisms revisited
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Can theories be tested?: a cryptographic treatment of forecast testing
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
On the power of many one-bit provers
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
An equational approach to secure multi-party computation
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
On the power of nonuniformity in proofs of security
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Secure ID-based linkable and revocable-iff-linked ring signature with constant-size construction
Theoretical Computer Science
Concurrent non-malleable witness indistinguishable argument from any one-way function
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
A note on constant-round concurrent zero-knowledge arguments of knowledge for NP
IDCS'12 Proceedings of the 5th international conference on Internet and Distributed Computing Systems
On constant-round precise zero-knowledge
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
A leakage-resilient zero knowledge proof for lattice problem
CSS'12 Proceedings of the 4th international conference on Cyberspace Safety and Security
Why “fiat-shamir for proofs” lacks a proof
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Languages with efficient zero-knowledge PCPs are in SZK
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Succinct non-interactive arguments via linear interactive proofs
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Multi-Client non-interactive verifiable computation
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Algebraic (trapdoor) one-way functions and their applications
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
POST'13 Proceedings of the Second international conference on Principles of Security and Trust
Delegation of computation with verification outsourcing: curious verifiers
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Recursive composition and bootstrapping for SNARKS and proof-carrying data
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
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
Interactive proofs of proximity: delegating computation in sublinear time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Guest column: the quantum PCP conjecture
ACM SIGACT News
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
ACM SIGOPS 24th Symposium on Operating Systems Principles
Verifying computations with state
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
Verifying the correctness of remote executions: from wild implausibility to near practicality
Proceedings of the 9th Workshop on Hot Topics in Dependable Systems
Result integrity verification of outsourced frequent itemset mining
DBSec'13 Proceedings of the 27th international conference on Data and Applications Security and Privacy XXVII
ZQL: a compiler for privacy-preserving data processing
SEC'13 Proceedings of the 22nd USENIX conference on Security
Cryptography miracles, secure auctions, matching problem verification
Communications of the ACM
Outsourcing computation of modular exponentiations in cloud computing
Cluster Computing
| Hi-index | 0.02 |