Text compression
A design principle for hash functions
CRYPTO '89 Proceedings on Advances in cryptology
One way hash functions and DES
CRYPTO '89 Proceedings on Advances in cryptology
Dynamic Perfect Hashing: Upper and Lower Bounds
SIAM Journal on Computing
One-way accumulators: a decentralized alternative to digital signatures
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Optimal bounds for the predecessor problem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Accountable certificate management using undeniable attestations
Proceedings of the 7th ACM conference on Computer and communications security
Multidimensional binary search trees used for associative searching
Communications of the ACM
Enabling the Archival Storage of Signed Documents
FAST '02 Proceedings of the Conference on File and Storage Technologies
Efficient Accumulators without Trapdoor Extended Abstracts
ICICS '99 Proceedings of the Second International Conference on Information and Communication Security
Time-Stamping with Binary Linking Schemes
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
A Certification Scheme for Electronic Commerce
Proceedings of the International Workshop on Security Protocols
Can We Eliminate Certificate Revocations Lists?
FC '98 Proceedings of the Second International Conference on Financial Cryptography
On Certificate Revocation and Validation
FC '98 Proceedings of the Second International Conference on Financial Cryptography
Proceedings of the Third International Workshop on Fast Software Encryption
Efficient and Fresh Cerification
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Optimally Efficient Accountable Time-Stamping
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Collision-free accumulators and fail-stop signature schemes without trees
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Certificate revocation and certificate update
IEEE Journal on Selected Areas in Communications
Secure History Preservation Through Timeline Entanglement
Proceedings of the 11th USENIX Security Symposium
Certifying data from multiple sources [Extended Abstract]
Proceedings of the 4th ACM conference on Electronic commerce
Type systems equivalent to data-flow analyses for imperative languages
Theoretical Computer Science - Applied semantics
Offline untrusted storage with immediate detection of forking and replay attacks
Proceedings of the 2007 ACM workshop on Scalable trusted computing
Noninvasive Methods for Host Certification
ACM Transactions on Information and System Security (TISSEC)
Knowledge-binding commitments with applications in time-stamping
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
On the cost of persistence and authentication in skip lists
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Indexing information for data forensics
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
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
Secure accumulators from euclidean rings without trusted setup
ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
| Hi-index | 0.00 |
This paper presents a method to increase the accountability of certificate management by making it intractable for the certification authority (CA) to create contradictory statements about the validity of a certificate. The core of the method is a new primitive, undeniable attester, that allows someone to commit to some set S of bitstrings by publishing a short digest of S and to give attestations for any x that it is or is not a member of S. Such an attestation can be verified by obtaining in authenticated way the published digest and applying a verification algorithm to the triple of the bitstring, the attestation and the digest. The most important feature of this primitive is intractability of creating two contradictory proofs for the same candidate element x and digest. We give an efficient construction for undeniable attesters based on authenticated search trees. We show that the construction also applies to sets of more structured elements. We also show that undeniable attesters exist iff collision-resistant hash functions exist.