Optimal trade-off for Merkle tree traversal
Theoretical Computer Science
Hybrid commitments and their applications to zero-knowledge proof systems
Theoretical Computer Science
Property-Based Attestation without a Trusted Third Party
ISC '08 Proceedings of the 11th international conference on Information Security
A Distributed Implementation of the Certified Information Access Service
ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
Hiding a Needle in a Haystack Using Negative Databases
Information Hiding
Efficient Protocols for Set Membership and Range Proofs
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
A Generic Scheme for Zero-Knowledge Sets
Proceedings of the 2005 conference on Applied Public Key Infrastructure: 4th International Workshop: IWAP 2005
Evaluating branching programs on encrypted data
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Distributed certified information access for mobile devices
WISTP'07 Proceedings of the 1st IFIP TC6 /WG8.8 /WG11.2 international conference on Information security theory and practices: smart cards, mobile and ubiquitous computing systems
Zero-knowledge sets with short proofs
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Super-efficient verification of dynamic outsourced databases
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
Authentic time-stamps for archival storage
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
WORM-SEAL: trustworthy data retention and verification for regulatory compliance
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
A new efficient construction for non-malleable zero-knowledge sets
WISA'10 Proceedings of the 11th international conference on Information security applications
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
(If) size matters: size-hiding private set intersection
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Algebraic construction for zero-knowledge sets
Journal of Computer Science and Technology
Verifiable delegation of computation over large datasets
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Implementing a tamper-evident database system
ASIAN'05 Proceedings of the 10th Asian Computing Science conference on Advances in computer science: data management on the web
Protecting data privacy through hard-to-reverse negative databases
ISC'06 Proceedings of the 9th international conference on Information Security
Independent zero-knowledge sets
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Updatable zero-knowledge databases
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Computational bounds on hierarchical data processing with applications to information security
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Verified query results from hybrid authentication trees
DBSec'05 Proceedings of the 19th annual IFIP WG 11.3 working conference on Data and Applications Security
Keyword search and oblivious pseudorandom functions
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Mercurial commitments with applications to zero-knowledge sets
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Universally composable zero-knowledge sets
International Journal of Grid and Utility Computing
Honest-verifier private disjointness testing without random oracles
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
Concurrent zero knowledge without complexity assumptions
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Mercurial commitments: minimal assumptions and efficient constructions
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Private and verifiable interdomain routing decisions
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
A general, flexible and efficient proof of inclusion and exclusion
INTRUST'11 Proceedings of the Third international conference on Trusted Systems
Private and verifiable interdomain routing decisions
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
Towards privacy-preserving fault detection
Proceedings of the 9th Workshop on Hot Topics in Dependable Systems
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Providing a data location assurance service for cloud storage environments
Journal of Mobile Multimedia
| Hi-index | 0.00 |
We show how a polynomial-time prover can commit to an arbitrary finite set S of strings so that, later on, he can, for any string x, reveal with a proof whether x \in S or x \notin S, without revealing any knowledge beyond the verity of these membership assertions.Our method is non interactive. Given a public random string, the prover commits to a set by simply posting a short and easily computable message. After that, each time it wants to prove whether a given element is in the set, it simply posts another short and easily computable proof, whose correctness can be veri.ed by any one against the public random string.Our scheme is very ef.cient; no reasonable prior way to achieve our desiderata existed. Our new primitive immediately extends to providing zero-knowledge "databases."